./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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_3.cil.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 5f4304a957668929d4c4ca97a168406535fe955ba86c164574a4a7768919c53b --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 11:44:19,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 11:44:19,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 11:44:19,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 11:44:19,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 11:44:19,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 11:44:19,184 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 11:44:19,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 11:44:19,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 11:44:19,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 11:44:19,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 11:44:19,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 11:44:19,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 11:44:19,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 11:44:19,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 11:44:19,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 11:44:19,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 11:44:19,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 11:44:19,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 11:44:19,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 11:44:19,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 11:44:19,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 11:44:19,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 11:44:19,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 11:44:19,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 11:44:19,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 11:44:19,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 11:44:19,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 11:44:19,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 11:44:19,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 11:44:19,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 11:44:19,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 11:44:19,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 11:44:19,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 11:44:19,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 11:44:19,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 11:44:19,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 11:44:19,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 11:44:19,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 11:44:19,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 11:44:19,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 11:44:19,219 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 11:44:19,245 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 11:44:19,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 11:44:19,246 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 11:44:19,246 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 11:44:19,247 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 11:44:19,247 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 11:44:19,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 11:44:19,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 11:44:19,248 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 11:44:19,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 11:44:19,249 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 11:44:19,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 11:44:19,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 11:44:19,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 11:44:19,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 11:44:19,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 11:44:19,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 11:44:19,250 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 11:44:19,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 11:44:19,250 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 11:44:19,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 11:44:19,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 11:44:19,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 11:44:19,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 11:44:19,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:44:19,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 11:44:19,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 11:44:19,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 11:44:19,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 11:44:19,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 11:44:19,252 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 11:44:19,252 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 11:44:19,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 11:44:19,252 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 11:44:19,252 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 -> 5f4304a957668929d4c4ca97a168406535fe955ba86c164574a4a7768919c53b [2021-12-14 11:44:19,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 11:44:19,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 11:44:19,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 11:44:19,456 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 11:44:19,457 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 11:44:19,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_3.cil.c [2021-12-14 11:44:19,513 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ff2e26d/608c3049e6b04535a61c5df5c8d42994/FLAG4d017a2e8 [2021-12-14 11:44:19,878 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 11:44:19,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_3.cil.c [2021-12-14 11:44:19,888 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ff2e26d/608c3049e6b04535a61c5df5c8d42994/FLAG4d017a2e8 [2021-12-14 11:44:19,898 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ff2e26d/608c3049e6b04535a61c5df5c8d42994 [2021-12-14 11:44:19,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 11:44:19,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 11:44:19,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 11:44:19,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 11:44:19,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 11:44:19,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:44:19" (1/1) ... [2021-12-14 11:44:19,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a09df58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:19, skipping insertion in model container [2021-12-14 11:44:19,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:44:19" (1/1) ... [2021-12-14 11:44:19,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 11:44:19,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 11:44:20,090 WARN L230 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_3.cil.c[42783,42796] [2021-12-14 11:44:20,095 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:44:20,100 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 11:44:20,163 WARN L230 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_3.cil.c[42783,42796] [2021-12-14 11:44:20,165 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:44:20,180 INFO L208 MainTranslator]: Completed translation [2021-12-14 11:44:20,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20 WrapperNode [2021-12-14 11:44:20,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 11:44:20,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 11:44:20,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 11:44:20,182 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 11:44:20,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,218 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 546 [2021-12-14 11:44:20,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 11:44:20,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 11:44:20,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 11:44:20,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 11:44:20,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 11:44:20,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 11:44:20,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 11:44:20,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 11:44:20,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:44:20,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:44:20,291 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-12-14 11:44:20,297 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-12-14 11:44:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 11:44:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 11:44:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 11:44:20,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 11:44:20,372 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 11:44:20,373 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 11:44:20,383 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:44:20,688 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-12-14 11:44:20,688 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-12-14 11:44:20,688 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 11:44:20,693 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 11:44:20,693 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 11:44:20,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:44:20 BoogieIcfgContainer [2021-12-14 11:44:20,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 11:44:20,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 11:44:20,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 11:44:20,699 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 11:44:20,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:44:19" (1/3) ... [2021-12-14 11:44:20,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7b80c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:44:20, skipping insertion in model container [2021-12-14 11:44:20,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (2/3) ... [2021-12-14 11:44:20,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7b80c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:44:20, skipping insertion in model container [2021-12-14 11:44:20,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:44:20" (3/3) ... [2021-12-14 11:44:20,701 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c [2021-12-14 11:44:20,704 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 11:44:20,704 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 11:44:20,736 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 11:44:20,749 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, mAutomataTypeConcurrency=PETRI_NET, 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-12-14 11:44:20,750 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 11:44:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 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-12-14 11:44:20,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-14 11:44:20,778 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:20,779 INFO L514 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] [2021-12-14 11:44:20,779 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:20,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:20,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1632006987, now seen corresponding path program 1 times [2021-12-14 11:44:20,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:20,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969198482] [2021-12-14 11:44:20,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:20,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:44:21,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:21,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969198482] [2021-12-14 11:44:21,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969198482] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:21,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:21,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:21,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72720256] [2021-12-14 11:44:21,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:21,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:21,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:21,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:21,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:21,062 INFO L87 Difference]: Start difference. First operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 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 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-12-14 11:44:21,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:21,279 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2021-12-14 11:44:21,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:21,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2021-12-14 11:44:21,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:21,288 INFO L225 Difference]: With dead ends: 328 [2021-12-14 11:44:21,290 INFO L226 Difference]: Without dead ends: 175 [2021-12-14 11:44:21,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:21,297 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 170 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:21,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 190 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:44:21,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-14 11:44:21,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2021-12-14 11:44:21,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.6272189349112427) internal successors, (275), 169 states have internal predecessors, (275), 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-12-14 11:44:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 275 transitions. [2021-12-14 11:44:21,355 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 275 transitions. Word has length 44 [2021-12-14 11:44:21,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:21,356 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 275 transitions. [2021-12-14 11:44:21,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-12-14 11:44:21,356 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 275 transitions. [2021-12-14 11:44:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 11:44:21,361 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:21,361 INFO L514 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-12-14 11:44:21,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 11:44:21,361 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:21,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:21,365 INFO L85 PathProgramCache]: Analyzing trace with hash -954575443, now seen corresponding path program 1 times [2021-12-14 11:44:21,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:21,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719979777] [2021-12-14 11:44:21,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:21,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:44:21,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:21,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719979777] [2021-12-14 11:44:21,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719979777] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:21,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:21,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:21,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016496258] [2021-12-14 11:44:21,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:21,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:21,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:21,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:21,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:21,414 INFO L87 Difference]: Start difference. First operand 170 states and 275 transitions. 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-12-14 11:44:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:21,557 INFO L93 Difference]: Finished difference Result 380 states and 624 transitions. [2021-12-14 11:44:21,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:21,558 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-12-14 11:44:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:21,562 INFO L225 Difference]: With dead ends: 380 [2021-12-14 11:44:21,563 INFO L226 Difference]: Without dead ends: 216 [2021-12-14 11:44:21,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:21,567 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 129 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:21,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 142 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:21,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-14 11:44:21,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2021-12-14 11:44:21,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.6761904761904762) internal successors, (352), 210 states have internal predecessors, (352), 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-12-14 11:44:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2021-12-14 11:44:21,578 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 45 [2021-12-14 11:44:21,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:21,578 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2021-12-14 11:44:21,578 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-12-14 11:44:21,579 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2021-12-14 11:44:21,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-14 11:44:21,580 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:21,580 INFO L514 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] [2021-12-14 11:44:21,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 11:44:21,581 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:21,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:21,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1216100442, now seen corresponding path program 1 times [2021-12-14 11:44:21,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:21,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867008228] [2021-12-14 11:44:21,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:21,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:44:21,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:21,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867008228] [2021-12-14 11:44:21,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867008228] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:21,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:21,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:21,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947117596] [2021-12-14 11:44:21,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:21,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:21,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:21,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:21,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:21,623 INFO L87 Difference]: Start difference. First operand 211 states and 352 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-12-14 11:44:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:21,728 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2021-12-14 11:44:21,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:21,728 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 72 [2021-12-14 11:44:21,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:21,729 INFO L225 Difference]: With dead ends: 445 [2021-12-14 11:44:21,729 INFO L226 Difference]: Without dead ends: 242 [2021-12-14 11:44:21,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:21,731 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 136 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:21,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 155 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:21,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-12-14 11:44:21,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-12-14 11:44:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.6929460580912863) internal successors, (408), 241 states have internal predecessors, (408), 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-12-14 11:44:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2021-12-14 11:44:21,741 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 72 [2021-12-14 11:44:21,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:21,741 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2021-12-14 11:44:21,742 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-12-14 11:44:21,742 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2021-12-14 11:44:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-14 11:44:21,744 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:21,744 INFO L514 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] [2021-12-14 11:44:21,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 11:44:21,744 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:21,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:21,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2076235292, now seen corresponding path program 1 times [2021-12-14 11:44:21,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:21,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109233100] [2021-12-14 11:44:21,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:21,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-14 11:44:21,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:21,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109233100] [2021-12-14 11:44:21,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109233100] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:21,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:21,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:21,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79680920] [2021-12-14 11:44:21,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:21,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:21,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:21,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:21,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:21,820 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-12-14 11:44:21,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:21,903 INFO L93 Difference]: Finished difference Result 493 states and 832 transitions. [2021-12-14 11:44:21,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:21,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 84 [2021-12-14 11:44:21,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:21,905 INFO L225 Difference]: With dead ends: 493 [2021-12-14 11:44:21,905 INFO L226 Difference]: Without dead ends: 259 [2021-12-14 11:44:21,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:21,906 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 158 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:21,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 150 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:21,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-12-14 11:44:21,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2021-12-14 11:44:21,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.68359375) internal successors, (431), 256 states have internal predecessors, (431), 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-12-14 11:44:21,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2021-12-14 11:44:21,914 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 84 [2021-12-14 11:44:21,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:21,915 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2021-12-14 11:44:21,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-12-14 11:44:21,915 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2021-12-14 11:44:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-14 11:44:21,917 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:21,917 INFO L514 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] [2021-12-14 11:44:21,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 11:44:21,918 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:21,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:21,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1320798359, now seen corresponding path program 1 times [2021-12-14 11:44:21,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:21,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563351493] [2021-12-14 11:44:21,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:21,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:44:21,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:21,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563351493] [2021-12-14 11:44:21,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563351493] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:21,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:21,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:21,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963124249] [2021-12-14 11:44:21,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:21,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:21,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:21,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:21,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:21,953 INFO L87 Difference]: Start difference. First operand 257 states and 431 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-12-14 11:44:22,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:22,059 INFO L93 Difference]: Finished difference Result 552 states and 931 transitions. [2021-12-14 11:44:22,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:22,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 84 [2021-12-14 11:44:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:22,061 INFO L225 Difference]: With dead ends: 552 [2021-12-14 11:44:22,061 INFO L226 Difference]: Without dead ends: 303 [2021-12-14 11:44:22,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,062 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 133 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:22,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 144 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-12-14 11:44:22,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2021-12-14 11:44:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6946308724832215) internal successors, (505), 298 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-12-14 11:44:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 505 transitions. [2021-12-14 11:44:22,070 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 505 transitions. Word has length 84 [2021-12-14 11:44:22,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:22,070 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 505 transitions. [2021-12-14 11:44:22,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-12-14 11:44:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 505 transitions. [2021-12-14 11:44:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-14 11:44:22,072 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:22,072 INFO L514 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] [2021-12-14 11:44:22,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 11:44:22,073 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:22,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:22,073 INFO L85 PathProgramCache]: Analyzing trace with hash 858126211, now seen corresponding path program 1 times [2021-12-14 11:44:22,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:22,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752931834] [2021-12-14 11:44:22,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:22,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-14 11:44:22,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:22,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752931834] [2021-12-14 11:44:22,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752931834] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:22,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:22,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:22,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530783672] [2021-12-14 11:44:22,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:22,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:22,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:22,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:22,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,103 INFO L87 Difference]: Start difference. First operand 299 states and 505 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-12-14 11:44:22,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:22,174 INFO L93 Difference]: Finished difference Result 592 states and 1000 transitions. [2021-12-14 11:44:22,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:22,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-12-14 11:44:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:22,175 INFO L225 Difference]: With dead ends: 592 [2021-12-14 11:44:22,176 INFO L226 Difference]: Without dead ends: 301 [2021-12-14 11:44:22,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,177 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 157 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:22,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 138 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:22,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-12-14 11:44:22,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2021-12-14 11:44:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6812080536912752) internal successors, (501), 298 states have internal predecessors, (501), 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-12-14 11:44:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 501 transitions. [2021-12-14 11:44:22,184 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 501 transitions. Word has length 85 [2021-12-14 11:44:22,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:22,184 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 501 transitions. [2021-12-14 11:44:22,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-12-14 11:44:22,184 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 501 transitions. [2021-12-14 11:44:22,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-14 11:44:22,185 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:22,185 INFO L514 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] [2021-12-14 11:44:22,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 11:44:22,186 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:22,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:22,186 INFO L85 PathProgramCache]: Analyzing trace with hash -274811797, now seen corresponding path program 1 times [2021-12-14 11:44:22,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:22,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125161049] [2021-12-14 11:44:22,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:22,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:44:22,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:22,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125161049] [2021-12-14 11:44:22,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125161049] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:22,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:22,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:22,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201351812] [2021-12-14 11:44:22,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:22,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:22,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:22,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:22,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,214 INFO L87 Difference]: Start difference. First operand 299 states and 501 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-12-14 11:44:22,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:22,318 INFO L93 Difference]: Finished difference Result 594 states and 995 transitions. [2021-12-14 11:44:22,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:22,318 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-12-14 11:44:22,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:22,319 INFO L225 Difference]: With dead ends: 594 [2021-12-14 11:44:22,319 INFO L226 Difference]: Without dead ends: 301 [2021-12-14 11:44:22,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,321 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 130 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:22,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 143 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:22,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-12-14 11:44:22,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2021-12-14 11:44:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.6756756756756757) internal successors, (496), 296 states have internal predecessors, (496), 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-12-14 11:44:22,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 496 transitions. [2021-12-14 11:44:22,327 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 496 transitions. Word has length 85 [2021-12-14 11:44:22,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:22,328 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 496 transitions. [2021-12-14 11:44:22,328 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-12-14 11:44:22,328 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 496 transitions. [2021-12-14 11:44:22,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-14 11:44:22,329 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:22,329 INFO L514 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] [2021-12-14 11:44:22,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 11:44:22,329 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:22,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:22,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1018959428, now seen corresponding path program 1 times [2021-12-14 11:44:22,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:22,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229484367] [2021-12-14 11:44:22,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:22,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:22,350 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-14 11:44:22,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:22,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229484367] [2021-12-14 11:44:22,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229484367] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:22,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:22,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:22,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226023672] [2021-12-14 11:44:22,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:22,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:22,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:22,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:22,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,352 INFO L87 Difference]: Start difference. First operand 297 states and 496 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-12-14 11:44:22,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:22,417 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2021-12-14 11:44:22,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:22,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 97 [2021-12-14 11:44:22,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:22,419 INFO L225 Difference]: With dead ends: 595 [2021-12-14 11:44:22,419 INFO L226 Difference]: Without dead ends: 306 [2021-12-14 11:44:22,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,420 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 162 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:22,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 149 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:22,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-12-14 11:44:22,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-12-14 11:44:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.6459016393442623) internal successors, (502), 305 states have internal predecessors, (502), 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-12-14 11:44:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2021-12-14 11:44:22,427 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 97 [2021-12-14 11:44:22,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:22,427 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2021-12-14 11:44:22,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-12-14 11:44:22,427 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2021-12-14 11:44:22,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-14 11:44:22,428 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:22,428 INFO L514 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] [2021-12-14 11:44:22,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 11:44:22,429 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:22,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:22,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1695142111, now seen corresponding path program 1 times [2021-12-14 11:44:22,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:22,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122966223] [2021-12-14 11:44:22,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:22,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-14 11:44:22,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:22,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122966223] [2021-12-14 11:44:22,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122966223] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:22,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:22,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:22,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466992292] [2021-12-14 11:44:22,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:22,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:22,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:22,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:22,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,451 INFO L87 Difference]: Start difference. First operand 306 states and 502 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-12-14 11:44:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:22,540 INFO L93 Difference]: Finished difference Result 635 states and 1045 transitions. [2021-12-14 11:44:22,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:22,540 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 98 [2021-12-14 11:44:22,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:22,542 INFO L225 Difference]: With dead ends: 635 [2021-12-14 11:44:22,542 INFO L226 Difference]: Without dead ends: 337 [2021-12-14 11:44:22,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,543 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 141 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:22,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 141 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:22,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-12-14 11:44:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-12-14 11:44:22,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6437125748502994) internal successors, (549), 334 states have internal predecessors, (549), 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-12-14 11:44:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2021-12-14 11:44:22,550 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 98 [2021-12-14 11:44:22,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:22,550 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2021-12-14 11:44:22,550 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-12-14 11:44:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2021-12-14 11:44:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-14 11:44:22,551 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:22,551 INFO L514 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] [2021-12-14 11:44:22,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 11:44:22,552 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:22,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:22,552 INFO L85 PathProgramCache]: Analyzing trace with hash -618764698, now seen corresponding path program 1 times [2021-12-14 11:44:22,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:22,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867272727] [2021-12-14 11:44:22,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:22,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-14 11:44:22,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:22,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867272727] [2021-12-14 11:44:22,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867272727] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:22,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:22,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:22,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892602861] [2021-12-14 11:44:22,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:22,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:22,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:22,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:22,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,578 INFO L87 Difference]: Start difference. First operand 335 states and 549 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-12-14 11:44:22,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:22,671 INFO L93 Difference]: Finished difference Result 664 states and 1088 transitions. [2021-12-14 11:44:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:22,672 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 99 [2021-12-14 11:44:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:22,673 INFO L225 Difference]: With dead ends: 664 [2021-12-14 11:44:22,673 INFO L226 Difference]: Without dead ends: 337 [2021-12-14 11:44:22,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,674 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 140 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:22,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 141 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-12-14 11:44:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-12-14 11:44:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6317365269461077) internal successors, (545), 334 states have internal predecessors, (545), 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-12-14 11:44:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 545 transitions. [2021-12-14 11:44:22,681 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 545 transitions. Word has length 99 [2021-12-14 11:44:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:22,681 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 545 transitions. [2021-12-14 11:44:22,682 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-12-14 11:44:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 545 transitions. [2021-12-14 11:44:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-14 11:44:22,682 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:22,683 INFO L514 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] [2021-12-14 11:44:22,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 11:44:22,683 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:22,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:22,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1470499215, now seen corresponding path program 1 times [2021-12-14 11:44:22,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:22,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526306457] [2021-12-14 11:44:22,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:22,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-14 11:44:22,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:22,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526306457] [2021-12-14 11:44:22,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526306457] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:22,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:22,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:22,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504009989] [2021-12-14 11:44:22,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:22,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:22,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:22,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:22,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,708 INFO L87 Difference]: Start difference. First operand 335 states and 545 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-12-14 11:44:22,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:22,796 INFO L93 Difference]: Finished difference Result 697 states and 1138 transitions. [2021-12-14 11:44:22,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:22,796 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-12-14 11:44:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:22,797 INFO L225 Difference]: With dead ends: 697 [2021-12-14 11:44:22,798 INFO L226 Difference]: Without dead ends: 370 [2021-12-14 11:44:22,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,799 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 143 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:22,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 149 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:22,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-12-14 11:44:22,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-12-14 11:44:22,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.626038781163435) internal successors, (587), 361 states have internal predecessors, (587), 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-12-14 11:44:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2021-12-14 11:44:22,806 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 100 [2021-12-14 11:44:22,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:22,806 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2021-12-14 11:44:22,806 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-12-14 11:44:22,807 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2021-12-14 11:44:22,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-14 11:44:22,807 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:22,808 INFO L514 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] [2021-12-14 11:44:22,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 11:44:22,808 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:22,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:22,808 INFO L85 PathProgramCache]: Analyzing trace with hash 863697078, now seen corresponding path program 1 times [2021-12-14 11:44:22,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:22,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123098927] [2021-12-14 11:44:22,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:22,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-14 11:44:22,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:22,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123098927] [2021-12-14 11:44:22,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123098927] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:22,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:22,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:22,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761576983] [2021-12-14 11:44:22,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:22,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:22,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:22,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:22,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,828 INFO L87 Difference]: Start difference. First operand 362 states and 587 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-12-14 11:44:22,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:22,915 INFO L93 Difference]: Finished difference Result 724 states and 1175 transitions. [2021-12-14 11:44:22,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:22,916 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-12-14 11:44:22,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:22,917 INFO L225 Difference]: With dead ends: 724 [2021-12-14 11:44:22,917 INFO L226 Difference]: Without dead ends: 370 [2021-12-14 11:44:22,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,918 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:22,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 149 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:22,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-12-14 11:44:22,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-12-14 11:44:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.6121883656509695) internal successors, (582), 361 states have internal predecessors, (582), 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-12-14 11:44:22,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2021-12-14 11:44:22,926 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 101 [2021-12-14 11:44:22,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:22,926 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2021-12-14 11:44:22,926 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-12-14 11:44:22,927 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2021-12-14 11:44:22,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-14 11:44:22,927 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:22,928 INFO L514 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] [2021-12-14 11:44:22,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 11:44:22,928 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:22,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:22,928 INFO L85 PathProgramCache]: Analyzing trace with hash 227220919, now seen corresponding path program 1 times [2021-12-14 11:44:22,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:22,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239189733] [2021-12-14 11:44:22,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:22,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-14 11:44:22,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:22,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239189733] [2021-12-14 11:44:22,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239189733] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:22,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:22,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:22,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662730569] [2021-12-14 11:44:22,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:22,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:22,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:22,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:22,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,951 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-12-14 11:44:23,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:23,031 INFO L93 Difference]: Finished difference Result 741 states and 1193 transitions. [2021-12-14 11:44:23,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:23,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 105 [2021-12-14 11:44:23,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:23,033 INFO L225 Difference]: With dead ends: 741 [2021-12-14 11:44:23,033 INFO L226 Difference]: Without dead ends: 387 [2021-12-14 11:44:23,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,034 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 149 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:23,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 144 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:23,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-12-14 11:44:23,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2021-12-14 11:44:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5994764397905759) internal successors, (611), 382 states have internal predecessors, (611), 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-12-14 11:44:23,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2021-12-14 11:44:23,042 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 105 [2021-12-14 11:44:23,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:23,042 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2021-12-14 11:44:23,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-12-14 11:44:23,043 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2021-12-14 11:44:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-14 11:44:23,043 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:23,044 INFO L514 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] [2021-12-14 11:44:23,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 11:44:23,044 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:23,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:23,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1469868848, now seen corresponding path program 1 times [2021-12-14 11:44:23,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:23,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204727008] [2021-12-14 11:44:23,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:23,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-14 11:44:23,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:23,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204727008] [2021-12-14 11:44:23,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204727008] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:23,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:23,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:23,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166909541] [2021-12-14 11:44:23,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:23,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:23,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:23,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:23,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,066 INFO L87 Difference]: Start difference. First operand 383 states and 611 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-12-14 11:44:23,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:23,145 INFO L93 Difference]: Finished difference Result 762 states and 1216 transitions. [2021-12-14 11:44:23,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:23,146 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-12-14 11:44:23,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:23,147 INFO L225 Difference]: With dead ends: 762 [2021-12-14 11:44:23,147 INFO L226 Difference]: Without dead ends: 387 [2021-12-14 11:44:23,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,148 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 148 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:23,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 144 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-12-14 11:44:23,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2021-12-14 11:44:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5837696335078535) internal successors, (605), 382 states have internal predecessors, (605), 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-12-14 11:44:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2021-12-14 11:44:23,156 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 106 [2021-12-14 11:44:23,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:23,157 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2021-12-14 11:44:23,157 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-12-14 11:44:23,157 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2021-12-14 11:44:23,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-14 11:44:23,158 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:23,158 INFO L514 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] [2021-12-14 11:44:23,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 11:44:23,158 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:23,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:23,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1361423817, now seen corresponding path program 1 times [2021-12-14 11:44:23,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:23,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983786011] [2021-12-14 11:44:23,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:23,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-12-14 11:44:23,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:23,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983786011] [2021-12-14 11:44:23,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983786011] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:23,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:23,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:23,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639901090] [2021-12-14 11:44:23,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:23,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:23,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:23,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:23,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,183 INFO L87 Difference]: Start difference. First operand 383 states and 605 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-12-14 11:44:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:23,216 INFO L93 Difference]: Finished difference Result 1127 states and 1785 transitions. [2021-12-14 11:44:23,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:23,217 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 121 [2021-12-14 11:44:23,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:23,219 INFO L225 Difference]: With dead ends: 1127 [2021-12-14 11:44:23,219 INFO L226 Difference]: Without dead ends: 752 [2021-12-14 11:44:23,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,220 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 133 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:23,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 539 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:44:23,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2021-12-14 11:44:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2021-12-14 11:44:23,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 751 states have (on average 1.5805592543275633) internal successors, (1187), 751 states have internal predecessors, (1187), 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-12-14 11:44:23,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1187 transitions. [2021-12-14 11:44:23,240 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1187 transitions. Word has length 121 [2021-12-14 11:44:23,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:23,240 INFO L470 AbstractCegarLoop]: Abstraction has 752 states and 1187 transitions. [2021-12-14 11:44:23,240 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-12-14 11:44:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1187 transitions. [2021-12-14 11:44:23,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-14 11:44:23,242 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:23,242 INFO L514 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] [2021-12-14 11:44:23,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 11:44:23,242 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:23,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:23,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2036150201, now seen corresponding path program 1 times [2021-12-14 11:44:23,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:23,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947369153] [2021-12-14 11:44:23,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:23,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-14 11:44:23,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:23,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947369153] [2021-12-14 11:44:23,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947369153] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:23,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:23,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:23,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779491028] [2021-12-14 11:44:23,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:23,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:23,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:23,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:23,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,265 INFO L87 Difference]: Start difference. First operand 752 states and 1187 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-12-14 11:44:23,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:23,295 INFO L93 Difference]: Finished difference Result 1825 states and 2885 transitions. [2021-12-14 11:44:23,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:23,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 121 [2021-12-14 11:44:23,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:23,299 INFO L225 Difference]: With dead ends: 1825 [2021-12-14 11:44:23,299 INFO L226 Difference]: Without dead ends: 1081 [2021-12-14 11:44:23,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,300 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 135 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:23,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 543 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:44:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2021-12-14 11:44:23,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1081. [2021-12-14 11:44:23,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1080 states have (on average 1.5787037037037037) internal successors, (1705), 1080 states have internal predecessors, (1705), 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-12-14 11:44:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1705 transitions. [2021-12-14 11:44:23,323 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1705 transitions. Word has length 121 [2021-12-14 11:44:23,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:23,324 INFO L470 AbstractCegarLoop]: Abstraction has 1081 states and 1705 transitions. [2021-12-14 11:44:23,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-12-14 11:44:23,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1705 transitions. [2021-12-14 11:44:23,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-14 11:44:23,325 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:23,326 INFO L514 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] [2021-12-14 11:44:23,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 11:44:23,326 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:23,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:23,326 INFO L85 PathProgramCache]: Analyzing trace with hash 157019255, now seen corresponding path program 1 times [2021-12-14 11:44:23,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:23,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269846748] [2021-12-14 11:44:23,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:23,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:23,344 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-14 11:44:23,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:23,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269846748] [2021-12-14 11:44:23,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269846748] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:23,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:23,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:23,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855812993] [2021-12-14 11:44:23,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:23,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:23,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:23,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:23,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,346 INFO L87 Difference]: Start difference. First operand 1081 states and 1705 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-12-14 11:44:23,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:23,384 INFO L93 Difference]: Finished difference Result 2523 states and 3985 transitions. [2021-12-14 11:44:23,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:23,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 121 [2021-12-14 11:44:23,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:23,389 INFO L225 Difference]: With dead ends: 2523 [2021-12-14 11:44:23,389 INFO L226 Difference]: Without dead ends: 1450 [2021-12-14 11:44:23,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,390 INFO L933 BasicCegarLoop]: 361 mSDtfsCounter, 155 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:23,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 546 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:44:23,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2021-12-14 11:44:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2021-12-14 11:44:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1449 states have (on average 1.5783298826777088) internal successors, (2287), 1449 states have internal predecessors, (2287), 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-12-14 11:44:23,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 2287 transitions. [2021-12-14 11:44:23,420 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 2287 transitions. Word has length 121 [2021-12-14 11:44:23,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:23,420 INFO L470 AbstractCegarLoop]: Abstraction has 1450 states and 2287 transitions. [2021-12-14 11:44:23,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-12-14 11:44:23,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2287 transitions. [2021-12-14 11:44:23,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-14 11:44:23,422 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:23,423 INFO L514 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] [2021-12-14 11:44:23,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 11:44:23,423 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:23,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:23,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1876374791, now seen corresponding path program 1 times [2021-12-14 11:44:23,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:23,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429893264] [2021-12-14 11:44:23,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:23,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-12-14 11:44:23,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:23,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429893264] [2021-12-14 11:44:23,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429893264] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:23,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:23,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:23,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786294980] [2021-12-14 11:44:23,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:23,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:23,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:23,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:23,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,441 INFO L87 Difference]: Start difference. First operand 1450 states and 2287 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-12-14 11:44:23,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:23,491 INFO L93 Difference]: Finished difference Result 3243 states and 5118 transitions. [2021-12-14 11:44:23,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:23,492 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 121 [2021-12-14 11:44:23,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:23,497 INFO L225 Difference]: With dead ends: 3243 [2021-12-14 11:44:23,497 INFO L226 Difference]: Without dead ends: 1801 [2021-12-14 11:44:23,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,498 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 170 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:23,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 388 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:44:23,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2021-12-14 11:44:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1801. [2021-12-14 11:44:23,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1800 states have (on average 1.5766666666666667) internal successors, (2838), 1800 states have internal predecessors, (2838), 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-12-14 11:44:23,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2838 transitions. [2021-12-14 11:44:23,536 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2838 transitions. Word has length 121 [2021-12-14 11:44:23,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:23,536 INFO L470 AbstractCegarLoop]: Abstraction has 1801 states and 2838 transitions. [2021-12-14 11:44:23,536 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-12-14 11:44:23,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2838 transitions. [2021-12-14 11:44:23,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-12-14 11:44:23,539 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:23,539 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:23,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 11:44:23,540 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:23,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:23,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2028887816, now seen corresponding path program 1 times [2021-12-14 11:44:23,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:23,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009995410] [2021-12-14 11:44:23,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:23,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-12-14 11:44:23,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:23,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009995410] [2021-12-14 11:44:23,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009995410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:23,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:23,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:23,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874816568] [2021-12-14 11:44:23,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:23,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:23,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:23,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:23,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,567 INFO L87 Difference]: Start difference. First operand 1801 states and 2838 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-12-14 11:44:23,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:23,687 INFO L93 Difference]: Finished difference Result 3644 states and 5724 transitions. [2021-12-14 11:44:23,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:23,688 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 199 [2021-12-14 11:44:23,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:23,693 INFO L225 Difference]: With dead ends: 3644 [2021-12-14 11:44:23,693 INFO L226 Difference]: Without dead ends: 1851 [2021-12-14 11:44:23,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,695 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 30 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:23,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 297 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:23,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2021-12-14 11:44:23,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1801. [2021-12-14 11:44:23,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1800 states have (on average 1.5366666666666666) internal successors, (2766), 1800 states have internal predecessors, (2766), 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-12-14 11:44:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2766 transitions. [2021-12-14 11:44:23,753 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2766 transitions. Word has length 199 [2021-12-14 11:44:23,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:23,753 INFO L470 AbstractCegarLoop]: Abstraction has 1801 states and 2766 transitions. [2021-12-14 11:44:23,754 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-12-14 11:44:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2766 transitions. [2021-12-14 11:44:23,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-12-14 11:44:23,757 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:23,757 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:23,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-14 11:44:23,758 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:23,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:23,758 INFO L85 PathProgramCache]: Analyzing trace with hash -965634174, now seen corresponding path program 1 times [2021-12-14 11:44:23,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:23,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321495727] [2021-12-14 11:44:23,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:23,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-12-14 11:44:23,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:23,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321495727] [2021-12-14 11:44:23,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321495727] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:23,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:23,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:23,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848211954] [2021-12-14 11:44:23,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:23,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:23,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:23,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:23,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,788 INFO L87 Difference]: Start difference. First operand 1801 states and 2766 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-12-14 11:44:23,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:23,915 INFO L93 Difference]: Finished difference Result 3661 states and 5597 transitions. [2021-12-14 11:44:23,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:23,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 213 [2021-12-14 11:44:23,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:23,921 INFO L225 Difference]: With dead ends: 3661 [2021-12-14 11:44:23,921 INFO L226 Difference]: Without dead ends: 1868 [2021-12-14 11:44:23,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,923 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 152 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:23,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 163 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:23,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2021-12-14 11:44:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1801. [2021-12-14 11:44:23,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1800 states have (on average 1.4944444444444445) internal successors, (2690), 1800 states have internal predecessors, (2690), 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-12-14 11:44:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2690 transitions. [2021-12-14 11:44:23,962 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2690 transitions. Word has length 213 [2021-12-14 11:44:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:23,963 INFO L470 AbstractCegarLoop]: Abstraction has 1801 states and 2690 transitions. [2021-12-14 11:44:23,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-12-14 11:44:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2690 transitions. [2021-12-14 11:44:23,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2021-12-14 11:44:23,967 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:23,967 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:23,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-14 11:44:23,967 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:23,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:23,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1818923529, now seen corresponding path program 1 times [2021-12-14 11:44:23,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:23,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136227567] [2021-12-14 11:44:23,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:23,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:24,016 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-12-14 11:44:24,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:24,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136227567] [2021-12-14 11:44:24,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136227567] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:24,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:24,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:24,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640713387] [2021-12-14 11:44:24,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:24,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:24,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:24,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:24,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:24,018 INFO L87 Difference]: Start difference. First operand 1801 states and 2690 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-12-14 11:44:24,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:24,138 INFO L93 Difference]: Finished difference Result 5291 states and 7904 transitions. [2021-12-14 11:44:24,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:24,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 241 [2021-12-14 11:44:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:24,161 INFO L225 Difference]: With dead ends: 5291 [2021-12-14 11:44:24,162 INFO L226 Difference]: Without dead ends: 3498 [2021-12-14 11:44:24,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:24,180 INFO L933 BasicCegarLoop]: 353 mSDtfsCounter, 132 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:24,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 542 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:44:24,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2021-12-14 11:44:24,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 3496. [2021-12-14 11:44:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3496 states, 3495 states have (on average 1.4912732474964234) internal successors, (5212), 3495 states have internal predecessors, (5212), 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-12-14 11:44:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 5212 transitions. [2021-12-14 11:44:24,288 INFO L78 Accepts]: Start accepts. Automaton has 3496 states and 5212 transitions. Word has length 241 [2021-12-14 11:44:24,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:24,288 INFO L470 AbstractCegarLoop]: Abstraction has 3496 states and 5212 transitions. [2021-12-14 11:44:24,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-12-14 11:44:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 5212 transitions. [2021-12-14 11:44:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2021-12-14 11:44:24,294 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:24,295 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:24,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-14 11:44:24,295 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:24,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:24,295 INFO L85 PathProgramCache]: Analyzing trace with hash 672015849, now seen corresponding path program 1 times [2021-12-14 11:44:24,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:24,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859208874] [2021-12-14 11:44:24,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:24,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2021-12-14 11:44:24,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:24,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859208874] [2021-12-14 11:44:24,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859208874] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:24,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:24,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:24,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28733593] [2021-12-14 11:44:24,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:24,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:24,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:24,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:24,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:24,331 INFO L87 Difference]: Start difference. First operand 3496 states and 5212 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-12-14 11:44:24,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:24,492 INFO L93 Difference]: Finished difference Result 6984 states and 10412 transitions. [2021-12-14 11:44:24,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:24,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 278 [2021-12-14 11:44:24,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:24,502 INFO L225 Difference]: With dead ends: 6984 [2021-12-14 11:44:24,502 INFO L226 Difference]: Without dead ends: 3496 [2021-12-14 11:44:24,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:24,507 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 14 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:24,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 301 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3496 states. [2021-12-14 11:44:24,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3496 to 3496. [2021-12-14 11:44:24,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3496 states, 3495 states have (on average 1.4597997138769672) internal successors, (5102), 3495 states have internal predecessors, (5102), 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-12-14 11:44:24,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 5102 transitions. [2021-12-14 11:44:24,589 INFO L78 Accepts]: Start accepts. Automaton has 3496 states and 5102 transitions. Word has length 278 [2021-12-14 11:44:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:24,590 INFO L470 AbstractCegarLoop]: Abstraction has 3496 states and 5102 transitions. [2021-12-14 11:44:24,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-12-14 11:44:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 5102 transitions. [2021-12-14 11:44:24,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2021-12-14 11:44:24,598 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:24,598 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:24,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-14 11:44:24,599 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:24,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:24,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1314633518, now seen corresponding path program 1 times [2021-12-14 11:44:24,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:24,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315770504] [2021-12-14 11:44:24,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:24,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 524 proven. 66 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2021-12-14 11:44:24,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:24,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315770504] [2021-12-14 11:44:24,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315770504] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:44:24,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906446924] [2021-12-14 11:44:24,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:24,646 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:44:24,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:44:24,648 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-12-14 11:44:24,680 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-12-14 11:44:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:24,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 11:44:24,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:44:25,157 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2021-12-14 11:44:25,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:44:25,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906446924] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:25,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 11:44:25,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-12-14 11:44:25,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582596774] [2021-12-14 11:44:25,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:25,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:25,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:25,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:25,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:44:25,159 INFO L87 Difference]: Start difference. First operand 3496 states and 5102 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-12-14 11:44:25,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:25,316 INFO L93 Difference]: Finished difference Result 7374 states and 10802 transitions. [2021-12-14 11:44:25,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:25,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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 306 [2021-12-14 11:44:25,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:25,323 INFO L225 Difference]: With dead ends: 7374 [2021-12-14 11:44:25,323 INFO L226 Difference]: Without dead ends: 2111 [2021-12-14 11:44:25,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:44:25,328 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 30 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:25,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 296 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:25,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2021-12-14 11:44:25,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 2111. [2021-12-14 11:44:25,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2111 states, 2110 states have (on average 1.4398104265402845) internal successors, (3038), 2110 states have internal predecessors, (3038), 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-12-14 11:44:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3038 transitions. [2021-12-14 11:44:25,368 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3038 transitions. Word has length 306 [2021-12-14 11:44:25,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:25,368 INFO L470 AbstractCegarLoop]: Abstraction has 2111 states and 3038 transitions. [2021-12-14 11:44:25,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-12-14 11:44:25,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3038 transitions. [2021-12-14 11:44:25,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2021-12-14 11:44:25,373 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:25,373 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:25,393 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-12-14 11:44:25,591 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,SelfDestructingSolverStorable22 [2021-12-14 11:44:25,591 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:25,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:25,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1538998335, now seen corresponding path program 1 times [2021-12-14 11:44:25,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:25,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646121193] [2021-12-14 11:44:25,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:25,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2021-12-14 11:44:25,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:25,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646121193] [2021-12-14 11:44:25,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646121193] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:25,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:25,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:25,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855854920] [2021-12-14 11:44:25,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:25,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:25,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:25,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:25,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:25,623 INFO L87 Difference]: Start difference. First operand 2111 states and 3038 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-12-14 11:44:25,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:25,749 INFO L93 Difference]: Finished difference Result 4330 states and 6230 transitions. [2021-12-14 11:44:25,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:25,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 307 [2021-12-14 11:44:25,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:25,767 INFO L225 Difference]: With dead ends: 4330 [2021-12-14 11:44:25,767 INFO L226 Difference]: Without dead ends: 2227 [2021-12-14 11:44:25,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:25,771 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 13 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:25,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 305 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:25,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2021-12-14 11:44:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2203. [2021-12-14 11:44:25,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2203 states, 2202 states have (on average 1.430517711171662) internal successors, (3150), 2202 states have internal predecessors, (3150), 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-12-14 11:44:25,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 3150 transitions. [2021-12-14 11:44:25,822 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 3150 transitions. Word has length 307 [2021-12-14 11:44:25,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:25,822 INFO L470 AbstractCegarLoop]: Abstraction has 2203 states and 3150 transitions. [2021-12-14 11:44:25,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-12-14 11:44:25,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 3150 transitions. [2021-12-14 11:44:25,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2021-12-14 11:44:25,827 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:25,827 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:25,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-14 11:44:25,828 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:25,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:25,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1338757249, now seen corresponding path program 1 times [2021-12-14 11:44:25,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:25,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134257032] [2021-12-14 11:44:25,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:25,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-12-14 11:44:25,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:25,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134257032] [2021-12-14 11:44:25,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134257032] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:25,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:25,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:25,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788795062] [2021-12-14 11:44:25,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:25,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:25,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:25,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:25,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:25,865 INFO L87 Difference]: Start difference. First operand 2203 states and 3150 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-12-14 11:44:25,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:25,969 INFO L93 Difference]: Finished difference Result 4626 states and 6642 transitions. [2021-12-14 11:44:25,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:25,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 328 [2021-12-14 11:44:25,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:25,974 INFO L225 Difference]: With dead ends: 4626 [2021-12-14 11:44:25,974 INFO L226 Difference]: Without dead ends: 2431 [2021-12-14 11:44:25,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:25,977 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 29 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:25,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 305 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:25,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2021-12-14 11:44:26,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 2353. [2021-12-14 11:44:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2353 states, 2352 states have (on average 1.4158163265306123) internal successors, (3330), 2352 states have internal predecessors, (3330), 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-12-14 11:44:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 3330 transitions. [2021-12-14 11:44:26,044 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 3330 transitions. Word has length 328 [2021-12-14 11:44:26,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:26,044 INFO L470 AbstractCegarLoop]: Abstraction has 2353 states and 3330 transitions. [2021-12-14 11:44:26,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-12-14 11:44:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 3330 transitions. [2021-12-14 11:44:26,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2021-12-14 11:44:26,050 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:26,050 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:26,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-14 11:44:26,050 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:26,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:26,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1183337782, now seen corresponding path program 1 times [2021-12-14 11:44:26,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:26,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624564757] [2021-12-14 11:44:26,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:26,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2021-12-14 11:44:26,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:26,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624564757] [2021-12-14 11:44:26,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624564757] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:26,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:26,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:26,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892631020] [2021-12-14 11:44:26,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:26,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:26,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:26,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:26,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:26,090 INFO L87 Difference]: Start difference. First operand 2353 states and 3330 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-12-14 11:44:26,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:26,195 INFO L93 Difference]: Finished difference Result 4746 states and 6726 transitions. [2021-12-14 11:44:26,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:26,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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 354 [2021-12-14 11:44:26,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:26,199 INFO L225 Difference]: With dead ends: 4746 [2021-12-14 11:44:26,199 INFO L226 Difference]: Without dead ends: 2401 [2021-12-14 11:44:26,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:26,202 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 19 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:26,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 304 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:26,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2021-12-14 11:44:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2353. [2021-12-14 11:44:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2353 states, 2352 states have (on average 1.3903061224489797) internal successors, (3270), 2352 states have internal predecessors, (3270), 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-12-14 11:44:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 3270 transitions. [2021-12-14 11:44:26,242 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 3270 transitions. Word has length 354 [2021-12-14 11:44:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:26,243 INFO L470 AbstractCegarLoop]: Abstraction has 2353 states and 3270 transitions. [2021-12-14 11:44:26,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-12-14 11:44:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 3270 transitions. [2021-12-14 11:44:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2021-12-14 11:44:26,248 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:26,248 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:26,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-14 11:44:26,248 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:26,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:26,249 INFO L85 PathProgramCache]: Analyzing trace with hash -240397493, now seen corresponding path program 1 times [2021-12-14 11:44:26,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:26,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584911245] [2021-12-14 11:44:26,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:26,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-12-14 11:44:26,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:26,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584911245] [2021-12-14 11:44:26,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584911245] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:44:26,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573596258] [2021-12-14 11:44:26,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:26,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:44:26,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:44:26,308 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-12-14 11:44:26,358 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-12-14 11:44:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:26,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 11:44:26,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:44:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-12-14 11:44:26,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:44:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-12-14 11:44:27,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573596258] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:44:27,253 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:44:27,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2021-12-14 11:44:27,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680425171] [2021-12-14 11:44:27,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:44:27,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:44:27,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:27,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:44:27,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:44:27,255 INFO L87 Difference]: Start difference. First operand 2353 states and 3270 transitions. Second operand has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 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-12-14 11:44:27,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:27,592 INFO L93 Difference]: Finished difference Result 6193 states and 8608 transitions. [2021-12-14 11:44:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:44:27,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 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) Word has length 372 [2021-12-14 11:44:27,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:27,598 INFO L225 Difference]: With dead ends: 6193 [2021-12-14 11:44:27,598 INFO L226 Difference]: Without dead ends: 3710 [2021-12-14 11:44:27,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 746 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:44:27,601 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 529 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:27,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [529 Valid, 637 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:44:27,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2021-12-14 11:44:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 2380. [2021-12-14 11:44:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2379 states have (on average 1.3711643547709123) internal successors, (3262), 2379 states have internal predecessors, (3262), 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-12-14 11:44:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3262 transitions. [2021-12-14 11:44:27,676 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3262 transitions. Word has length 372 [2021-12-14 11:44:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:27,677 INFO L470 AbstractCegarLoop]: Abstraction has 2380 states and 3262 transitions. [2021-12-14 11:44:27,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 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-12-14 11:44:27,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3262 transitions. [2021-12-14 11:44:27,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2021-12-14 11:44:27,682 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:27,683 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:27,702 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-12-14 11:44:27,900 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,SelfDestructingSolverStorable26 [2021-12-14 11:44:27,900 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:27,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:27,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1847872530, now seen corresponding path program 1 times [2021-12-14 11:44:27,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:27,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573390946] [2021-12-14 11:44:27,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:27,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2021-12-14 11:44:27,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:27,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573390946] [2021-12-14 11:44:27,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573390946] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:27,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:27,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:27,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758012717] [2021-12-14 11:44:27,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:27,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:27,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:27,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:27,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:27,954 INFO L87 Difference]: Start difference. First operand 2380 states and 3262 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-12-14 11:44:28,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:28,040 INFO L93 Difference]: Finished difference Result 4764 states and 6524 transitions. [2021-12-14 11:44:28,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:28,040 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 439 [2021-12-14 11:44:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:28,044 INFO L225 Difference]: With dead ends: 4764 [2021-12-14 11:44:28,044 INFO L226 Difference]: Without dead ends: 2392 [2021-12-14 11:44:28,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:28,047 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:28,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 295 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:28,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2021-12-14 11:44:28,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2380. [2021-12-14 11:44:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2379 states have (on average 1.3459436738125263) internal successors, (3202), 2379 states have internal predecessors, (3202), 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-12-14 11:44:28,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3202 transitions. [2021-12-14 11:44:28,100 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3202 transitions. Word has length 439 [2021-12-14 11:44:28,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:28,100 INFO L470 AbstractCegarLoop]: Abstraction has 2380 states and 3202 transitions. [2021-12-14 11:44:28,100 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-12-14 11:44:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3202 transitions. [2021-12-14 11:44:28,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2021-12-14 11:44:28,106 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:28,107 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:28,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-14 11:44:28,107 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:28,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:28,107 INFO L85 PathProgramCache]: Analyzing trace with hash -118519316, now seen corresponding path program 1 times [2021-12-14 11:44:28,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:28,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922977610] [2021-12-14 11:44:28,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:28,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:28,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2021-12-14 11:44:28,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:28,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922977610] [2021-12-14 11:44:28,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922977610] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:28,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:28,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:28,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097583560] [2021-12-14 11:44:28,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:28,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:28,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:28,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:28,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:28,162 INFO L87 Difference]: Start difference. First operand 2380 states and 3202 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-12-14 11:44:28,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:28,269 INFO L93 Difference]: Finished difference Result 4968 states and 6710 transitions. [2021-12-14 11:44:28,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:28,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 472 [2021-12-14 11:44:28,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:28,273 INFO L225 Difference]: With dead ends: 4968 [2021-12-14 11:44:28,274 INFO L226 Difference]: Without dead ends: 2596 [2021-12-14 11:44:28,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:28,277 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:28,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:28,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2021-12-14 11:44:28,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 2584. [2021-12-14 11:44:28,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2584 states, 2583 states have (on average 1.3302361595044523) internal successors, (3436), 2583 states have internal predecessors, (3436), 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-12-14 11:44:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2584 states and 3436 transitions. [2021-12-14 11:44:28,332 INFO L78 Accepts]: Start accepts. Automaton has 2584 states and 3436 transitions. Word has length 472 [2021-12-14 11:44:28,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:28,332 INFO L470 AbstractCegarLoop]: Abstraction has 2584 states and 3436 transitions. [2021-12-14 11:44:28,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-12-14 11:44:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 3436 transitions. [2021-12-14 11:44:28,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2021-12-14 11:44:28,340 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:28,340 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:28,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-14 11:44:28,341 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:28,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:28,341 INFO L85 PathProgramCache]: Analyzing trace with hash 996725818, now seen corresponding path program 1 times [2021-12-14 11:44:28,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:28,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803333395] [2021-12-14 11:44:28,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:28,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:28,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2021-12-14 11:44:28,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:28,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803333395] [2021-12-14 11:44:28,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803333395] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:28,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:28,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:28,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726609121] [2021-12-14 11:44:28,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:28,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:28,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:28,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:28,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:28,404 INFO L87 Difference]: Start difference. First operand 2584 states and 3436 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-12-14 11:44:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:28,506 INFO L93 Difference]: Finished difference Result 5388 states and 7202 transitions. [2021-12-14 11:44:28,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:28,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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 534 [2021-12-14 11:44:28,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:28,510 INFO L225 Difference]: With dead ends: 5388 [2021-12-14 11:44:28,510 INFO L226 Difference]: Without dead ends: 2812 [2021-12-14 11:44:28,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:28,514 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:28,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:28,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2021-12-14 11:44:28,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2800. [2021-12-14 11:44:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2800 states, 2799 states have (on average 1.3154698106466596) internal successors, (3682), 2799 states have internal predecessors, (3682), 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-12-14 11:44:28,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2800 states and 3682 transitions. [2021-12-14 11:44:28,563 INFO L78 Accepts]: Start accepts. Automaton has 2800 states and 3682 transitions. Word has length 534 [2021-12-14 11:44:28,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:28,563 INFO L470 AbstractCegarLoop]: Abstraction has 2800 states and 3682 transitions. [2021-12-14 11:44:28,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-12-14 11:44:28,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 3682 transitions. [2021-12-14 11:44:28,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2021-12-14 11:44:28,569 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:28,569 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:28,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-14 11:44:28,569 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:28,570 INFO L85 PathProgramCache]: Analyzing trace with hash 712864204, now seen corresponding path program 1 times [2021-12-14 11:44:28,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:28,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105998024] [2021-12-14 11:44:28,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:28,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:28,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-12-14 11:44:28,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:28,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105998024] [2021-12-14 11:44:28,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105998024] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:44:28,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585502362] [2021-12-14 11:44:28,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:28,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:44:28,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:44:28,649 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-12-14 11:44:28,691 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-12-14 11:44:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:28,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 11:44:28,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:44:29,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-12-14 11:44:29,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:44:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-12-14 11:44:29,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585502362] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:44:29,858 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:44:29,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-12-14 11:44:29,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778519098] [2021-12-14 11:44:29,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:44:29,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 11:44:29,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:29,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 11:44:29,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:44:29,860 INFO L87 Difference]: Start difference. First operand 2800 states and 3682 transitions. Second operand has 8 states, 8 states have (on average 41.625) internal successors, (333), 8 states have internal predecessors, (333), 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-12-14 11:44:30,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:30,127 INFO L93 Difference]: Finished difference Result 5161 states and 6815 transitions. [2021-12-14 11:44:30,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:44:30,128 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 41.625) internal successors, (333), 8 states have internal predecessors, (333), 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 600 [2021-12-14 11:44:30,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:30,129 INFO L225 Difference]: With dead ends: 5161 [2021-12-14 11:44:30,129 INFO L226 Difference]: Without dead ends: 0 [2021-12-14 11:44:30,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1208 GetRequests, 1199 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:44:30,132 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 224 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:30,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 792 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:44:30,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-14 11:44:30,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-14 11:44:30,133 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-12-14 11:44:30,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-14 11:44:30,134 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 600 [2021-12-14 11:44:30,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:30,134 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 11:44:30,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 41.625) internal successors, (333), 8 states have internal predecessors, (333), 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-12-14 11:44:30,134 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-14 11:44:30,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-14 11:44:30,136 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 11:44:30,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 11:44:30,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:44:30,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-14 11:44:38,109 INFO L858 garLoopResultBuilder]: For program point L399(lines 399 417) no Hoare annotation was computed. [2021-12-14 11:44:38,110 INFO L854 garLoopResultBuilder]: At program point L201(lines 197 561) the Hoare annotation is: (let ((.cse6 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse9 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse9) (and .cse0 .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse4 .cse5 .cse7 .cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse9 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)))) [2021-12-14 11:44:38,111 INFO L854 garLoopResultBuilder]: At program point L168(lines 164 572) the Hoare annotation is: (let ((.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse14 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse13 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse15))) [2021-12-14 11:44:38,112 INFO L854 garLoopResultBuilder]: At program point L135(lines 134 582) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2021-12-14 11:44:38,112 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2021-12-14 11:44:38,112 INFO L861 garLoopResultBuilder]: At program point L631(lines 622 633) the Hoare annotation is: true [2021-12-14 11:44:38,112 INFO L858 garLoopResultBuilder]: For program point L400(lines 400 406) no Hoare annotation was computed. [2021-12-14 11:44:38,112 INFO L858 garLoopResultBuilder]: For program point L599(lines 599 603) no Hoare annotation was computed. [2021-12-14 11:44:38,112 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 559) no Hoare annotation was computed. [2021-12-14 11:44:38,113 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 570) no Hoare annotation was computed. [2021-12-14 11:44:38,113 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 581) no Hoare annotation was computed. [2021-12-14 11:44:38,113 INFO L858 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2021-12-14 11:44:38,114 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2021-12-14 11:44:38,114 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 248) no Hoare annotation was computed. [2021-12-14 11:44:38,114 INFO L858 garLoopResultBuilder]: For program point L237-2(lines 219 552) no Hoare annotation was computed. [2021-12-14 11:44:38,114 INFO L858 garLoopResultBuilder]: For program point L502(lines 502 505) no Hoare annotation was computed. [2021-12-14 11:44:38,114 INFO L858 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2021-12-14 11:44:38,114 INFO L858 garLoopResultBuilder]: For program point L304-2(lines 304 308) no Hoare annotation was computed. [2021-12-14 11:44:38,114 INFO L858 garLoopResultBuilder]: For program point L437-1(lines 437 445) no Hoare annotation was computed. [2021-12-14 11:44:38,114 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2021-12-14 11:44:38,114 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 558) no Hoare annotation was computed. [2021-12-14 11:44:38,115 INFO L858 garLoopResultBuilder]: For program point L173(lines 173 569) no Hoare annotation was computed. [2021-12-14 11:44:38,115 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 580) no Hoare annotation was computed. [2021-12-14 11:44:38,115 INFO L854 garLoopResultBuilder]: At program point L207(lines 203 559) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse9 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse9 .cse10) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse9 .cse10))) [2021-12-14 11:44:38,115 INFO L854 garLoopResultBuilder]: At program point L174(lines 170 570) the Hoare annotation is: (let ((.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse16 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse15 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2021-12-14 11:44:38,116 INFO L858 garLoopResultBuilder]: For program point L440(lines 440 443) no Hoare annotation was computed. [2021-12-14 11:44:38,116 INFO L858 garLoopResultBuilder]: For program point L341(lines 341 379) no Hoare annotation was computed. [2021-12-14 11:44:38,116 INFO L858 garLoopResultBuilder]: For program point L209(lines 209 557) no Hoare annotation was computed. [2021-12-14 11:44:38,116 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 568) no Hoare annotation was computed. [2021-12-14 11:44:38,116 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 579) no Hoare annotation was computed. [2021-12-14 11:44:38,117 INFO L854 garLoopResultBuilder]: At program point L110-2(lines 110 608) the Hoare annotation is: (let ((.cse12 (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (let ((.cse11 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (not .cse12)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse10 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse7 .cse9 .cse8) (and .cse4 .cse10) (and (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse11 .cse8) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) (and .cse11 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse12) (and .cse11 .cse10) (and .cse13 .cse14 .cse15) (and .cse4 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse13 .cse6 .cse7 .cse8) (and .cse9 .cse10) (and .cse13 .cse10) (and .cse14 .cse9 .cse15)))) [2021-12-14 11:44:38,117 INFO L858 garLoopResultBuilder]: For program point L540(lines 540 546) no Hoare annotation was computed. [2021-12-14 11:44:38,117 INFO L858 garLoopResultBuilder]: For program point L507(lines 507 509) no Hoare annotation was computed. [2021-12-14 11:44:38,117 INFO L858 garLoopResultBuilder]: For program point L540-1(lines 540 546) no Hoare annotation was computed. [2021-12-14 11:44:38,117 INFO L858 garLoopResultBuilder]: For program point L507-2(lines 219 552) no Hoare annotation was computed. [2021-12-14 11:44:38,117 INFO L854 garLoopResultBuilder]: At program point L408(lines 399 417) the Hoare annotation is: (let ((.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse14 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse13 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse15))) [2021-12-14 11:44:38,117 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2021-12-14 11:44:38,118 INFO L854 garLoopResultBuilder]: At program point L177(lines 176 568) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse6 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse1 .cse4 .cse2) (and .cse5 .cse1 .cse2) (and .cse6 .cse1 .cse2) (and .cse6 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse1) (and .cse0 .cse1 .cse3) (and .cse5 .cse1 .cse3))) [2021-12-14 11:44:38,118 INFO L854 garLoopResultBuilder]: At program point L144(lines 137 581) the Hoare annotation is: (let ((.cse15 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse15 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-14 11:44:38,118 INFO L858 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2021-12-14 11:44:38,118 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 378) no Hoare annotation was computed. [2021-12-14 11:44:38,118 INFO L858 garLoopResultBuilder]: For program point L344-1(lines 344 378) no Hoare annotation was computed. [2021-12-14 11:44:38,118 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 556) no Hoare annotation was computed. [2021-12-14 11:44:38,118 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 567) no Hoare annotation was computed. [2021-12-14 11:44:38,118 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 578) no Hoare annotation was computed. [2021-12-14 11:44:38,119 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 589) no Hoare annotation was computed. [2021-12-14 11:44:38,119 INFO L861 garLoopResultBuilder]: At program point L609(lines 109 610) the Hoare annotation is: true [2021-12-14 11:44:38,119 INFO L858 garLoopResultBuilder]: For program point L543(lines 543 545) no Hoare annotation was computed. [2021-12-14 11:44:38,119 INFO L858 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2021-12-14 11:44:38,119 INFO L858 garLoopResultBuilder]: For program point L411(lines 411 413) no Hoare annotation was computed. [2021-12-14 11:44:38,119 INFO L858 garLoopResultBuilder]: For program point L345(lines 345 375) no Hoare annotation was computed. [2021-12-14 11:44:38,119 INFO L854 garLoopResultBuilder]: At program point L213(lines 209 557) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1) (and .cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))))) [2021-12-14 11:44:38,119 INFO L854 garLoopResultBuilder]: At program point L114(lines 113 589) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse3 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3) (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse3))) [2021-12-14 11:44:38,120 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 555) no Hoare annotation was computed. [2021-12-14 11:44:38,120 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 566) no Hoare annotation was computed. [2021-12-14 11:44:38,120 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 577) no Hoare annotation was computed. [2021-12-14 11:44:38,120 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 588) no Hoare annotation was computed. [2021-12-14 11:44:38,120 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 322) no Hoare annotation was computed. [2021-12-14 11:44:38,120 INFO L858 garLoopResultBuilder]: For program point L315-2(lines 315 322) no Hoare annotation was computed. [2021-12-14 11:44:38,120 INFO L854 garLoopResultBuilder]: At program point L216(lines 215 555) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2021-12-14 11:44:38,120 INFO L854 garLoopResultBuilder]: At program point L183(lines 179 567) the Hoare annotation is: (let ((.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse15 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 .cse15 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse6 .cse7 .cse15 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse15 .cse8 .cse9 .cse17 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-14 11:44:38,121 INFO L854 garLoopResultBuilder]: At program point L150(lines 146 578) the Hoare annotation is: (let ((.cse15 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse17 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse13 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse11 .cse13) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14))) [2021-12-14 11:44:38,121 INFO L858 garLoopResultBuilder]: For program point L614(lines 614 616) no Hoare annotation was computed. [2021-12-14 11:44:38,121 INFO L858 garLoopResultBuilder]: For program point L614-2(lines 614 616) no Hoare annotation was computed. [2021-12-14 11:44:38,121 INFO L858 garLoopResultBuilder]: For program point L515(lines 515 518) no Hoare annotation was computed. [2021-12-14 11:44:38,122 INFO L858 garLoopResultBuilder]: For program point L350(lines 350 373) no Hoare annotation was computed. [2021-12-14 11:44:38,122 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-14 11:44:38,122 INFO L854 garLoopResultBuilder]: At program point L218(lines 217 555) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2021-12-14 11:44:38,123 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 565) no Hoare annotation was computed. [2021-12-14 11:44:38,123 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 576) no Hoare annotation was computed. [2021-12-14 11:44:38,123 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 587) no Hoare annotation was computed. [2021-12-14 11:44:38,123 INFO L858 garLoopResultBuilder]: For program point L285(lines 285 287) no Hoare annotation was computed. [2021-12-14 11:44:38,123 INFO L858 garLoopResultBuilder]: For program point L285-2(lines 219 552) no Hoare annotation was computed. [2021-12-14 11:44:38,123 INFO L858 garLoopResultBuilder]: For program point L451(lines 451 453) no Hoare annotation was computed. [2021-12-14 11:44:38,124 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 321) no Hoare annotation was computed. [2021-12-14 11:44:38,124 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 357) no Hoare annotation was computed. [2021-12-14 11:44:38,124 INFO L858 garLoopResultBuilder]: For program point L353-2(lines 353 357) no Hoare annotation was computed. [2021-12-14 11:44:38,124 INFO L858 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2021-12-14 11:44:38,124 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 564) no Hoare annotation was computed. [2021-12-14 11:44:38,124 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 575) no Hoare annotation was computed. [2021-12-14 11:44:38,124 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 586) no Hoare annotation was computed. [2021-12-14 11:44:38,124 INFO L858 garLoopResultBuilder]: For program point L486(lines 486 488) no Hoare annotation was computed. [2021-12-14 11:44:38,124 INFO L858 garLoopResultBuilder]: For program point L486-2(lines 219 552) no Hoare annotation was computed. [2021-12-14 11:44:38,124 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 419) no Hoare annotation was computed. [2021-12-14 11:44:38,125 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 258) no Hoare annotation was computed. [2021-12-14 11:44:38,125 INFO L854 garLoopResultBuilder]: At program point L222(lines 116 588) the Hoare annotation is: (let ((.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse18 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse19 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse10 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse14 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse15 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse0 .cse17 .cse6 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15) (and .cse16 .cse0 .cse19 .cse6 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) (and .cse16 .cse0 .cse6 .cse13 .cse14) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15))) [2021-12-14 11:44:38,125 INFO L854 garLoopResultBuilder]: At program point L189(lines 185 565) the Hoare annotation is: (let ((.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse15 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 .cse15 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse6 .cse7 .cse15 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse15 .cse8 .cse9 .cse17 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-14 11:44:38,126 INFO L854 garLoopResultBuilder]: At program point L156(lines 152 576) the Hoare annotation is: (let ((.cse15 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse15 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-14 11:44:38,126 INFO L861 garLoopResultBuilder]: At program point L619(lines 22 621) the Hoare annotation is: true [2021-12-14 11:44:38,126 INFO L854 garLoopResultBuilder]: At program point L553(lines 110 608) the Hoare annotation is: (let ((.cse12 (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (let ((.cse11 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (not .cse12)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse10 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse7 .cse9 .cse8) (and .cse4 .cse10) (and (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse11 .cse8) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) (and .cse11 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse12) (and .cse11 .cse10) (and .cse13 .cse14 .cse15) (and .cse4 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse13 .cse6 .cse7 .cse8) (and .cse9 .cse10) (and .cse13 .cse10) (and .cse14 .cse9 .cse15)))) [2021-12-14 11:44:38,126 INFO L858 garLoopResultBuilder]: For program point L454(lines 454 463) no Hoare annotation was computed. [2021-12-14 11:44:38,126 INFO L858 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2021-12-14 11:44:38,126 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-14 11:44:38,126 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 563) no Hoare annotation was computed. [2021-12-14 11:44:38,126 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 574) no Hoare annotation was computed. [2021-12-14 11:44:38,126 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 585) no Hoare annotation was computed. [2021-12-14 11:44:38,127 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2021-12-14 11:44:38,127 INFO L858 garLoopResultBuilder]: For program point L523(lines 523 525) no Hoare annotation was computed. [2021-12-14 11:44:38,127 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-14 11:44:38,127 INFO L858 garLoopResultBuilder]: For program point L590(lines 590 606) no Hoare annotation was computed. [2021-12-14 11:44:38,127 INFO L854 garLoopResultBuilder]: At program point L524(lines 83 620) the Hoare annotation is: false [2021-12-14 11:44:38,127 INFO L858 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2021-12-14 11:44:38,127 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2021-12-14 11:44:38,127 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 562) no Hoare annotation was computed. [2021-12-14 11:44:38,127 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 573) no Hoare annotation was computed. [2021-12-14 11:44:38,127 INFO L858 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2021-12-14 11:44:38,128 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 584) no Hoare annotation was computed. [2021-12-14 11:44:38,128 INFO L858 garLoopResultBuilder]: For program point L591(lines 591 605) no Hoare annotation was computed. [2021-12-14 11:44:38,128 INFO L858 garLoopResultBuilder]: For program point L492(lines 492 496) no Hoare annotation was computed. [2021-12-14 11:44:38,128 INFO L858 garLoopResultBuilder]: For program point L492-2(lines 492 496) no Hoare annotation was computed. [2021-12-14 11:44:38,128 INFO L854 garLoopResultBuilder]: At program point L195(lines 191 563) the Hoare annotation is: (let ((.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse15 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 .cse15 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse6 .cse7 .cse15 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse15 .cse8 .cse9 .cse17 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-14 11:44:38,128 INFO L854 garLoopResultBuilder]: At program point L162(lines 158 574) the Hoare annotation is: (let ((.cse15 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse15 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-14 11:44:38,128 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2021-12-14 11:44:38,128 INFO L858 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2021-12-14 11:44:38,129 INFO L858 garLoopResultBuilder]: For program point L592(lines 592 597) no Hoare annotation was computed. [2021-12-14 11:44:38,129 INFO L858 garLoopResultBuilder]: For program point L526(lines 526 528) no Hoare annotation was computed. [2021-12-14 11:44:38,129 INFO L858 garLoopResultBuilder]: For program point L592-2(lines 591 605) no Hoare annotation was computed. [2021-12-14 11:44:38,129 INFO L858 garLoopResultBuilder]: For program point L361(lines 361 369) no Hoare annotation was computed. [2021-12-14 11:44:38,129 INFO L854 garLoopResultBuilder]: At program point L362(lines 338 380) the Hoare annotation is: (let ((.cse15 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse15 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-14 11:44:38,129 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 561) no Hoare annotation was computed. [2021-12-14 11:44:38,129 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 572) no Hoare annotation was computed. [2021-12-14 11:44:38,129 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 583) no Hoare annotation was computed. [2021-12-14 11:44:38,129 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-14 11:44:38,130 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 618) no Hoare annotation was computed. [2021-12-14 11:44:38,130 INFO L858 garLoopResultBuilder]: For program point L594(lines 594 596) no Hoare annotation was computed. [2021-12-14 11:44:38,130 INFO L858 garLoopResultBuilder]: For program point L429(lines 429 431) no Hoare annotation was computed. [2021-12-14 11:44:38,130 INFO L854 garLoopResultBuilder]: At program point L396(lines 387 419) the Hoare annotation is: (let ((.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse14 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse13 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse15))) [2021-12-14 11:44:38,130 INFO L854 garLoopResultBuilder]: At program point L132(lines 128 584) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse17 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse10 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse15 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13))) [2021-12-14 11:44:38,130 INFO L858 garLoopResultBuilder]: For program point L364(lines 364 366) no Hoare annotation was computed. [2021-12-14 11:44:38,130 INFO L858 garLoopResultBuilder]: For program point L298(lines 298 300) no Hoare annotation was computed. [2021-12-14 11:44:38,131 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2021-12-14 11:44:38,131 INFO L858 garLoopResultBuilder]: For program point L298-2(lines 219 552) no Hoare annotation was computed. [2021-12-14 11:44:38,131 INFO L858 garLoopResultBuilder]: For program point L530(lines 530 534) no Hoare annotation was computed. [2021-12-14 11:44:38,131 INFO L858 garLoopResultBuilder]: For program point L530-2(lines 530 534) no Hoare annotation was computed. [2021-12-14 11:44:38,131 INFO L858 garLoopResultBuilder]: For program point L332(lines 332 336) no Hoare annotation was computed. [2021-12-14 11:44:38,131 INFO L858 garLoopResultBuilder]: For program point L332-2(lines 219 552) no Hoare annotation was computed. [2021-12-14 11:44:38,131 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 560) no Hoare annotation was computed. [2021-12-14 11:44:38,131 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 571) no Hoare annotation was computed. [2021-12-14 11:44:38,131 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 582) no Hoare annotation was computed. [2021-12-14 11:44:38,131 INFO L858 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2021-12-14 11:44:38,132 INFO L858 garLoopResultBuilder]: For program point L101-1(lines 83 620) no Hoare annotation was computed. [2021-12-14 11:44:38,135 INFO L732 BasicCegarLoop]: Path program 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] [2021-12-14 11:44:38,136 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 11:44:38,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 11:44:38 BoogieIcfgContainer [2021-12-14 11:44:38,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 11:44:38,200 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 11:44:38,201 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 11:44:38,201 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 11:44:38,201 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:44:20" (3/4) ... [2021-12-14 11:44:38,203 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-14 11:44:38,224 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-12-14 11:44:38,227 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-14 11:44:38,228 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-14 11:44:38,229 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-14 11:44:38,306 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 11:44:38,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 11:44:38,307 INFO L158 Benchmark]: Toolchain (without parser) took 18405.63ms. Allocated memory was 140.5MB in the beginning and 398.5MB in the end (delta: 257.9MB). Free memory was 104.5MB in the beginning and 288.6MB in the end (delta: -184.2MB). Peak memory consumption was 73.9MB. Max. memory is 16.1GB. [2021-12-14 11:44:38,307 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 79.7MB. Free memory was 35.5MB in the beginning and 35.5MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 11:44:38,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.49ms. Allocated memory is still 140.5MB. Free memory was 104.2MB in the beginning and 107.6MB in the end (delta: -3.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 11:44:38,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.95ms. Allocated memory is still 140.5MB. Free memory was 107.6MB in the beginning and 104.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 11:44:38,309 INFO L158 Benchmark]: Boogie Preprocessor took 42.65ms. Allocated memory is still 140.5MB. Free memory was 104.7MB in the beginning and 102.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 11:44:38,310 INFO L158 Benchmark]: RCFGBuilder took 433.17ms. Allocated memory is still 140.5MB. Free memory was 102.6MB in the beginning and 73.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-12-14 11:44:38,313 INFO L158 Benchmark]: TraceAbstraction took 17503.82ms. Allocated memory was 140.5MB in the beginning and 398.5MB in the end (delta: 257.9MB). Free memory was 72.7MB in the beginning and 305.6MB in the end (delta: -232.8MB). Peak memory consumption was 211.7MB. Max. memory is 16.1GB. [2021-12-14 11:44:38,314 INFO L158 Benchmark]: Witness Printer took 105.82ms. Allocated memory is still 398.5MB. Free memory was 305.6MB in the beginning and 288.6MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-14 11:44:38,316 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.19ms. Allocated memory is still 79.7MB. Free memory was 35.5MB in the beginning and 35.5MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.49ms. Allocated memory is still 140.5MB. Free memory was 104.2MB in the beginning and 107.6MB in the end (delta: -3.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.95ms. Allocated memory is still 140.5MB. Free memory was 107.6MB in the beginning and 104.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.65ms. Allocated memory is still 140.5MB. Free memory was 104.7MB in the beginning and 102.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 433.17ms. Allocated memory is still 140.5MB. Free memory was 102.6MB in the beginning and 73.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17503.82ms. Allocated memory was 140.5MB in the beginning and 398.5MB in the end (delta: 257.9MB). Free memory was 72.7MB in the beginning and 305.6MB in the end (delta: -232.8MB). Peak memory consumption was 211.7MB. Max. memory is 16.1GB. * Witness Printer took 105.82ms. Allocated memory is still 398.5MB. Free memory was 305.6MB in the beginning and 288.6MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 618]: 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, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.4s, OverallIterations: 31, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3836 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3836 mSDsluCounter, 8918 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3048 mSDsCounter, 949 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3494 IncrementalHoareTripleChecker+Invalid, 4443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 949 mSolverCounterUnsat, 5870 mSDtfsCounter, 3494 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2356 GetRequests, 2308 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3496occurred in iteration=21, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 31 MinimizatonAttempts, 1685 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 436 NumberOfFragments, 6497 HoareAnnotationTreeSize, 28 FomulaSimplifications, 18531 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 28 FomulaSimplificationsInter, 40197 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 7610 NumberOfCodeBlocks, 7610 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 8546 ConstructedInterpolants, 0 QuantifiedInterpolants, 11344 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2061 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 36 InterpolantComputations, 29 PerfectInterpolantSequences, 31311/31533 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: 622]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state)) && s__state <= 8672 - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) && s__state <= 8672) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8480)) && s__state <= 8672) || (((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && s__state <= 8672)) || (2 == blastFlag && !(0 == s__hit))) || ((8672 <= s__state && 3 == blastFlag) && s__state <= 8672)) || s__state <= 3) || ((3 == blastFlag && 3 == s__s3__tmp__next_state___0) && 8448 == s__state)) || (3 == blastFlag && !(0 == s__hit))) || ((blastFlag == 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && s__state <= 8672)) || (blastFlag == 0 && !(0 == s__hit))) || (blastFlag == 1 && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8480)) && s__state <= 8672) || (((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && s__state <= 8672)) || (2 == blastFlag && !(0 == s__hit))) || ((8672 <= s__state && 3 == blastFlag) && s__state <= 8672)) || s__state <= 3) || ((3 == blastFlag && 3 == s__s3__tmp__next_state___0) && 8448 == s__state)) || (3 == blastFlag && !(0 == s__hit))) || ((blastFlag == 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && s__state <= 8672)) || (blastFlag == 0 && !(0 == s__hit))) || (blastFlag == 1 && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) || ((((8672 <= s__state && !(8673 == s__state)) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit))) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((8672 <= s__state && !(8673 == s__state)) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((8672 <= s__state && !(8673 == s__state)) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((8672 <= s__state && !(8673 == s__state)) && 3 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit)) || ((((8672 <= s__state && !(8673 == s__state)) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit))) || ((((8672 <= s__state && !(8673 == s__state)) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || ((((8672 <= s__state && !(8673 == s__state)) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((blastFlag == 1 && 8448 == s__state) && !(0 == s__hit)) || ((8448 == s__state && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((8448 == s__state && blastFlag == 0) && !(0 == s__hit))) || ((2 == blastFlag && 8448 == s__state) && !(0 == s__hit))) || ((3 == blastFlag && 8448 == s__state) && !(0 == s__hit))) || ((3 == blastFlag && 3 == s__s3__tmp__next_state___0) && 8448 == s__state)) || ((blastFlag == 1 && 8448 == s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((2 == blastFlag && 8448 == s__state) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((((8672 <= s__state && blastFlag == 1) && !(12292 == s__state)) || ((8672 <= s__state && !(12292 == s__state)) && blastFlag == 0)) || ((8672 <= s__state && 3 == blastFlag) && !(12292 == s__state))) || (((8672 <= s__state && 2 == blastFlag) && !(12292 == s__state)) && !(0 == s__hit)) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && s__state < 8576) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && s__state < 8576) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && s__state <= 8672) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && s__state <= 8672)) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && s__state <= 8672)) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) RESULT: Ultimate proved your program to be correct! [2021-12-14 11:44:38,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE