./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl-simplified/s3_srvr_1.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc7896e2fa777dc2e99796d148e825563a1ec0c0 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:12:46,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:12:46,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:12:46,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:12:46,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:12:46,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:12:46,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:12:46,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:12:46,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:12:46,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:12:46,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:12:46,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:12:46,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:12:46,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:12:46,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:12:46,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:12:46,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:12:46,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:12:46,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:12:46,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:12:46,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:12:46,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:12:46,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:12:46,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:12:46,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:12:46,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:12:46,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:12:46,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:12:46,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:12:46,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:12:46,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:12:46,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:12:46,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:12:46,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:12:46,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:12:46,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:12:46,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:12:46,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:12:46,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:12:46,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:12:46,698 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:12:46,708 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 20:12:46,739 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:12:46,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:12:46,739 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:12:46,740 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:12:46,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:12:46,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:12:46,741 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:12:46,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:12:46,741 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:12:46,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:12:46,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:12:46,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:12:46,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:12:46,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:12:46,743 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:12:46,743 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:12:46,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:12:46,743 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:12:46,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:12:46,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:12:46,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:12:46,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:12:46,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:12:46,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:12:46,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:12:46,749 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:12:46,749 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:12:46,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:12:46,749 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:12:46,750 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:12:46,750 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc7896e2fa777dc2e99796d148e825563a1ec0c0 [2021-08-25 20:12:47,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:12:47,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:12:47,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:12:47,072 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:12:47,073 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:12:47,073 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_1.cil-2.c [2021-08-25 20:12:47,131 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d174dd41a/999a0f1b1bbb42cdbc7d2df47286f375/FLAG27dfa2287 [2021-08-25 20:12:47,564 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:12:47,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1.cil-2.c [2021-08-25 20:12:47,571 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d174dd41a/999a0f1b1bbb42cdbc7d2df47286f375/FLAG27dfa2287 [2021-08-25 20:12:47,580 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d174dd41a/999a0f1b1bbb42cdbc7d2df47286f375 [2021-08-25 20:12:47,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:12:47,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:12:47,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:12:47,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:12:47,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:12:47,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:12:47" (1/1) ... [2021-08-25 20:12:47,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cba33c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:47, skipping insertion in model container [2021-08-25 20:12:47,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:12:47" (1/1) ... [2021-08-25 20:12:47,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:12:47,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:12:47,796 WARN L228 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-simplified/s3_srvr_1.cil-2.c[42909,42922] [2021-08-25 20:12:47,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:12:47,826 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:12:47,911 WARN L228 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-simplified/s3_srvr_1.cil-2.c[42909,42922] [2021-08-25 20:12:47,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:12:47,928 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:12:47,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:47 WrapperNode [2021-08-25 20:12:47,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:12:47,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:12:47,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:12:47,933 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:12:47,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:47" (1/1) ... [2021-08-25 20:12:47,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:47" (1/1) ... [2021-08-25 20:12:47,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:12:47,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:12:47,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:12:47,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:12:47,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:47" (1/1) ... [2021-08-25 20:12:47,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:47" (1/1) ... [2021-08-25 20:12:47,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:47" (1/1) ... [2021-08-25 20:12:47,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:47" (1/1) ... [2021-08-25 20:12:48,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:47" (1/1) ... [2021-08-25 20:12:48,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:47" (1/1) ... [2021-08-25 20:12:48,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:47" (1/1) ... [2021-08-25 20:12:48,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:12:48,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:12:48,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:12:48,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:12:48,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:47" (1/1) ... [2021-08-25 20:12:48,036 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:12:48,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:12:48,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:12:48,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:12:48,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:12:48,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:12:48,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:12:48,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:12:48,271 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:12:48,703 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-08-25 20:12:48,703 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-08-25 20:12:48,708 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:12:48,708 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-08-25 20:12:48,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:12:48 BoogieIcfgContainer [2021-08-25 20:12:48,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:12:48,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:12:48,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:12:48,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:12:48,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:12:47" (1/3) ... [2021-08-25 20:12:48,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103ab6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:12:48, skipping insertion in model container [2021-08-25 20:12:48,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:47" (2/3) ... [2021-08-25 20:12:48,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103ab6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:12:48, skipping insertion in model container [2021-08-25 20:12:48,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:12:48" (3/3) ... [2021-08-25 20:12:48,714 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-2.c [2021-08-25 20:12:48,718 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:12:48,718 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:12:48,747 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:12:48,751 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:12:48,751 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:12:48,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 141 states have (on average 1.7163120567375887) internal successors, (242), 142 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:48,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-25 20:12:48,770 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:48,770 INFO L512 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] [2021-08-25 20:12:48,771 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:48,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:48,774 INFO L82 PathProgramCache]: Analyzing trace with hash -947483280, now seen corresponding path program 1 times [2021-08-25 20:12:48,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:48,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577510746] [2021-08-25 20:12:48,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:48,781 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:12:48,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:48,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577510746] [2021-08-25 20:12:48,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577510746] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:48,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:48,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:48,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290077776] [2021-08-25 20:12:48,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:48,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:48,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:48,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:48,976 INFO L87 Difference]: Start difference. First operand has 143 states, 141 states have (on average 1.7163120567375887) internal successors, (242), 142 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:49,239 INFO L93 Difference]: Finished difference Result 333 states and 570 transitions. [2021-08-25 20:12:49,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:49,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-08-25 20:12:49,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:49,247 INFO L225 Difference]: With dead ends: 333 [2021-08-25 20:12:49,247 INFO L226 Difference]: Without dead ends: 178 [2021-08-25 20:12:49,249 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-08-25 20:12:49,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 172. [2021-08-25 20:12:49,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.6257309941520468) internal successors, (278), 171 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 278 transitions. [2021-08-25 20:12:49,293 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 278 transitions. Word has length 45 [2021-08-25 20:12:49,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:49,293 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 278 transitions. [2021-08-25 20:12:49,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 278 transitions. [2021-08-25 20:12:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-25 20:12:49,295 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:49,295 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:49,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:12:49,295 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:49,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:49,296 INFO L82 PathProgramCache]: Analyzing trace with hash 472840014, now seen corresponding path program 1 times [2021-08-25 20:12:49,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:49,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44672982] [2021-08-25 20:12:49,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:49,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:12:49,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:49,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44672982] [2021-08-25 20:12:49,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44672982] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:49,368 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:49,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:49,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264212275] [2021-08-25 20:12:49,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:49,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:49,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:49,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:49,371 INFO L87 Difference]: Start difference. First operand 172 states and 278 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:49,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:49,562 INFO L93 Difference]: Finished difference Result 385 states and 632 transitions. [2021-08-25 20:12:49,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:49,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-08-25 20:12:49,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:49,564 INFO L225 Difference]: With dead ends: 385 [2021-08-25 20:12:49,564 INFO L226 Difference]: Without dead ends: 219 [2021-08-25 20:12:49,565 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-08-25 20:12:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2021-08-25 20:12:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.6745283018867925) internal successors, (355), 212 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 355 transitions. [2021-08-25 20:12:49,584 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 355 transitions. Word has length 46 [2021-08-25 20:12:49,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:49,585 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 355 transitions. [2021-08-25 20:12:49,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 355 transitions. [2021-08-25 20:12:49,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-25 20:12:49,586 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:49,586 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:49,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:12:49,587 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:49,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:49,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1408137310, now seen corresponding path program 1 times [2021-08-25 20:12:49,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:49,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37075000] [2021-08-25 20:12:49,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:49,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:12:49,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:49,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37075000] [2021-08-25 20:12:49,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37075000] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:49,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:49,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:49,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483478239] [2021-08-25 20:12:49,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:49,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:49,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:49,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:49,669 INFO L87 Difference]: Start difference. First operand 213 states and 355 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:49,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:49,801 INFO L93 Difference]: Finished difference Result 449 states and 756 transitions. [2021-08-25 20:12:49,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:49,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-08-25 20:12:49,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:49,802 INFO L225 Difference]: With dead ends: 449 [2021-08-25 20:12:49,802 INFO L226 Difference]: Without dead ends: 244 [2021-08-25 20:12:49,803 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:49,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-08-25 20:12:49,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2021-08-25 20:12:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.691358024691358) internal successors, (411), 243 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 411 transitions. [2021-08-25 20:12:49,811 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 411 transitions. Word has length 74 [2021-08-25 20:12:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:49,811 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 411 transitions. [2021-08-25 20:12:49,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:49,811 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 411 transitions. [2021-08-25 20:12:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:12:49,813 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:49,813 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:49,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:12:49,814 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:49,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:49,814 INFO L82 PathProgramCache]: Analyzing trace with hash 747162323, now seen corresponding path program 1 times [2021-08-25 20:12:49,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:49,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619761499] [2021-08-25 20:12:49,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:49,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:49,864 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:12:49,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:49,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619761499] [2021-08-25 20:12:49,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619761499] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:49,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:49,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:49,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371875222] [2021-08-25 20:12:49,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:49,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:49,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:49,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:49,866 INFO L87 Difference]: Start difference. First operand 244 states and 411 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:50,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:50,014 INFO L93 Difference]: Finished difference Result 526 states and 892 transitions. [2021-08-25 20:12:50,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:50,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-25 20:12:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:50,016 INFO L225 Difference]: With dead ends: 526 [2021-08-25 20:12:50,016 INFO L226 Difference]: Without dead ends: 290 [2021-08-25 20:12:50,016 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:50,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-08-25 20:12:50,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 286. [2021-08-25 20:12:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 1.7052631578947368) internal successors, (486), 285 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 486 transitions. [2021-08-25 20:12:50,028 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 486 transitions. Word has length 85 [2021-08-25 20:12:50,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:50,028 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 486 transitions. [2021-08-25 20:12:50,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:50,028 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 486 transitions. [2021-08-25 20:12:50,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-25 20:12:50,029 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:50,030 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:50,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:12:50,030 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:50,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:50,030 INFO L82 PathProgramCache]: Analyzing trace with hash -423051016, now seen corresponding path program 1 times [2021-08-25 20:12:50,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:50,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48051381] [2021-08-25 20:12:50,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:50,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:12:50,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:50,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48051381] [2021-08-25 20:12:50,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48051381] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:50,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:50,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:50,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140716304] [2021-08-25 20:12:50,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:50,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:50,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:50,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:50,097 INFO L87 Difference]: Start difference. First operand 286 states and 486 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:50,214 INFO L93 Difference]: Finished difference Result 581 states and 988 transitions. [2021-08-25 20:12:50,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:50,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-08-25 20:12:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:50,217 INFO L225 Difference]: With dead ends: 581 [2021-08-25 20:12:50,217 INFO L226 Difference]: Without dead ends: 303 [2021-08-25 20:12:50,217 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-08-25 20:12:50,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2021-08-25 20:12:50,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.6933333333333334) internal successors, (508), 300 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 508 transitions. [2021-08-25 20:12:50,228 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 508 transitions. Word has length 86 [2021-08-25 20:12:50,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:50,229 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 508 transitions. [2021-08-25 20:12:50,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 508 transitions. [2021-08-25 20:12:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-25 20:12:50,231 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:50,232 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:50,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:12:50,232 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:50,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:50,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1186992623, now seen corresponding path program 1 times [2021-08-25 20:12:50,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:50,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470220567] [2021-08-25 20:12:50,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:50,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:50,305 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:12:50,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:50,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470220567] [2021-08-25 20:12:50,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470220567] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:50,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:50,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:50,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072440559] [2021-08-25 20:12:50,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:50,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:50,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:50,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:50,314 INFO L87 Difference]: Start difference. First operand 301 states and 508 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:50,468 INFO L93 Difference]: Finished difference Result 598 states and 1009 transitions. [2021-08-25 20:12:50,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:50,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-08-25 20:12:50,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:50,477 INFO L225 Difference]: With dead ends: 598 [2021-08-25 20:12:50,478 INFO L226 Difference]: Without dead ends: 303 [2021-08-25 20:12:50,478 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:50,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-08-25 20:12:50,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2021-08-25 20:12:50,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6879194630872483) internal successors, (503), 298 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:50,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 503 transitions. [2021-08-25 20:12:50,487 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 503 transitions. Word has length 86 [2021-08-25 20:12:50,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:50,487 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 503 transitions. [2021-08-25 20:12:50,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 503 transitions. [2021-08-25 20:12:50,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-25 20:12:50,489 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:50,489 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:50,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:12:50,489 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:50,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:50,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1500193951, now seen corresponding path program 1 times [2021-08-25 20:12:50,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:50,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460948845] [2021-08-25 20:12:50,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:50,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:12:50,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:50,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460948845] [2021-08-25 20:12:50,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460948845] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:50,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:50,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:50,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082535632] [2021-08-25 20:12:50,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:50,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:50,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:50,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:50,547 INFO L87 Difference]: Start difference. First operand 299 states and 503 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:50,649 INFO L93 Difference]: Finished difference Result 592 states and 996 transitions. [2021-08-25 20:12:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:50,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-08-25 20:12:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:50,651 INFO L225 Difference]: With dead ends: 592 [2021-08-25 20:12:50,651 INFO L226 Difference]: Without dead ends: 301 [2021-08-25 20:12:50,652 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:50,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-08-25 20:12:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2021-08-25 20:12:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.674496644295302) internal successors, (499), 298 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:50,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 499 transitions. [2021-08-25 20:12:50,661 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 499 transitions. Word has length 87 [2021-08-25 20:12:50,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:50,661 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 499 transitions. [2021-08-25 20:12:50,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:50,661 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 499 transitions. [2021-08-25 20:12:50,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:12:50,662 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:50,663 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:50,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:12:50,663 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:50,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:50,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1972207359, now seen corresponding path program 1 times [2021-08-25 20:12:50,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:50,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936393535] [2021-08-25 20:12:50,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:50,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:50,701 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:12:50,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:50,702 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936393535] [2021-08-25 20:12:50,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936393535] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:50,702 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:50,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:50,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980505683] [2021-08-25 20:12:50,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:50,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:50,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:50,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:50,703 INFO L87 Difference]: Start difference. First operand 299 states and 499 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:50,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:50,777 INFO L93 Difference]: Finished difference Result 599 states and 998 transitions. [2021-08-25 20:12:50,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:50,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:12:50,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:50,778 INFO L225 Difference]: With dead ends: 599 [2021-08-25 20:12:50,778 INFO L226 Difference]: Without dead ends: 308 [2021-08-25 20:12:50,779 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:50,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-08-25 20:12:50,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2021-08-25 20:12:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.6449511400651466) internal successors, (505), 307 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:50,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 505 transitions. [2021-08-25 20:12:50,785 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 505 transitions. Word has length 100 [2021-08-25 20:12:50,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:50,785 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 505 transitions. [2021-08-25 20:12:50,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:50,785 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 505 transitions. [2021-08-25 20:12:50,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:12:50,786 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:50,786 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:50,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:12:50,786 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:50,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:50,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1581377797, now seen corresponding path program 1 times [2021-08-25 20:12:50,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:50,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078826] [2021-08-25 20:12:50,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:50,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:50,821 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:12:50,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:50,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078826] [2021-08-25 20:12:50,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078826] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:50,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:50,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:50,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421220327] [2021-08-25 20:12:50,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:50,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:50,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:50,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:50,826 INFO L87 Difference]: Start difference. First operand 308 states and 505 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:50,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:50,925 INFO L93 Difference]: Finished difference Result 639 states and 1051 transitions. [2021-08-25 20:12:50,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:50,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:12:50,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:50,928 INFO L225 Difference]: With dead ends: 639 [2021-08-25 20:12:50,928 INFO L226 Difference]: Without dead ends: 339 [2021-08-25 20:12:50,929 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-08-25 20:12:50,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2021-08-25 20:12:50,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 1.6428571428571428) internal successors, (552), 336 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:50,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 552 transitions. [2021-08-25 20:12:50,937 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 552 transitions. Word has length 100 [2021-08-25 20:12:50,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:50,938 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 552 transitions. [2021-08-25 20:12:50,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:50,938 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 552 transitions. [2021-08-25 20:12:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:12:50,939 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:50,939 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:50,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:12:50,939 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:50,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:50,939 INFO L82 PathProgramCache]: Analyzing trace with hash -452761918, now seen corresponding path program 1 times [2021-08-25 20:12:50,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:50,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503456036] [2021-08-25 20:12:50,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:50,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:50,976 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:12:50,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:50,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503456036] [2021-08-25 20:12:50,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503456036] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:50,976 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:50,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:50,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900034661] [2021-08-25 20:12:50,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:50,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:50,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:50,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:50,978 INFO L87 Difference]: Start difference. First operand 337 states and 552 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:51,094 INFO L93 Difference]: Finished difference Result 668 states and 1094 transitions. [2021-08-25 20:12:51,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:51,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-08-25 20:12:51,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:51,096 INFO L225 Difference]: With dead ends: 668 [2021-08-25 20:12:51,096 INFO L226 Difference]: Without dead ends: 339 [2021-08-25 20:12:51,097 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:51,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-08-25 20:12:51,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2021-08-25 20:12:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 1.630952380952381) internal successors, (548), 336 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 548 transitions. [2021-08-25 20:12:51,106 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 548 transitions. Word has length 101 [2021-08-25 20:12:51,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:51,107 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 548 transitions. [2021-08-25 20:12:51,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,107 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 548 transitions. [2021-08-25 20:12:51,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-08-25 20:12:51,108 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:51,108 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:51,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:12:51,109 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:51,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:51,109 INFO L82 PathProgramCache]: Analyzing trace with hash 19268267, now seen corresponding path program 1 times [2021-08-25 20:12:51,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:51,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589560851] [2021-08-25 20:12:51,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:51,111 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:12:51,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:51,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589560851] [2021-08-25 20:12:51,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589560851] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:51,138 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:51,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:51,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006492645] [2021-08-25 20:12:51,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:51,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:51,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:51,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:51,140 INFO L87 Difference]: Start difference. First operand 337 states and 548 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:51,242 INFO L93 Difference]: Finished difference Result 701 states and 1144 transitions. [2021-08-25 20:12:51,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:51,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-08-25 20:12:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:51,244 INFO L225 Difference]: With dead ends: 701 [2021-08-25 20:12:51,245 INFO L226 Difference]: Without dead ends: 372 [2021-08-25 20:12:51,245 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:51,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-08-25 20:12:51,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 364. [2021-08-25 20:12:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 1.6253443526170799) internal successors, (590), 363 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 590 transitions. [2021-08-25 20:12:51,263 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 590 transitions. Word has length 102 [2021-08-25 20:12:51,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:51,263 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 590 transitions. [2021-08-25 20:12:51,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,263 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 590 transitions. [2021-08-25 20:12:51,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-25 20:12:51,264 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:51,264 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:51,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:12:51,264 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:51,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:51,265 INFO L82 PathProgramCache]: Analyzing trace with hash 997966866, now seen corresponding path program 1 times [2021-08-25 20:12:51,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:51,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624182478] [2021-08-25 20:12:51,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:51,265 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:12:51,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:51,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624182478] [2021-08-25 20:12:51,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624182478] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:51,293 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:51,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:51,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934627433] [2021-08-25 20:12:51,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:51,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:51,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:51,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:51,294 INFO L87 Difference]: Start difference. First operand 364 states and 590 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:51,393 INFO L93 Difference]: Finished difference Result 728 states and 1181 transitions. [2021-08-25 20:12:51,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:51,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-25 20:12:51,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:51,396 INFO L225 Difference]: With dead ends: 728 [2021-08-25 20:12:51,397 INFO L226 Difference]: Without dead ends: 372 [2021-08-25 20:12:51,397 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:51,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-08-25 20:12:51,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 364. [2021-08-25 20:12:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 1.6115702479338843) internal successors, (585), 363 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 585 transitions. [2021-08-25 20:12:51,405 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 585 transitions. Word has length 103 [2021-08-25 20:12:51,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:51,406 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 585 transitions. [2021-08-25 20:12:51,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,406 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 585 transitions. [2021-08-25 20:12:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-25 20:12:51,407 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:51,407 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:51,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:12:51,407 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:51,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:51,408 INFO L82 PathProgramCache]: Analyzing trace with hash 519079913, now seen corresponding path program 1 times [2021-08-25 20:12:51,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:51,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131049750] [2021-08-25 20:12:51,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:51,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-25 20:12:51,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:51,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131049750] [2021-08-25 20:12:51,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131049750] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:51,431 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:51,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:51,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420356018] [2021-08-25 20:12:51,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:51,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:51,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:51,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:51,432 INFO L87 Difference]: Start difference. First operand 364 states and 585 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:51,540 INFO L93 Difference]: Finished difference Result 745 states and 1199 transitions. [2021-08-25 20:12:51,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:51,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-25 20:12:51,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:51,541 INFO L225 Difference]: With dead ends: 745 [2021-08-25 20:12:51,542 INFO L226 Difference]: Without dead ends: 389 [2021-08-25 20:12:51,542 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:51,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-08-25 20:12:51,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2021-08-25 20:12:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.5989583333333333) internal successors, (614), 384 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 614 transitions. [2021-08-25 20:12:51,550 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 614 transitions. Word has length 106 [2021-08-25 20:12:51,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:51,551 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 614 transitions. [2021-08-25 20:12:51,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,551 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 614 transitions. [2021-08-25 20:12:51,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-08-25 20:12:51,552 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:51,552 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:51,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:12:51,552 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:51,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:51,553 INFO L82 PathProgramCache]: Analyzing trace with hash -551095312, now seen corresponding path program 1 times [2021-08-25 20:12:51,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:51,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555855030] [2021-08-25 20:12:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:51,553 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-25 20:12:51,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:51,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555855030] [2021-08-25 20:12:51,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555855030] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:51,573 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:51,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:51,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399942000] [2021-08-25 20:12:51,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:51,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:51,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:51,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:51,574 INFO L87 Difference]: Start difference. First operand 385 states and 614 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:51,663 INFO L93 Difference]: Finished difference Result 766 states and 1222 transitions. [2021-08-25 20:12:51,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:51,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-08-25 20:12:51,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:51,665 INFO L225 Difference]: With dead ends: 766 [2021-08-25 20:12:51,665 INFO L226 Difference]: Without dead ends: 389 [2021-08-25 20:12:51,666 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-08-25 20:12:51,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2021-08-25 20:12:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.5833333333333333) internal successors, (608), 384 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 608 transitions. [2021-08-25 20:12:51,674 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 608 transitions. Word has length 107 [2021-08-25 20:12:51,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:51,675 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 608 transitions. [2021-08-25 20:12:51,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,675 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 608 transitions. [2021-08-25 20:12:51,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-08-25 20:12:51,676 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:51,676 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:51,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:12:51,676 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:51,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:51,677 INFO L82 PathProgramCache]: Analyzing trace with hash -804010043, now seen corresponding path program 1 times [2021-08-25 20:12:51,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:51,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444386251] [2021-08-25 20:12:51,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:51,677 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:12:51,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:51,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444386251] [2021-08-25 20:12:51,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444386251] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:51,704 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:51,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:51,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930686186] [2021-08-25 20:12:51,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:51,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:51,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:51,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:51,705 INFO L87 Difference]: Start difference. First operand 385 states and 608 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:51,744 INFO L93 Difference]: Finished difference Result 1093 states and 1730 transitions. [2021-08-25 20:12:51,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:51,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2021-08-25 20:12:51,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:51,747 INFO L225 Difference]: With dead ends: 1093 [2021-08-25 20:12:51,747 INFO L226 Difference]: Without dead ends: 716 [2021-08-25 20:12:51,748 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:51,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-08-25 20:12:51,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2021-08-25 20:12:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.5776223776223777) internal successors, (1128), 715 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1128 transitions. [2021-08-25 20:12:51,768 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1128 transitions. Word has length 122 [2021-08-25 20:12:51,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:51,769 INFO L470 AbstractCegarLoop]: Abstraction has 716 states and 1128 transitions. [2021-08-25 20:12:51,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,769 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1128 transitions. [2021-08-25 20:12:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-08-25 20:12:51,770 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:51,770 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:51,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:12:51,771 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:51,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:51,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1245377799, now seen corresponding path program 1 times [2021-08-25 20:12:51,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:51,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113024265] [2021-08-25 20:12:51,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:51,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-08-25 20:12:51,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:51,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113024265] [2021-08-25 20:12:51,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113024265] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:51,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:51,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:51,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525136446] [2021-08-25 20:12:51,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:51,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:51,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:51,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:51,814 INFO L87 Difference]: Start difference. First operand 716 states and 1128 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:51,857 INFO L93 Difference]: Finished difference Result 1799 states and 2839 transitions. [2021-08-25 20:12:51,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:51,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2021-08-25 20:12:51,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:51,862 INFO L225 Difference]: With dead ends: 1799 [2021-08-25 20:12:51,862 INFO L226 Difference]: Without dead ends: 1091 [2021-08-25 20:12:51,863 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:51,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2021-08-25 20:12:51,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1091. [2021-08-25 20:12:51,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1090 states have (on average 1.5788990825688074) internal successors, (1721), 1090 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1721 transitions. [2021-08-25 20:12:51,893 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1721 transitions. Word has length 122 [2021-08-25 20:12:51,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:51,893 INFO L470 AbstractCegarLoop]: Abstraction has 1091 states and 1721 transitions. [2021-08-25 20:12:51,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1721 transitions. [2021-08-25 20:12:51,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-08-25 20:12:51,896 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:51,896 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:51,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:12:51,896 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:51,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:51,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1964025029, now seen corresponding path program 1 times [2021-08-25 20:12:51,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:51,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098496848] [2021-08-25 20:12:51,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:51,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-25 20:12:51,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:51,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098496848] [2021-08-25 20:12:51,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098496848] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:51,941 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:51,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:51,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764499568] [2021-08-25 20:12:51,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:51,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:51,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:51,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:51,943 INFO L87 Difference]: Start difference. First operand 1091 states and 1721 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:52,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:52,117 INFO L93 Difference]: Finished difference Result 2300 states and 3633 transitions. [2021-08-25 20:12:52,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:52,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2021-08-25 20:12:52,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:52,122 INFO L225 Difference]: With dead ends: 2300 [2021-08-25 20:12:52,122 INFO L226 Difference]: Without dead ends: 1217 [2021-08-25 20:12:52,124 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2021-08-25 20:12:52,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1205. [2021-08-25 20:12:52,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 1204 states have (on average 1.5772425249169435) internal successors, (1899), 1204 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1899 transitions. [2021-08-25 20:12:52,160 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1899 transitions. Word has length 123 [2021-08-25 20:12:52,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:52,160 INFO L470 AbstractCegarLoop]: Abstraction has 1205 states and 1899 transitions. [2021-08-25 20:12:52,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1899 transitions. [2021-08-25 20:12:52,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-08-25 20:12:52,163 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:52,163 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-08-25 20:12:52,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:12:52,163 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:52,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:52,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1664288541, now seen corresponding path program 1 times [2021-08-25 20:12:52,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:52,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816755646] [2021-08-25 20:12:52,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:52,164 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-25 20:12:52,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:52,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816755646] [2021-08-25 20:12:52,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816755646] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:52,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:52,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:52,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653877145] [2021-08-25 20:12:52,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:52,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:52,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:52,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:52,194 INFO L87 Difference]: Start difference. First operand 1205 states and 1899 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:52,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:52,369 INFO L93 Difference]: Finished difference Result 2414 states and 3803 transitions. [2021-08-25 20:12:52,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:52,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2021-08-25 20:12:52,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:52,376 INFO L225 Difference]: With dead ends: 2414 [2021-08-25 20:12:52,376 INFO L226 Difference]: Without dead ends: 1211 [2021-08-25 20:12:52,378 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:52,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2021-08-25 20:12:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1199. [2021-08-25 20:12:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 1198 states have (on average 1.5709515859766277) internal successors, (1882), 1198 states have internal predecessors, (1882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1882 transitions. [2021-08-25 20:12:52,413 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1882 transitions. Word has length 124 [2021-08-25 20:12:52,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:52,413 INFO L470 AbstractCegarLoop]: Abstraction has 1199 states and 1882 transitions. [2021-08-25 20:12:52,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1882 transitions. [2021-08-25 20:12:52,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-08-25 20:12:52,416 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:52,417 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:52,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:12:52,417 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:52,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:52,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1841672054, now seen corresponding path program 1 times [2021-08-25 20:12:52,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:52,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339240606] [2021-08-25 20:12:52,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:52,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-08-25 20:12:52,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:52,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339240606] [2021-08-25 20:12:52,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339240606] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:52,452 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:52,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:52,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287082290] [2021-08-25 20:12:52,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:52,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:52,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:52,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:52,454 INFO L87 Difference]: Start difference. First operand 1199 states and 1882 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:52,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:52,626 INFO L93 Difference]: Finished difference Result 2504 states and 3932 transitions. [2021-08-25 20:12:52,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:52,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2021-08-25 20:12:52,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:52,631 INFO L225 Difference]: With dead ends: 2504 [2021-08-25 20:12:52,631 INFO L226 Difference]: Without dead ends: 1313 [2021-08-25 20:12:52,633 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2021-08-25 20:12:52,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1307. [2021-08-25 20:12:52,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 1306 states have (on average 1.5658499234303216) internal successors, (2045), 1306 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 2045 transitions. [2021-08-25 20:12:52,671 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 2045 transitions. Word has length 156 [2021-08-25 20:12:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:52,672 INFO L470 AbstractCegarLoop]: Abstraction has 1307 states and 2045 transitions. [2021-08-25 20:12:52,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:52,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 2045 transitions. [2021-08-25 20:12:52,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-08-25 20:12:52,675 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:52,675 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:52,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:12:52,676 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:52,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:52,676 INFO L82 PathProgramCache]: Analyzing trace with hash 498338744, now seen corresponding path program 1 times [2021-08-25 20:12:52,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:52,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881786619] [2021-08-25 20:12:52,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:52,677 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-08-25 20:12:52,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:52,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881786619] [2021-08-25 20:12:52,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881786619] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:52,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:52,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:52,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747236612] [2021-08-25 20:12:52,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:52,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:52,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:52,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:52,708 INFO L87 Difference]: Start difference. First operand 1307 states and 2045 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:52,867 INFO L93 Difference]: Finished difference Result 2612 states and 4084 transitions. [2021-08-25 20:12:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:52,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2021-08-25 20:12:52,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:52,872 INFO L225 Difference]: With dead ends: 2612 [2021-08-25 20:12:52,872 INFO L226 Difference]: Without dead ends: 1307 [2021-08-25 20:12:52,874 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:52,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2021-08-25 20:12:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1301. [2021-08-25 20:12:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1301 states, 1300 states have (on average 1.5576923076923077) internal successors, (2025), 1300 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:52,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 2025 transitions. [2021-08-25 20:12:52,925 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 2025 transitions. Word has length 157 [2021-08-25 20:12:52,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:52,925 INFO L470 AbstractCegarLoop]: Abstraction has 1301 states and 2025 transitions. [2021-08-25 20:12:52,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 2025 transitions. [2021-08-25 20:12:52,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-08-25 20:12:52,929 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:52,929 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:52,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:12:52,930 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:52,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:52,930 INFO L82 PathProgramCache]: Analyzing trace with hash 110608000, now seen corresponding path program 1 times [2021-08-25 20:12:52,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:52,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373556397] [2021-08-25 20:12:52,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:52,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2021-08-25 20:12:52,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:52,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373556397] [2021-08-25 20:12:52,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373556397] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:52,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:52,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:52,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570236319] [2021-08-25 20:12:52,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:52,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:52,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:52,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:52,963 INFO L87 Difference]: Start difference. First operand 1301 states and 2025 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:53,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:53,120 INFO L93 Difference]: Finished difference Result 2702 states and 4206 transitions. [2021-08-25 20:12:53,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:53,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2021-08-25 20:12:53,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:53,126 INFO L225 Difference]: With dead ends: 2702 [2021-08-25 20:12:53,126 INFO L226 Difference]: Without dead ends: 1409 [2021-08-25 20:12:53,128 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:53,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2021-08-25 20:12:53,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1403. [2021-08-25 20:12:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1403 states, 1402 states have (on average 1.5499286733238231) internal successors, (2173), 1402 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 2173 transitions. [2021-08-25 20:12:53,175 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 2173 transitions. Word has length 187 [2021-08-25 20:12:53,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:53,176 INFO L470 AbstractCegarLoop]: Abstraction has 1403 states and 2173 transitions. [2021-08-25 20:12:53,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:53,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 2173 transitions. [2021-08-25 20:12:53,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-08-25 20:12:53,180 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:53,180 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:53,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:12:53,191 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:53,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:53,192 INFO L82 PathProgramCache]: Analyzing trace with hash 2026387806, now seen corresponding path program 1 times [2021-08-25 20:12:53,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:53,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769385498] [2021-08-25 20:12:53,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:53,192 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2021-08-25 20:12:53,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:53,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769385498] [2021-08-25 20:12:53,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769385498] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:53,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:53,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:53,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998682925] [2021-08-25 20:12:53,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:53,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:53,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:53,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:53,230 INFO L87 Difference]: Start difference. First operand 1403 states and 2173 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:53,419 INFO L93 Difference]: Finished difference Result 2804 states and 4340 transitions. [2021-08-25 20:12:53,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:53,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2021-08-25 20:12:53,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:53,426 INFO L225 Difference]: With dead ends: 2804 [2021-08-25 20:12:53,426 INFO L226 Difference]: Without dead ends: 1403 [2021-08-25 20:12:53,429 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:53,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2021-08-25 20:12:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1397. [2021-08-25 20:12:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1396 states have (on average 1.5401146131805157) internal successors, (2150), 1396 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2150 transitions. [2021-08-25 20:12:53,485 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2150 transitions. Word has length 188 [2021-08-25 20:12:53,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:53,485 INFO L470 AbstractCegarLoop]: Abstraction has 1397 states and 2150 transitions. [2021-08-25 20:12:53,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:53,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2150 transitions. [2021-08-25 20:12:53,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-08-25 20:12:53,490 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:53,490 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:53,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:12:53,490 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:53,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:53,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1511540587, now seen corresponding path program 1 times [2021-08-25 20:12:53,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:53,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788516010] [2021-08-25 20:12:53,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:53,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2021-08-25 20:12:53,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:53,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788516010] [2021-08-25 20:12:53,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788516010] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:53,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:53,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:53,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774104741] [2021-08-25 20:12:53,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:53,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:53,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:53,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:53,540 INFO L87 Difference]: Start difference. First operand 1397 states and 2150 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:53,663 INFO L93 Difference]: Finished difference Result 2900 states and 4474 transitions. [2021-08-25 20:12:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:53,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2021-08-25 20:12:53,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:53,668 INFO L225 Difference]: With dead ends: 2900 [2021-08-25 20:12:53,669 INFO L226 Difference]: Without dead ends: 1511 [2021-08-25 20:12:53,670 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:53,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2021-08-25 20:12:53,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1472. [2021-08-25 20:12:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1472 states, 1471 states have (on average 1.5275322909585316) internal successors, (2247), 1471 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 2247 transitions. [2021-08-25 20:12:53,715 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 2247 transitions. Word has length 206 [2021-08-25 20:12:53,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:53,715 INFO L470 AbstractCegarLoop]: Abstraction has 1472 states and 2247 transitions. [2021-08-25 20:12:53,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 2247 transitions. [2021-08-25 20:12:53,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-08-25 20:12:53,719 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:53,719 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:53,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-25 20:12:53,719 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:53,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:53,720 INFO L82 PathProgramCache]: Analyzing trace with hash -273801636, now seen corresponding path program 1 times [2021-08-25 20:12:53,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:53,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720936602] [2021-08-25 20:12:53,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:53,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2021-08-25 20:12:53,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:53,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720936602] [2021-08-25 20:12:53,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720936602] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:53,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:53,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:53,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072324353] [2021-08-25 20:12:53,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:53,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:53,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:53,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:53,745 INFO L87 Difference]: Start difference. First operand 1472 states and 2247 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:53,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:53,872 INFO L93 Difference]: Finished difference Result 2975 states and 4545 transitions. [2021-08-25 20:12:53,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:53,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2021-08-25 20:12:53,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:53,877 INFO L225 Difference]: With dead ends: 2975 [2021-08-25 20:12:53,877 INFO L226 Difference]: Without dead ends: 1511 [2021-08-25 20:12:53,879 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:53,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2021-08-25 20:12:53,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1472. [2021-08-25 20:12:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1472 states, 1471 states have (on average 1.5098572399728076) internal successors, (2221), 1471 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 2221 transitions. [2021-08-25 20:12:53,919 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 2221 transitions. Word has length 207 [2021-08-25 20:12:53,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:53,919 INFO L470 AbstractCegarLoop]: Abstraction has 1472 states and 2221 transitions. [2021-08-25 20:12:53,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:53,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 2221 transitions. [2021-08-25 20:12:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-08-25 20:12:53,922 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:53,923 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:53,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:12:53,923 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:53,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:53,923 INFO L82 PathProgramCache]: Analyzing trace with hash -850065258, now seen corresponding path program 1 times [2021-08-25 20:12:53,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:53,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887514998] [2021-08-25 20:12:53,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:53,924 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2021-08-25 20:12:53,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:53,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887514998] [2021-08-25 20:12:53,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887514998] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:53,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:53,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:53,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26553336] [2021-08-25 20:12:53,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:53,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:53,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:53,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:53,948 INFO L87 Difference]: Start difference. First operand 1472 states and 2221 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:54,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:54,088 INFO L93 Difference]: Finished difference Result 2948 states and 4445 transitions. [2021-08-25 20:12:54,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:54,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218 [2021-08-25 20:12:54,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:54,092 INFO L225 Difference]: With dead ends: 2948 [2021-08-25 20:12:54,093 INFO L226 Difference]: Without dead ends: 1484 [2021-08-25 20:12:54,094 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:54,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2021-08-25 20:12:54,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1472. [2021-08-25 20:12:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1472 states, 1471 states have (on average 1.4983004758667573) internal successors, (2204), 1471 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:54,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 2204 transitions. [2021-08-25 20:12:54,133 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 2204 transitions. Word has length 218 [2021-08-25 20:12:54,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:54,133 INFO L470 AbstractCegarLoop]: Abstraction has 1472 states and 2204 transitions. [2021-08-25 20:12:54,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:54,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 2204 transitions. [2021-08-25 20:12:54,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-08-25 20:12:54,136 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:54,137 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:54,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-25 20:12:54,137 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:54,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:54,137 INFO L82 PathProgramCache]: Analyzing trace with hash -875282792, now seen corresponding path program 1 times [2021-08-25 20:12:54,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:54,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462785995] [2021-08-25 20:12:54,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:54,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2021-08-25 20:12:54,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:54,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462785995] [2021-08-25 20:12:54,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462785995] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:54,161 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:54,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:54,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599096087] [2021-08-25 20:12:54,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:54,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:54,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:54,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:54,163 INFO L87 Difference]: Start difference. First operand 1472 states and 2204 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:54,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:54,305 INFO L93 Difference]: Finished difference Result 2948 states and 4411 transitions. [2021-08-25 20:12:54,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:54,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219 [2021-08-25 20:12:54,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:54,310 INFO L225 Difference]: With dead ends: 2948 [2021-08-25 20:12:54,310 INFO L226 Difference]: Without dead ends: 1457 [2021-08-25 20:12:54,312 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:54,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2021-08-25 20:12:54,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1445. [2021-08-25 20:12:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.4875346260387812) internal successors, (2148), 1444 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2148 transitions. [2021-08-25 20:12:54,349 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2148 transitions. Word has length 219 [2021-08-25 20:12:54,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:54,349 INFO L470 AbstractCegarLoop]: Abstraction has 1445 states and 2148 transitions. [2021-08-25 20:12:54,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:54,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2148 transitions. [2021-08-25 20:12:54,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2021-08-25 20:12:54,353 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:54,353 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:54,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-25 20:12:54,353 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:54,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:54,354 INFO L82 PathProgramCache]: Analyzing trace with hash -176590901, now seen corresponding path program 1 times [2021-08-25 20:12:54,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:54,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385447658] [2021-08-25 20:12:54,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:54,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2021-08-25 20:12:54,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:54,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385447658] [2021-08-25 20:12:54,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385447658] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:54,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:54,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:54,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592196249] [2021-08-25 20:12:54,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:54,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:54,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:54,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:54,379 INFO L87 Difference]: Start difference. First operand 1445 states and 2148 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:54,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:54,513 INFO L93 Difference]: Finished difference Result 2963 states and 4410 transitions. [2021-08-25 20:12:54,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:54,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227 [2021-08-25 20:12:54,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:54,517 INFO L225 Difference]: With dead ends: 2963 [2021-08-25 20:12:54,518 INFO L226 Difference]: Without dead ends: 1526 [2021-08-25 20:12:54,519 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:54,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2021-08-25 20:12:54,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1514. [2021-08-25 20:12:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1513 states have (on average 1.4738929279577) internal successors, (2230), 1513 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:54,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2230 transitions. [2021-08-25 20:12:54,557 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2230 transitions. Word has length 227 [2021-08-25 20:12:54,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:54,557 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 2230 transitions. [2021-08-25 20:12:54,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:54,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2230 transitions. [2021-08-25 20:12:54,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2021-08-25 20:12:54,562 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:54,562 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:54,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-25 20:12:54,562 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:54,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:54,563 INFO L82 PathProgramCache]: Analyzing trace with hash 581034244, now seen corresponding path program 1 times [2021-08-25 20:12:54,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:54,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812278042] [2021-08-25 20:12:54,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:54,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2021-08-25 20:12:54,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:54,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812278042] [2021-08-25 20:12:54,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812278042] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:54,589 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:54,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:54,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171478035] [2021-08-25 20:12:54,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:54,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:54,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:54,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:54,591 INFO L87 Difference]: Start difference. First operand 1514 states and 2230 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:54,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:54,712 INFO L93 Difference]: Finished difference Result 3032 states and 4463 transitions. [2021-08-25 20:12:54,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:54,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228 [2021-08-25 20:12:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:54,717 INFO L225 Difference]: With dead ends: 3032 [2021-08-25 20:12:54,717 INFO L226 Difference]: Without dead ends: 1514 [2021-08-25 20:12:54,719 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:54,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2021-08-25 20:12:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1502. [2021-08-25 20:12:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1501 states have (on average 1.4543637574950032) internal successors, (2183), 1501 states have internal predecessors, (2183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 2183 transitions. [2021-08-25 20:12:54,756 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 2183 transitions. Word has length 228 [2021-08-25 20:12:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:54,756 INFO L470 AbstractCegarLoop]: Abstraction has 1502 states and 2183 transitions. [2021-08-25 20:12:54,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:54,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2183 transitions. [2021-08-25 20:12:54,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2021-08-25 20:12:54,759 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:54,759 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:54,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-25 20:12:54,760 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:54,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:54,760 INFO L82 PathProgramCache]: Analyzing trace with hash -878488383, now seen corresponding path program 1 times [2021-08-25 20:12:54,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:54,760 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451678853] [2021-08-25 20:12:54,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:54,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2021-08-25 20:12:54,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:54,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451678853] [2021-08-25 20:12:54,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451678853] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:54,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:54,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:54,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267170423] [2021-08-25 20:12:54,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:54,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:54,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:54,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:54,799 INFO L87 Difference]: Start difference. First operand 1502 states and 2183 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:54,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:54,849 INFO L93 Difference]: Finished difference Result 3053 states and 4440 transitions. [2021-08-25 20:12:54,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:54,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2021-08-25 20:12:54,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:54,867 INFO L225 Difference]: With dead ends: 3053 [2021-08-25 20:12:54,867 INFO L226 Difference]: Without dead ends: 1559 [2021-08-25 20:12:54,870 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:54,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2021-08-25 20:12:54,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559. [2021-08-25 20:12:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1558 states have (on average 1.4550706033376124) internal successors, (2267), 1558 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:54,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2267 transitions. [2021-08-25 20:12:54,913 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2267 transitions. Word has length 264 [2021-08-25 20:12:54,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:54,914 INFO L470 AbstractCegarLoop]: Abstraction has 1559 states and 2267 transitions. [2021-08-25 20:12:54,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:54,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2267 transitions. [2021-08-25 20:12:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2021-08-25 20:12:54,917 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:54,917 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:54,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-25 20:12:54,917 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:54,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:54,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1480557055, now seen corresponding path program 1 times [2021-08-25 20:12:54,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:54,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092936747] [2021-08-25 20:12:54,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:54,918 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:54,946 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2021-08-25 20:12:54,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:54,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092936747] [2021-08-25 20:12:54,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092936747] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:54,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:54,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:54,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959409921] [2021-08-25 20:12:54,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:54,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:54,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:54,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:54,948 INFO L87 Difference]: Start difference. First operand 1559 states and 2267 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:54,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:54,994 INFO L93 Difference]: Finished difference Result 3143 states and 4570 transitions. [2021-08-25 20:12:54,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:54,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2021-08-25 20:12:54,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:54,998 INFO L225 Difference]: With dead ends: 3143 [2021-08-25 20:12:54,998 INFO L226 Difference]: Without dead ends: 1592 [2021-08-25 20:12:55,001 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:55,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2021-08-25 20:12:55,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1592. [2021-08-25 20:12:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1591 states have (on average 1.4544311753614079) internal successors, (2314), 1591 states have internal predecessors, (2314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2314 transitions. [2021-08-25 20:12:55,043 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2314 transitions. Word has length 264 [2021-08-25 20:12:55,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:55,043 INFO L470 AbstractCegarLoop]: Abstraction has 1592 states and 2314 transitions. [2021-08-25 20:12:55,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2314 transitions. [2021-08-25 20:12:55,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-08-25 20:12:55,047 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:55,047 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:55,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-25 20:12:55,047 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:55,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:55,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2143903306, now seen corresponding path program 1 times [2021-08-25 20:12:55,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:55,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289081804] [2021-08-25 20:12:55,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:55,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2021-08-25 20:12:55,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:55,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289081804] [2021-08-25 20:12:55,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289081804] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:55,088 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:55,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:55,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958018547] [2021-08-25 20:12:55,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:55,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:55,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:55,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:55,090 INFO L87 Difference]: Start difference. First operand 1592 states and 2314 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:55,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:55,160 INFO L93 Difference]: Finished difference Result 4613 states and 6704 transitions. [2021-08-25 20:12:55,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:55,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2021-08-25 20:12:55,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:55,165 INFO L225 Difference]: With dead ends: 4613 [2021-08-25 20:12:55,165 INFO L226 Difference]: Without dead ends: 3062 [2021-08-25 20:12:55,167 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:55,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2021-08-25 20:12:55,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3060. [2021-08-25 20:12:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 3059 states have (on average 1.4511278195488722) internal successors, (4439), 3059 states have internal predecessors, (4439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:55,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 4439 transitions. [2021-08-25 20:12:55,261 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 4439 transitions. Word has length 272 [2021-08-25 20:12:55,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:55,262 INFO L470 AbstractCegarLoop]: Abstraction has 3060 states and 4439 transitions. [2021-08-25 20:12:55,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 4439 transitions. [2021-08-25 20:12:55,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2021-08-25 20:12:55,267 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:55,268 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:55,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-25 20:12:55,268 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:55,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:55,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1820546620, now seen corresponding path program 1 times [2021-08-25 20:12:55,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:55,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452273076] [2021-08-25 20:12:55,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:55,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2021-08-25 20:12:55,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:55,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452273076] [2021-08-25 20:12:55,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452273076] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:55,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:55,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:55,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137494781] [2021-08-25 20:12:55,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:55,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:55,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:55,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:55,308 INFO L87 Difference]: Start difference. First operand 3060 states and 4439 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:55,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:55,455 INFO L93 Difference]: Finished difference Result 6292 states and 9154 transitions. [2021-08-25 20:12:55,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:55,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 309 [2021-08-25 20:12:55,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:55,459 INFO L225 Difference]: With dead ends: 6292 [2021-08-25 20:12:55,459 INFO L226 Difference]: Without dead ends: 2044 [2021-08-25 20:12:55,464 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:55,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2021-08-25 20:12:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2024. [2021-08-25 20:12:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 2023 states have (on average 1.426099851705388) internal successors, (2885), 2023 states have internal predecessors, (2885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2885 transitions. [2021-08-25 20:12:55,539 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2885 transitions. Word has length 309 [2021-08-25 20:12:55,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:55,539 INFO L470 AbstractCegarLoop]: Abstraction has 2024 states and 2885 transitions. [2021-08-25 20:12:55,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2885 transitions. [2021-08-25 20:12:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2021-08-25 20:12:55,544 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:55,545 INFO L512 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-08-25 20:12:55,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-25 20:12:55,545 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:55,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:55,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1751420932, now seen corresponding path program 1 times [2021-08-25 20:12:55,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:55,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895500391] [2021-08-25 20:12:55,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:55,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2021-08-25 20:12:55,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:55,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895500391] [2021-08-25 20:12:55,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895500391] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:12:55,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318824369] [2021-08-25 20:12:55,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:55,596 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:12:55,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:12:55,597 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:12:55,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-25 20:12:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:55,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:12:55,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:12:56,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2021-08-25 20:12:56,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318824369] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:56,817 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 20:12:56,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-25 20:12:56,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160121985] [2021-08-25 20:12:56,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:56,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:56,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:56,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:12:56,821 INFO L87 Difference]: Start difference. First operand 2024 states and 2885 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:56,913 INFO L93 Difference]: Finished difference Result 2978 states and 4244 transitions. [2021-08-25 20:12:56,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:56,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 376 [2021-08-25 20:12:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:56,920 INFO L225 Difference]: With dead ends: 2978 [2021-08-25 20:12:56,920 INFO L226 Difference]: Without dead ends: 2976 [2021-08-25 20:12:56,922 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:12:56,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2021-08-25 20:12:57,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 2976. [2021-08-25 20:12:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 2975 states have (on average 1.425546218487395) internal successors, (4241), 2975 states have internal predecessors, (4241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 4241 transitions. [2021-08-25 20:12:57,028 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 4241 transitions. Word has length 376 [2021-08-25 20:12:57,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:57,029 INFO L470 AbstractCegarLoop]: Abstraction has 2976 states and 4241 transitions. [2021-08-25 20:12:57,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:57,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 4241 transitions. [2021-08-25 20:12:57,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2021-08-25 20:12:57,040 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:57,040 INFO L512 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 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, 1] [2021-08-25 20:12:57,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-25 20:12:57,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-08-25 20:12:57,257 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:57,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:57,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1840493232, now seen corresponding path program 1 times [2021-08-25 20:12:57,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:57,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964163320] [2021-08-25 20:12:57,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:57,258 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:57,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2021-08-25 20:12:57,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:57,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964163320] [2021-08-25 20:12:57,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964163320] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:12:57,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972936894] [2021-08-25 20:12:57,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:57,335 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:12:57,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:12:57,349 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:12:57,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-25 20:12:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:57,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:12:57,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:12:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2021-08-25 20:12:59,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972936894] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:59,009 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 20:12:59,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-25 20:12:59,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935297287] [2021-08-25 20:12:59,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:59,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:59,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:59,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:12:59,011 INFO L87 Difference]: Start difference. First operand 2976 states and 4241 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:59,049 INFO L93 Difference]: Finished difference Result 3036 states and 4325 transitions. [2021-08-25 20:12:59,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:59,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 447 [2021-08-25 20:12:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:59,054 INFO L225 Difference]: With dead ends: 3036 [2021-08-25 20:12:59,054 INFO L226 Difference]: Without dead ends: 2148 [2021-08-25 20:12:59,056 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:12:59,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2021-08-25 20:12:59,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2090. [2021-08-25 20:12:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2090 states, 2089 states have (on average 1.4255624700813787) internal successors, (2978), 2089 states have internal predecessors, (2978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:59,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 2978 transitions. [2021-08-25 20:12:59,101 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 2978 transitions. Word has length 447 [2021-08-25 20:12:59,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:59,101 INFO L470 AbstractCegarLoop]: Abstraction has 2090 states and 2978 transitions. [2021-08-25 20:12:59,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:59,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2978 transitions. [2021-08-25 20:12:59,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2021-08-25 20:12:59,108 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:59,108 INFO L512 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 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] [2021-08-25 20:12:59,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-25 20:12:59,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-08-25 20:12:59,331 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:59,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:59,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1917394030, now seen corresponding path program 1 times [2021-08-25 20:12:59,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:59,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459449837] [2021-08-25 20:12:59,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:59,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:59,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2021-08-25 20:12:59,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:59,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459449837] [2021-08-25 20:12:59,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459449837] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:12:59,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304060634] [2021-08-25 20:12:59,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:59,391 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:12:59,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:12:59,393 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:12:59,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-25 20:12:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:59,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:12:59,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2021-08-25 20:13:00,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304060634] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:00,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:13:00,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:13:00,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884122906] [2021-08-25 20:13:00,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:13:00,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:00,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:13:00,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:13:00,901 INFO L87 Difference]: Start difference. First operand 2090 states and 2978 transitions. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:01,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:01,093 INFO L93 Difference]: Finished difference Result 4352 states and 6192 transitions. [2021-08-25 20:13:01,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:13:01,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 447 [2021-08-25 20:13:01,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:01,097 INFO L225 Difference]: With dead ends: 4352 [2021-08-25 20:13:01,097 INFO L226 Difference]: Without dead ends: 2226 [2021-08-25 20:13:01,100 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2021-08-25 20:13:01,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 1940. [2021-08-25 20:13:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1939 states have (on average 1.370809695719443) internal successors, (2658), 1939 states have internal predecessors, (2658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 2658 transitions. [2021-08-25 20:13:01,140 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 2658 transitions. Word has length 447 [2021-08-25 20:13:01,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:01,140 INFO L470 AbstractCegarLoop]: Abstraction has 1940 states and 2658 transitions. [2021-08-25 20:13:01,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 2658 transitions. [2021-08-25 20:13:01,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 849 [2021-08-25 20:13:01,155 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:01,156 INFO L512 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2021-08-25 20:13:01,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-08-25 20:13:01,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:01,383 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:01,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:01,383 INFO L82 PathProgramCache]: Analyzing trace with hash 949188204, now seen corresponding path program 1 times [2021-08-25 20:13:01,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:01,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988368592] [2021-08-25 20:13:01,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:01,384 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2021-08-25 20:13:01,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:01,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988368592] [2021-08-25 20:13:01,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988368592] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:01,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149987765] [2021-08-25 20:13:01,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:01,502 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:01,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:01,513 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:13:01,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-25 20:13:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:02,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:13:02,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2021-08-25 20:13:03,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149987765] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:03,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:13:03,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-08-25 20:13:03,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685290755] [2021-08-25 20:13:03,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:13:03,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:03,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:13:03,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:13:03,703 INFO L87 Difference]: Start difference. First operand 1940 states and 2658 transitions. Second operand has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:03,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:03,890 INFO L93 Difference]: Finished difference Result 4857 states and 6707 transitions. [2021-08-25 20:13:03,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:13:03,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 848 [2021-08-25 20:13:03,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:03,895 INFO L225 Difference]: With dead ends: 4857 [2021-08-25 20:13:03,895 INFO L226 Difference]: Without dead ends: 2816 [2021-08-25 20:13:03,897 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 848 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 15.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:13:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2021-08-25 20:13:03,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 1940. [2021-08-25 20:13:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1939 states have (on average 1.370809695719443) internal successors, (2658), 1939 states have internal predecessors, (2658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:03,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 2658 transitions. [2021-08-25 20:13:03,941 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 2658 transitions. Word has length 848 [2021-08-25 20:13:03,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:03,941 INFO L470 AbstractCegarLoop]: Abstraction has 1940 states and 2658 transitions. [2021-08-25 20:13:03,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:03,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 2658 transitions. [2021-08-25 20:13:03,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1030 [2021-08-25 20:13:03,950 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:03,951 INFO L512 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:03,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-25 20:13:04,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:04,172 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:04,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:04,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1657372254, now seen corresponding path program 1 times [2021-08-25 20:13:04,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:04,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893475331] [2021-08-25 20:13:04,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:04,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12523 backedges. 5859 proven. 0 refuted. 0 times theorem prover too weak. 6664 trivial. 0 not checked. [2021-08-25 20:13:04,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:04,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893475331] [2021-08-25 20:13:04,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893475331] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:04,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:04,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:04,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546523847] [2021-08-25 20:13:04,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:04,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:04,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:04,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:04,317 INFO L87 Difference]: Start difference. First operand 1940 states and 2658 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:04,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:04,447 INFO L93 Difference]: Finished difference Result 3880 states and 5309 transitions. [2021-08-25 20:13:04,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:04,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1029 [2021-08-25 20:13:04,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:04,450 INFO L225 Difference]: With dead ends: 3880 [2021-08-25 20:13:04,451 INFO L226 Difference]: Without dead ends: 1980 [2021-08-25 20:13:04,453 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:04,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2021-08-25 20:13:04,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1940. [2021-08-25 20:13:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1939 states have (on average 1.3630737493553378) internal successors, (2643), 1939 states have internal predecessors, (2643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 2643 transitions. [2021-08-25 20:13:04,498 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 2643 transitions. Word has length 1029 [2021-08-25 20:13:04,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:04,498 INFO L470 AbstractCegarLoop]: Abstraction has 1940 states and 2643 transitions. [2021-08-25 20:13:04,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:04,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 2643 transitions. [2021-08-25 20:13:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1045 [2021-08-25 20:13:04,507 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:04,507 INFO L512 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2021-08-25 20:13:04,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-25 20:13:04,508 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:04,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:04,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1685699859, now seen corresponding path program 1 times [2021-08-25 20:13:04,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:04,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203057031] [2021-08-25 20:13:04,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:04,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:04,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12731 backedges. 5768 proven. 0 refuted. 0 times theorem prover too weak. 6963 trivial. 0 not checked. [2021-08-25 20:13:04,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:04,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203057031] [2021-08-25 20:13:04,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203057031] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:04,623 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:04,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:04,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718365802] [2021-08-25 20:13:04,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:04,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:04,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:04,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:04,625 INFO L87 Difference]: Start difference. First operand 1940 states and 2643 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:04,725 INFO L93 Difference]: Finished difference Result 3840 states and 5231 transitions. [2021-08-25 20:13:04,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:04,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1044 [2021-08-25 20:13:04,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:04,728 INFO L225 Difference]: With dead ends: 3840 [2021-08-25 20:13:04,728 INFO L226 Difference]: Without dead ends: 1940 [2021-08-25 20:13:04,730 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:04,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2021-08-25 20:13:04,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1940. [2021-08-25 20:13:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1939 states have (on average 1.3434760185662713) internal successors, (2605), 1939 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 2605 transitions. [2021-08-25 20:13:04,767 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 2605 transitions. Word has length 1044 [2021-08-25 20:13:04,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:04,767 INFO L470 AbstractCegarLoop]: Abstraction has 1940 states and 2605 transitions. [2021-08-25 20:13:04,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:04,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 2605 transitions. [2021-08-25 20:13:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1073 [2021-08-25 20:13:04,803 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:04,803 INFO L512 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:04,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-25 20:13:04,803 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:04,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:04,804 INFO L82 PathProgramCache]: Analyzing trace with hash 612676444, now seen corresponding path program 1 times [2021-08-25 20:13:04,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:04,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899584131] [2021-08-25 20:13:04,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:04,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 13413 backedges. 6481 proven. 0 refuted. 0 times theorem prover too weak. 6932 trivial. 0 not checked. [2021-08-25 20:13:04,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:04,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899584131] [2021-08-25 20:13:04,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899584131] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:04,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:04,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:04,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557561530] [2021-08-25 20:13:04,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:04,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:04,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:04,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:04,942 INFO L87 Difference]: Start difference. First operand 1940 states and 2605 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:05,045 INFO L93 Difference]: Finished difference Result 3900 states and 5242 transitions. [2021-08-25 20:13:05,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:05,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1072 [2021-08-25 20:13:05,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:05,050 INFO L225 Difference]: With dead ends: 3900 [2021-08-25 20:13:05,050 INFO L226 Difference]: Without dead ends: 1982 [2021-08-25 20:13:05,052 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:05,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2021-08-25 20:13:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1982. [2021-08-25 20:13:05,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1981 states have (on average 1.3392226148409894) internal successors, (2653), 1981 states have internal predecessors, (2653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:05,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2653 transitions. [2021-08-25 20:13:05,102 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 2653 transitions. Word has length 1072 [2021-08-25 20:13:05,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:05,102 INFO L470 AbstractCegarLoop]: Abstraction has 1982 states and 2653 transitions. [2021-08-25 20:13:05,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:05,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2653 transitions. [2021-08-25 20:13:05,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1105 [2021-08-25 20:13:05,111 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:05,112 INFO L512 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 36, 36, 36, 36, 36, 36, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2021-08-25 20:13:05,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-25 20:13:05,113 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:05,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:05,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1476546868, now seen corresponding path program 1 times [2021-08-25 20:13:05,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:05,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146133749] [2021-08-25 20:13:05,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:05,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 13929 backedges. 6521 proven. 0 refuted. 0 times theorem prover too weak. 7408 trivial. 0 not checked. [2021-08-25 20:13:05,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:05,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146133749] [2021-08-25 20:13:05,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146133749] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:05,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:05,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:05,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044856480] [2021-08-25 20:13:05,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:05,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:05,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:05,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:05,254 INFO L87 Difference]: Start difference. First operand 1982 states and 2653 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:05,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:05,348 INFO L93 Difference]: Finished difference Result 2510 states and 3353 transitions. [2021-08-25 20:13:05,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:05,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1104 [2021-08-25 20:13:05,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:05,349 INFO L225 Difference]: With dead ends: 2510 [2021-08-25 20:13:05,349 INFO L226 Difference]: Without dead ends: 0 [2021-08-25 20:13:05,352 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:05,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-25 20:13:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-25 20:13:05,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-25 20:13:05,353 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1104 [2021-08-25 20:13:05,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:05,353 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-25 20:13:05,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-25 20:13:05,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-25 20:13:05,356 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:13:05,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-25 20:13:05,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-25 20:13:05,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,412 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,463 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,645 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,655 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,679 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,809 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,822 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,823 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,823 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,843 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,860 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:05,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:06,018 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:11,787 INFO L857 garLoopResultBuilder]: For program point L498(lines 498 500) no Hoare annotation was computed. [2021-08-25 20:13:11,787 INFO L857 garLoopResultBuilder]: For program point L498-2(lines 209 548) no Hoare annotation was computed. [2021-08-25 20:13:11,787 INFO L857 garLoopResultBuilder]: For program point L333(lines 333 364) no Hoare annotation was computed. [2021-08-25 20:13:11,788 INFO L857 garLoopResultBuilder]: For program point L400(lines 400 402) no Hoare annotation was computed. [2021-08-25 20:13:11,788 INFO L857 garLoopResultBuilder]: For program point L202(lines 202 552) no Hoare annotation was computed. [2021-08-25 20:13:11,788 INFO L857 garLoopResultBuilder]: For program point L169(lines 169 563) no Hoare annotation was computed. [2021-08-25 20:13:11,788 INFO L857 garLoopResultBuilder]: For program point L136(lines 136 574) no Hoare annotation was computed. [2021-08-25 20:13:11,788 INFO L857 garLoopResultBuilder]: For program point L103(lines 103 585) no Hoare annotation was computed. [2021-08-25 20:13:11,788 INFO L860 garLoopResultBuilder]: At program point L632(lines 623 634) the Hoare annotation is: true [2021-08-25 20:13:11,788 INFO L857 garLoopResultBuilder]: For program point L467(lines 467 469) no Hoare annotation was computed. [2021-08-25 20:13:11,788 INFO L857 garLoopResultBuilder]: For program point L236(lines 236 239) no Hoare annotation was computed. [2021-08-25 20:13:11,789 INFO L853 garLoopResultBuilder]: At program point L203(lines 199 553) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))))) [2021-08-25 20:13:11,789 INFO L853 garLoopResultBuilder]: At program point L104(lines 103 585) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) [2021-08-25 20:13:11,789 INFO L857 garLoopResultBuilder]: For program point L303(lines 303 310) no Hoare annotation was computed. [2021-08-25 20:13:11,789 INFO L857 garLoopResultBuilder]: For program point L303-2(lines 303 310) no Hoare annotation was computed. [2021-08-25 20:13:11,789 INFO L857 garLoopResultBuilder]: For program point L205(lines 205 551) no Hoare annotation was computed. [2021-08-25 20:13:11,790 INFO L857 garLoopResultBuilder]: For program point L172(lines 172 562) no Hoare annotation was computed. [2021-08-25 20:13:11,790 INFO L857 garLoopResultBuilder]: For program point L139(lines 139 573) no Hoare annotation was computed. [2021-08-25 20:13:11,790 INFO L857 garLoopResultBuilder]: For program point L106(lines 106 584) no Hoare annotation was computed. [2021-08-25 20:13:11,790 INFO L857 garLoopResultBuilder]: For program point L536(lines 536 542) no Hoare annotation was computed. [2021-08-25 20:13:11,790 INFO L857 garLoopResultBuilder]: For program point L536-1(lines 536 542) no Hoare annotation was computed. [2021-08-25 20:13:11,790 INFO L857 garLoopResultBuilder]: For program point L338(lines 338 362) no Hoare annotation was computed. [2021-08-25 20:13:11,790 INFO L853 garLoopResultBuilder]: At program point L206(lines 205 551) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-08-25 20:13:11,790 INFO L853 garLoopResultBuilder]: At program point L173(lines 169 563) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse11 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse12) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse12))) [2021-08-25 20:13:11,790 INFO L853 garLoopResultBuilder]: At program point L140(lines 136 574) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse11 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13) (and (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse13))) [2021-08-25 20:13:11,791 INFO L857 garLoopResultBuilder]: For program point L273(lines 273 275) no Hoare annotation was computed. [2021-08-25 20:13:11,791 INFO L857 garLoopResultBuilder]: For program point L273-2(lines 209 548) no Hoare annotation was computed. [2021-08-25 20:13:11,791 INFO L857 garLoopResultBuilder]: For program point L307(lines 307 309) no Hoare annotation was computed. [2021-08-25 20:13:11,791 INFO L857 garLoopResultBuilder]: For program point L241(lines 241 252) no Hoare annotation was computed. [2021-08-25 20:13:11,791 INFO L853 garLoopResultBuilder]: At program point L208(lines 207 551) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-08-25 20:13:11,791 INFO L857 garLoopResultBuilder]: For program point L175(lines 175 561) no Hoare annotation was computed. [2021-08-25 20:13:11,791 INFO L857 garLoopResultBuilder]: For program point L142(lines 142 572) no Hoare annotation was computed. [2021-08-25 20:13:11,791 INFO L857 garLoopResultBuilder]: For program point L109(lines 109 583) no Hoare annotation was computed. [2021-08-25 20:13:11,792 INFO L860 garLoopResultBuilder]: At program point L605(lines 99 606) the Hoare annotation is: true [2021-08-25 20:13:11,792 INFO L857 garLoopResultBuilder]: For program point L539(lines 539 541) no Hoare annotation was computed. [2021-08-25 20:13:11,792 INFO L857 garLoopResultBuilder]: For program point L507(lines 507 510) no Hoare annotation was computed. [2021-08-25 20:13:11,792 INFO L857 garLoopResultBuilder]: For program point L441(lines 441 443) no Hoare annotation was computed. [2021-08-25 20:13:11,792 INFO L857 garLoopResultBuilder]: For program point L342(lines 342 346) no Hoare annotation was computed. [2021-08-25 20:13:11,792 INFO L857 garLoopResultBuilder]: For program point L342-2(lines 342 346) no Hoare annotation was computed. [2021-08-25 20:13:11,792 INFO L857 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2021-08-25 20:13:11,792 INFO L857 garLoopResultBuilder]: For program point L376(lines 376 408) no Hoare annotation was computed. [2021-08-25 20:13:11,793 INFO L857 garLoopResultBuilder]: For program point L178(lines 178 560) no Hoare annotation was computed. [2021-08-25 20:13:11,793 INFO L857 garLoopResultBuilder]: For program point L145(lines 145 571) no Hoare annotation was computed. [2021-08-25 20:13:11,793 INFO L857 garLoopResultBuilder]: For program point L112(lines 112 582) no Hoare annotation was computed. [2021-08-25 20:13:11,793 INFO L857 garLoopResultBuilder]: For program point L476(lines 476 478) no Hoare annotation was computed. [2021-08-25 20:13:11,793 INFO L857 garLoopResultBuilder]: For program point L476-2(lines 209 548) no Hoare annotation was computed. [2021-08-25 20:13:11,793 INFO L857 garLoopResultBuilder]: For program point L377(lines 377 383) no Hoare annotation was computed. [2021-08-25 20:13:11,793 INFO L853 garLoopResultBuilder]: At program point L212(lines 106 584) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (and (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) [2021-08-25 20:13:11,794 INFO L853 garLoopResultBuilder]: At program point L179(lines 175 561) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse12 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse18 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse17 .cse18 .cse19 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse20 .cse21))) [2021-08-25 20:13:11,794 INFO L853 garLoopResultBuilder]: At program point L146(lines 142 572) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse11 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2021-08-25 20:13:11,794 INFO L857 garLoopResultBuilder]: For program point L444(lines 444 453) no Hoare annotation was computed. [2021-08-25 20:13:11,794 INFO L857 garLoopResultBuilder]: For program point L610(lines 610 612) no Hoare annotation was computed. [2021-08-25 20:13:11,794 INFO L857 garLoopResultBuilder]: For program point L610-2(lines 610 612) no Hoare annotation was computed. [2021-08-25 20:13:11,794 INFO L857 garLoopResultBuilder]: For program point L181(lines 181 559) no Hoare annotation was computed. [2021-08-25 20:13:11,794 INFO L857 garLoopResultBuilder]: For program point L148(lines 148 570) no Hoare annotation was computed. [2021-08-25 20:13:11,795 INFO L857 garLoopResultBuilder]: For program point L115(lines 115 581) no Hoare annotation was computed. [2021-08-25 20:13:11,795 INFO L857 garLoopResultBuilder]: For program point L83(lines 83 89) no Hoare annotation was computed. [2021-08-25 20:13:11,795 INFO L860 garLoopResultBuilder]: At program point L613(lines 13 617) the Hoare annotation is: true [2021-08-25 20:13:11,795 INFO L857 garLoopResultBuilder]: For program point L448(lines 448 450) no Hoare annotation was computed. [2021-08-25 20:13:11,795 INFO L857 garLoopResultBuilder]: For program point L217(lines 217 219) no Hoare annotation was computed. [2021-08-25 20:13:11,795 INFO L857 garLoopResultBuilder]: For program point L184(lines 184 558) no Hoare annotation was computed. [2021-08-25 20:13:11,795 INFO L857 garLoopResultBuilder]: For program point L151(lines 151 569) no Hoare annotation was computed. [2021-08-25 20:13:11,796 INFO L857 garLoopResultBuilder]: For program point L217-2(lines 217 219) no Hoare annotation was computed. [2021-08-25 20:13:11,796 INFO L857 garLoopResultBuilder]: For program point L118(lines 118 580) no Hoare annotation was computed. [2021-08-25 20:13:11,796 INFO L857 garLoopResultBuilder]: For program point L515(lines 515 521) no Hoare annotation was computed. [2021-08-25 20:13:11,796 INFO L857 garLoopResultBuilder]: For program point L482(lines 482 486) no Hoare annotation was computed. [2021-08-25 20:13:11,796 INFO L857 garLoopResultBuilder]: For program point L482-2(lines 482 486) no Hoare annotation was computed. [2021-08-25 20:13:11,796 INFO L857 garLoopResultBuilder]: For program point L350(lines 350 358) no Hoare annotation was computed. [2021-08-25 20:13:11,796 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-25 20:13:11,797 INFO L853 garLoopResultBuilder]: At program point L185(lines 181 559) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse12 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse18 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse17 .cse18 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse19 .cse20 .cse21))) [2021-08-25 20:13:11,797 INFO L853 garLoopResultBuilder]: At program point L152(lines 148 570) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse11) (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse11))) [2021-08-25 20:13:11,797 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 88) no Hoare annotation was computed. [2021-08-25 20:13:11,797 INFO L857 garLoopResultBuilder]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2021-08-25 20:13:11,797 INFO L853 garLoopResultBuilder]: At program point L549(lines 100 604) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse4 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse13 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse14 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2) (and (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (and .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse9 .cse10 .cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse13 .cse14 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 .cse13 .cse14) (and (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3))) [2021-08-25 20:13:11,798 INFO L853 garLoopResultBuilder]: At program point L351(lines 326 369) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse11) (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse11))) [2021-08-25 20:13:11,798 INFO L857 garLoopResultBuilder]: For program point L418(lines 418 420) no Hoare annotation was computed. [2021-08-25 20:13:11,798 INFO L853 garLoopResultBuilder]: At program point L385(lines 376 408) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse11) (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse11))) [2021-08-25 20:13:11,798 INFO L857 garLoopResultBuilder]: For program point L286(lines 286 288) no Hoare annotation was computed. [2021-08-25 20:13:11,798 INFO L857 garLoopResultBuilder]: For program point L286-2(lines 209 548) no Hoare annotation was computed. [2021-08-25 20:13:11,798 INFO L857 garLoopResultBuilder]: For program point L187(lines 187 557) no Hoare annotation was computed. [2021-08-25 20:13:11,798 INFO L857 garLoopResultBuilder]: For program point L154(lines 154 568) no Hoare annotation was computed. [2021-08-25 20:13:11,798 INFO L857 garLoopResultBuilder]: For program point L121(lines 121 579) no Hoare annotation was computed. [2021-08-25 20:13:11,799 INFO L857 garLoopResultBuilder]: For program point L518(lines 518 520) no Hoare annotation was computed. [2021-08-25 20:13:11,799 INFO L853 garLoopResultBuilder]: At program point L518-1(lines 209 548) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))))) [2021-08-25 20:13:11,799 INFO L857 garLoopResultBuilder]: For program point L353(lines 353 355) no Hoare annotation was computed. [2021-08-25 20:13:11,799 INFO L857 garLoopResultBuilder]: For program point L320(lines 320 324) no Hoare annotation was computed. [2021-08-25 20:13:11,799 INFO L857 garLoopResultBuilder]: For program point L320-2(lines 209 548) no Hoare annotation was computed. [2021-08-25 20:13:11,799 INFO L853 garLoopResultBuilder]: At program point L122(lines 118 580) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse11) (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse11))) [2021-08-25 20:13:11,799 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-08-25 20:13:11,800 INFO L857 garLoopResultBuilder]: For program point L586(lines 586 602) no Hoare annotation was computed. [2021-08-25 20:13:11,800 INFO L857 garLoopResultBuilder]: For program point L388(lines 388 406) no Hoare annotation was computed. [2021-08-25 20:13:11,800 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-25 20:13:11,800 INFO L857 garLoopResultBuilder]: For program point L190(lines 190 556) no Hoare annotation was computed. [2021-08-25 20:13:11,800 INFO L857 garLoopResultBuilder]: For program point L157(lines 157 567) no Hoare annotation was computed. [2021-08-25 20:13:11,800 INFO L857 garLoopResultBuilder]: For program point L124(lines 124 578) no Hoare annotation was computed. [2021-08-25 20:13:11,800 INFO L857 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2021-08-25 20:13:11,800 INFO L857 garLoopResultBuilder]: For program point L91-1(lines 74 616) no Hoare annotation was computed. [2021-08-25 20:13:11,801 INFO L857 garLoopResultBuilder]: For program point L620(line 620) no Hoare annotation was computed. [2021-08-25 20:13:11,801 INFO L857 garLoopResultBuilder]: For program point L587(lines 587 601) no Hoare annotation was computed. [2021-08-25 20:13:11,801 INFO L857 garLoopResultBuilder]: For program point L389(lines 389 395) no Hoare annotation was computed. [2021-08-25 20:13:11,801 INFO L853 garLoopResultBuilder]: At program point L191(lines 187 557) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse12 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse18 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse20 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse17 .cse18 .cse19 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse20 .cse21) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2021-08-25 20:13:11,801 INFO L853 garLoopResultBuilder]: At program point L158(lines 154 568) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse11) (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse11))) [2021-08-25 20:13:11,801 INFO L853 garLoopResultBuilder]: At program point L125(lines 124 578) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) [2021-08-25 20:13:11,801 INFO L857 garLoopResultBuilder]: For program point L92(lines 92 94) no Hoare annotation was computed. [2021-08-25 20:13:11,802 INFO L857 garLoopResultBuilder]: For program point L588(lines 588 593) no Hoare annotation was computed. [2021-08-25 20:13:11,802 INFO L857 garLoopResultBuilder]: For program point L588-2(lines 587 601) no Hoare annotation was computed. [2021-08-25 20:13:11,802 INFO L857 garLoopResultBuilder]: For program point L258(lines 258 260) no Hoare annotation was computed. [2021-08-25 20:13:11,802 INFO L857 garLoopResultBuilder]: For program point L292(lines 292 296) no Hoare annotation was computed. [2021-08-25 20:13:11,802 INFO L857 garLoopResultBuilder]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2021-08-25 20:13:11,802 INFO L857 garLoopResultBuilder]: For program point L193(lines 193 555) no Hoare annotation was computed. [2021-08-25 20:13:11,802 INFO L857 garLoopResultBuilder]: For program point L160(lines 160 566) no Hoare annotation was computed. [2021-08-25 20:13:11,802 INFO L857 garLoopResultBuilder]: For program point L127(lines 127 577) no Hoare annotation was computed. [2021-08-25 20:13:11,803 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-25 20:13:11,803 INFO L857 garLoopResultBuilder]: For program point L590(lines 590 592) no Hoare annotation was computed. [2021-08-25 20:13:11,803 INFO L857 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2021-08-25 20:13:11,803 INFO L857 garLoopResultBuilder]: For program point L227(lines 227 234) no Hoare annotation was computed. [2021-08-25 20:13:11,803 INFO L857 garLoopResultBuilder]: For program point L227-2(lines 227 234) no Hoare annotation was computed. [2021-08-25 20:13:11,803 INFO L857 garLoopResultBuilder]: For program point L526(lines 526 530) no Hoare annotation was computed. [2021-08-25 20:13:11,804 INFO L857 garLoopResultBuilder]: For program point L493(lines 493 496) no Hoare annotation was computed. [2021-08-25 20:13:11,804 INFO L857 garLoopResultBuilder]: For program point L526-2(lines 526 530) no Hoare annotation was computed. [2021-08-25 20:13:11,804 INFO L857 garLoopResultBuilder]: For program point L427(lines 427 435) no Hoare annotation was computed. [2021-08-25 20:13:11,804 INFO L857 garLoopResultBuilder]: For program point L427-2(lines 427 435) no Hoare annotation was computed. [2021-08-25 20:13:11,804 INFO L857 garLoopResultBuilder]: For program point L229(lines 229 232) no Hoare annotation was computed. [2021-08-25 20:13:11,804 INFO L857 garLoopResultBuilder]: For program point L196(lines 196 554) no Hoare annotation was computed. [2021-08-25 20:13:11,804 INFO L857 garLoopResultBuilder]: For program point L163(lines 163 565) no Hoare annotation was computed. [2021-08-25 20:13:11,804 INFO L857 garLoopResultBuilder]: For program point L130(lines 130 576) no Hoare annotation was computed. [2021-08-25 20:13:11,805 INFO L857 garLoopResultBuilder]: For program point L329(lines 329 368) no Hoare annotation was computed. [2021-08-25 20:13:11,805 INFO L853 garLoopResultBuilder]: At program point L197(lines 193 555) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse13 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse16 .cse17 .cse18 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse14 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2021-08-25 20:13:11,805 INFO L853 garLoopResultBuilder]: At program point L164(lines 160 566) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse11) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse11))) [2021-08-25 20:13:11,806 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-25 20:13:11,806 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 620) no Hoare annotation was computed. [2021-08-25 20:13:11,806 INFO L857 garLoopResultBuilder]: For program point L595(lines 595 599) no Hoare annotation was computed. [2021-08-25 20:13:11,806 INFO L857 garLoopResultBuilder]: For program point L430(lines 430 433) no Hoare annotation was computed. [2021-08-25 20:13:11,806 INFO L853 garLoopResultBuilder]: At program point L397(lines 388 406) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse11) (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse11))) [2021-08-25 20:13:11,806 INFO L857 garLoopResultBuilder]: For program point L199(lines 199 553) no Hoare annotation was computed. [2021-08-25 20:13:11,806 INFO L857 garLoopResultBuilder]: For program point L166(lines 166 564) no Hoare annotation was computed. [2021-08-25 20:13:11,806 INFO L857 garLoopResultBuilder]: For program point L133(lines 133 575) no Hoare annotation was computed. [2021-08-25 20:13:11,807 INFO L853 garLoopResultBuilder]: At program point L100-2(lines 100 604) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse12 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse15 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse16 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse2 .cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse17) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse18 .cse15 .cse16) (and (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 .cse16 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3))) [2021-08-25 20:13:11,807 INFO L857 garLoopResultBuilder]: For program point L332(lines 332 367) no Hoare annotation was computed. [2021-08-25 20:13:11,807 INFO L857 garLoopResultBuilder]: For program point L332-1(lines 332 367) no Hoare annotation was computed. [2021-08-25 20:13:11,807 INFO L853 garLoopResultBuilder]: At program point L167(lines 166 564) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse6 .cse7 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not .cse8) .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse13))) [2021-08-25 20:13:11,807 INFO L853 garLoopResultBuilder]: At program point L134(lines 127 577) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse14 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse13 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse15) (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse11 .cse12 .cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse15))) [2021-08-25 20:13:11,808 INFO L857 garLoopResultBuilder]: For program point L101(line 101) no Hoare annotation was computed. [2021-08-25 20:13:11,811 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:13:11,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:13:11 BoogieIcfgContainer [2021-08-25 20:13:11,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:13:11,859 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:13:11,860 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:13:11,860 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:13:11,860 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:12:48" (3/4) ... [2021-08-25 20:13:11,863 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-25 20:13:11,883 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-08-25 20:13:11,884 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-25 20:13:11,884 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:13:11,885 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:13:11,979 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:13:11,980 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:13:11,986 INFO L168 Benchmark]: Toolchain (without parser) took 24397.45 ms. Allocated memory was 56.6 MB in the beginning and 572.5 MB in the end (delta: 515.9 MB). Free memory was 35.0 MB in the beginning and 224.4 MB in the end (delta: -189.5 MB). Peak memory consumption was 326.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:11,987 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 56.6 MB. Free memory was 38.5 MB in the beginning and 38.5 MB in the end (delta: 43.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:13:11,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.99 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 34.7 MB in the beginning and 49.5 MB in the end (delta: -14.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:11,987 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.53 ms. Allocated memory is still 69.2 MB. Free memory was 49.5 MB in the beginning and 46.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:11,988 INFO L168 Benchmark]: Boogie Preprocessor took 37.36 ms. Allocated memory is still 69.2 MB. Free memory was 46.6 MB in the beginning and 44.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:11,988 INFO L168 Benchmark]: RCFGBuilder took 681.61 ms. Allocated memory is still 69.2 MB. Free memory was 44.5 MB in the beginning and 42.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 17.8 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:11,988 INFO L168 Benchmark]: TraceAbstraction took 23148.37 ms. Allocated memory was 69.2 MB in the beginning and 572.5 MB in the end (delta: 503.3 MB). Free memory was 41.6 MB in the beginning and 238.0 MB in the end (delta: -196.4 MB). Peak memory consumption was 352.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:11,989 INFO L168 Benchmark]: Witness Printer took 120.44 ms. Allocated memory is still 572.5 MB. Free memory was 238.0 MB in the beginning and 224.4 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:11,991 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.10 ms. Allocated memory is still 56.6 MB. Free memory was 38.5 MB in the beginning and 38.5 MB in the end (delta: 43.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 347.99 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 34.7 MB in the beginning and 49.5 MB in the end (delta: -14.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 56.53 ms. Allocated memory is still 69.2 MB. Free memory was 49.5 MB in the beginning and 46.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.36 ms. Allocated memory is still 69.2 MB. Free memory was 46.6 MB in the beginning and 44.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 681.61 ms. Allocated memory is still 69.2 MB. Free memory was 44.5 MB in the beginning and 42.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 17.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 23148.37 ms. Allocated memory was 69.2 MB in the beginning and 572.5 MB in the end (delta: 503.3 MB). Free memory was 41.6 MB in the beginning and 238.0 MB in the end (delta: -196.4 MB). Peak memory consumption was 352.9 MB. Max. memory is 16.1 GB. * Witness Printer took 120.44 ms. Allocated memory is still 572.5 MB. Free memory was 238.0 MB in the beginning and 224.4 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 620]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23065.7ms, OverallIterations: 40, TraceHistogramMax: 38, EmptinessCheckTime: 174.3ms, AutomataDifference: 5227.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 6430.2ms, InitialAbstractionConstructionTime: 8.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6590 SDtfs, 5297 SDslu, 2568 SDs, 0 SdLazy, 3479 SolverSat, 1343 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2664.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2242 GetRequests, 2192 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 103.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3060occurred in iteration=31, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1329.3ms AutomataMinimizationTime, 40 MinimizatonAttempts, 1508 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 225 NumberOfFragments, 4012 HoareAnnotationTreeSize, 28 FomulaSimplifications, 36171 FormulaSimplificationTreeSizeReduction, 655.8ms HoareSimplificationTime, 28 FomulaSimplificationsInter, 7070 FormulaSimplificationTreeSizeReductionInter, 5758.1ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 240.9ms SsaConstructionTime, 786.5ms SatisfiabilityAnalysisTime, 6409.3ms InterpolantComputationTime, 13306 NumberOfCodeBlocks, 13306 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 13262 ConstructedInterpolants, 0 QuantifiedInterpolants, 17743 SizeOfPredicates, 2 NumberOfNonLiveVariables, 3361 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 44 InterpolantComputations, 38 PerfectInterpolantSequences, 86997/87153 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) && !(s__state == 8512)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) || ((2 == blastFlag && !(8448 == s__state)) && s__state <= 8448) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && s__state <= 8672) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && 8448 <= s__state) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(8560 == s__state)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && s__state <= 8672) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && 8448 <= s__state) && !(8593 == s__state)) && !(s__state == 8512)) || ((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8512)) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && 8448 <= s__state) && !(s__state == 8512)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 3 && !(s__hit == 0)) || (((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || (((((((!(8577 == s__state) && s__state <= 8672) && !(s__state == 8657)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641))) || (((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(s__state == 8512))) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state)) || (((3 == s__s3__tmp__next_state___0 && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || s__state <= 3 - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && 8448 <= s__state) && !(s__state == 8512)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: (((((((((((((((!(8497 == s__state) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && 8448 <= s__state) && !(s__state == 8512)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && 8448 <= s__state) && !(s__state == 8512)) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && 8448 <= s__state) && !(s__state == 8512)) || ((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && 8448 <= s__state) && !(s__state == 8512))) || ((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(s__state == 8512))) || (((((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && 3 == s__s3__tmp__next_state___0) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(s__state == 8512)) || (((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && 8448 <= s__state) && s__state <= 8448)) || ((((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((((((((((((((!(s__state == 8480) && s__state <= 8576) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && 8448 <= s__state) && !(s__state == 8512)) || (((((((((((((((((((((((((!(8577 == s__state) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512))) || ((((((((((((((!(s__state == 8480) && s__state <= 8576) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(s__state == 8512)) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) || ((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && 8448 <= s__state) && !(s__state == 8512)) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8641)) && !(s__state == 8512)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && s__state <= 8672) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && 8448 <= s__state) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && 8448 <= s__state) && !(s__state == 8512)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 623]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) || (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && s__state <= 8672) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && 8448 <= s__state) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) && !(s__state == 8512)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) || (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((((((blastFlag <= 3 && !(s__hit == 0)) || (((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || ((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && 8448 <= s__state) && !(s__state == 8512))) || (((((((!(8577 == s__state) && s__state <= 8672) && !(s__state == 8657)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641))) || (((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(s__state == 8512))) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state)) || (((3 == s__s3__tmp__next_state___0 && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || s__state <= 3 - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) RESULT: Ultimate proved your program to be correct! [2021-08-25 20:13:12,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...