./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e 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/bitvector/s3_srvr_1a.BV.c.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 a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 05:44:34,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 05:44:34,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 05:44:34,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 05:44:34,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 05:44:34,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 05:44:34,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 05:44:34,158 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 05:44:34,159 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 05:44:34,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 05:44:34,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 05:44:34,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 05:44:34,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 05:44:34,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 05:44:34,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 05:44:34,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 05:44:34,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 05:44:34,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 05:44:34,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 05:44:34,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 05:44:34,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 05:44:34,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 05:44:34,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 05:44:34,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 05:44:34,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 05:44:34,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 05:44:34,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 05:44:34,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 05:44:34,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 05:44:34,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 05:44:34,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 05:44:34,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 05:44:34,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 05:44:34,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 05:44:34,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 05:44:34,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 05:44:34,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 05:44:34,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 05:44:34,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 05:44:34,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 05:44:34,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 05:44:34,204 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 05:44:34,242 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 05:44:34,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 05:44:34,243 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 05:44:34,243 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 05:44:34,244 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 05:44:34,244 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 05:44:34,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 05:44:34,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 05:44:34,245 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 05:44:34,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 05:44:34,246 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 05:44:34,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 05:44:34,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 05:44:34,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 05:44:34,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 05:44:34,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 05:44:34,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 05:44:34,247 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 05:44:34,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 05:44:34,248 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 05:44:34,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 05:44:34,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 05:44:34,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 05:44:34,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 05:44:34,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:44:34,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 05:44:34,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 05:44:34,249 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 05:44:34,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 05:44:34,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 05:44:34,250 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 05:44:34,250 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 05:44:34,250 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 05:44:34,250 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 05:44:34,251 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 05:44:34,251 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f [2023-02-17 05:44:34,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 05:44:34,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 05:44:34,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 05:44:34,501 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 05:44:34,501 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 05:44:34,502 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2023-02-17 05:44:35,592 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 05:44:35,790 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 05:44:35,790 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2023-02-17 05:44:35,801 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5097058c6/74e0157b81ce48aca8e72ad90841c3fd/FLAGf16c66ce2 [2023-02-17 05:44:35,823 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5097058c6/74e0157b81ce48aca8e72ad90841c3fd [2023-02-17 05:44:35,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 05:44:35,828 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 05:44:35,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 05:44:35,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 05:44:35,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 05:44:35,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:44:35" (1/1) ... [2023-02-17 05:44:35,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@735413cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:44:35, skipping insertion in model container [2023-02-17 05:44:35,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:44:35" (1/1) ... [2023-02-17 05:44:35,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 05:44:35,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 05:44:36,043 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2023-02-17 05:44:36,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:44:36,069 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 05:44:36,133 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2023-02-17 05:44:36,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:44:36,148 INFO L208 MainTranslator]: Completed translation [2023-02-17 05:44:36,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:44:36 WrapperNode [2023-02-17 05:44:36,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 05:44:36,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 05:44:36,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 05:44:36,159 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 05:44:36,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:44:36" (1/1) ... [2023-02-17 05:44:36,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:44:36" (1/1) ... [2023-02-17 05:44:36,213 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 521 [2023-02-17 05:44:36,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 05:44:36,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 05:44:36,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 05:44:36,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 05:44:36,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:44:36" (1/1) ... [2023-02-17 05:44:36,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:44:36" (1/1) ... [2023-02-17 05:44:36,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:44:36" (1/1) ... [2023-02-17 05:44:36,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:44:36" (1/1) ... [2023-02-17 05:44:36,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:44:36" (1/1) ... [2023-02-17 05:44:36,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:44:36" (1/1) ... [2023-02-17 05:44:36,249 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:44:36" (1/1) ... [2023-02-17 05:44:36,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:44:36" (1/1) ... [2023-02-17 05:44:36,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 05:44:36,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 05:44:36,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 05:44:36,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 05:44:36,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:44:36" (1/1) ... [2023-02-17 05:44:36,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:44:36,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:44:36,294 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) [2023-02-17 05:44:36,299 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 [2023-02-17 05:44:36,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 05:44:36,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 05:44:36,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 05:44:36,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 05:44:36,444 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 05:44:36,448 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 05:44:36,472 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-02-17 05:44:36,942 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2023-02-17 05:44:36,943 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2023-02-17 05:44:36,943 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 05:44:36,949 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 05:44:36,950 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 05:44:36,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:44:36 BoogieIcfgContainer [2023-02-17 05:44:36,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 05:44:36,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 05:44:36,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 05:44:36,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 05:44:36,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 05:44:35" (1/3) ... [2023-02-17 05:44:36,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7f7a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:44:36, skipping insertion in model container [2023-02-17 05:44:36,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:44:36" (2/3) ... [2023-02-17 05:44:36,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7f7a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:44:36, skipping insertion in model container [2023-02-17 05:44:36,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:44:36" (3/3) ... [2023-02-17 05:44:36,971 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2023-02-17 05:44:36,985 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 05:44:36,985 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 05:44:37,026 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 05:44:37,031 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4df0a154, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 05:44:37,031 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 05:44:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 138 states have (on average 1.7318840579710144) internal successors, (239), 139 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 05:44:37,042 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:37,042 INFO L195 NwaCegarLoop]: 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] [2023-02-17 05:44:37,043 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:37,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:37,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1632000041, now seen corresponding path program 1 times [2023-02-17 05:44:37,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:37,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245231912] [2023-02-17 05:44:37,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:37,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:44:37,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:37,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245231912] [2023-02-17 05:44:37,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245231912] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:44:37,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:44:37,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:44:37,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428926601] [2023-02-17 05:44:37,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:44:37,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:44:37,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:37,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:44:37,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:44:37,452 INFO L87 Difference]: Start difference. First operand has 140 states, 138 states have (on average 1.7318840579710144) internal successors, (239), 139 states have internal predecessors, (239), 0 states have call successors, (0), 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) [2023-02-17 05:44:37,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:37,660 INFO L93 Difference]: Finished difference Result 301 states and 513 transitions. [2023-02-17 05:44:37,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:44:37,663 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 [2023-02-17 05:44:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:37,671 INFO L225 Difference]: With dead ends: 301 [2023-02-17 05:44:37,672 INFO L226 Difference]: Without dead ends: 147 [2023-02-17 05:44:37,675 INFO L412 NwaCegarLoop]: 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 [2023-02-17 05:44:37,678 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 32 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:37,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 364 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 05:44:37,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-02-17 05:44:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2023-02-17 05:44:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 218 transitions. [2023-02-17 05:44:37,714 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 218 transitions. Word has length 44 [2023-02-17 05:44:37,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:37,715 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 218 transitions. [2023-02-17 05:44:37,715 INFO L496 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) [2023-02-17 05:44:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 218 transitions. [2023-02-17 05:44:37,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-17 05:44:37,716 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:37,717 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:44:37,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 05:44:37,717 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:37,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:37,718 INFO L85 PathProgramCache]: Analyzing trace with hash -193922812, now seen corresponding path program 1 times [2023-02-17 05:44:37,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:37,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594521475] [2023-02-17 05:44:37,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:37,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:37,799 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:44:37,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:37,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594521475] [2023-02-17 05:44:37,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594521475] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:44:37,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:44:37,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:44:37,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046899536] [2023-02-17 05:44:37,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:44:37,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:44:37,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:37,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:44:37,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:44:37,803 INFO L87 Difference]: Start difference. First operand 144 states and 218 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) [2023-02-17 05:44:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:37,966 INFO L93 Difference]: Finished difference Result 305 states and 468 transitions. [2023-02-17 05:44:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:44:37,966 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 60 [2023-02-17 05:44:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:37,968 INFO L225 Difference]: With dead ends: 305 [2023-02-17 05:44:37,980 INFO L226 Difference]: Without dead ends: 169 [2023-02-17 05:44:37,982 INFO L412 NwaCegarLoop]: 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 [2023-02-17 05:44:37,983 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 14 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:37,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 290 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:44:37,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-17 05:44:37,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2023-02-17 05:44:38,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4878048780487805) internal successors, (244), 164 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:38,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2023-02-17 05:44:38,011 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 60 [2023-02-17 05:44:38,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:38,011 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2023-02-17 05:44:38,011 INFO L496 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) [2023-02-17 05:44:38,012 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2023-02-17 05:44:38,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-17 05:44:38,014 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:38,014 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:44:38,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 05:44:38,014 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:38,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:38,015 INFO L85 PathProgramCache]: Analyzing trace with hash -751274889, now seen corresponding path program 1 times [2023-02-17 05:44:38,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:38,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624119976] [2023-02-17 05:44:38,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:38,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-17 05:44:38,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:38,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624119976] [2023-02-17 05:44:38,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624119976] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:44:38,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:44:38,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:44:38,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585621299] [2023-02-17 05:44:38,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:44:38,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:44:38,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:38,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:44:38,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:44:38,136 INFO L87 Difference]: Start difference. First operand 165 states and 244 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) [2023-02-17 05:44:38,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:38,292 INFO L93 Difference]: Finished difference Result 368 states and 559 transitions. [2023-02-17 05:44:38,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:44:38,292 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 81 [2023-02-17 05:44:38,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:38,294 INFO L225 Difference]: With dead ends: 368 [2023-02-17 05:44:38,294 INFO L226 Difference]: Without dead ends: 211 [2023-02-17 05:44:38,295 INFO L412 NwaCegarLoop]: 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 [2023-02-17 05:44:38,296 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 15 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:38,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 287 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:44:38,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-02-17 05:44:38,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2023-02-17 05:44:38,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.412621359223301) internal successors, (291), 206 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:38,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 291 transitions. [2023-02-17 05:44:38,311 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 291 transitions. Word has length 81 [2023-02-17 05:44:38,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:38,312 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 291 transitions. [2023-02-17 05:44:38,312 INFO L496 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) [2023-02-17 05:44:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 291 transitions. [2023-02-17 05:44:38,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-17 05:44:38,315 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:38,315 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:44:38,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 05:44:38,316 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:38,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:38,316 INFO L85 PathProgramCache]: Analyzing trace with hash -503128395, now seen corresponding path program 1 times [2023-02-17 05:44:38,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:38,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110193347] [2023-02-17 05:44:38,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:38,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-17 05:44:38,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:38,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110193347] [2023-02-17 05:44:38,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110193347] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:44:38,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:44:38,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:44:38,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458744740] [2023-02-17 05:44:38,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:44:38,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:44:38,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:38,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:44:38,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:44:38,384 INFO L87 Difference]: Start difference. First operand 207 states and 291 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) [2023-02-17 05:44:38,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:38,495 INFO L93 Difference]: Finished difference Result 432 states and 616 transitions. [2023-02-17 05:44:38,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:44:38,497 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 81 [2023-02-17 05:44:38,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:38,500 INFO L225 Difference]: With dead ends: 432 [2023-02-17 05:44:38,500 INFO L226 Difference]: Without dead ends: 233 [2023-02-17 05:44:38,504 INFO L412 NwaCegarLoop]: 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 [2023-02-17 05:44:38,514 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:38,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 306 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:44:38,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-02-17 05:44:38,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2023-02-17 05:44:38,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.3930131004366813) internal successors, (319), 229 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 319 transitions. [2023-02-17 05:44:38,529 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 319 transitions. Word has length 81 [2023-02-17 05:44:38,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:38,529 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 319 transitions. [2023-02-17 05:44:38,530 INFO L496 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) [2023-02-17 05:44:38,530 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 319 transitions. [2023-02-17 05:44:38,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-02-17 05:44:38,533 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:38,534 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:44:38,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 05:44:38,534 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:38,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:38,535 INFO L85 PathProgramCache]: Analyzing trace with hash 356294499, now seen corresponding path program 1 times [2023-02-17 05:44:38,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:38,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177894844] [2023-02-17 05:44:38,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:38,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-02-17 05:44:38,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:38,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177894844] [2023-02-17 05:44:38,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177894844] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:44:38,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:44:38,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:44:38,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452908762] [2023-02-17 05:44:38,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:44:38,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:44:38,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:38,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:44:38,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:44:38,621 INFO L87 Difference]: Start difference. First operand 230 states and 319 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) [2023-02-17 05:44:38,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:38,724 INFO L93 Difference]: Finished difference Result 489 states and 692 transitions. [2023-02-17 05:44:38,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:44:38,724 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 [2023-02-17 05:44:38,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:38,726 INFO L225 Difference]: With dead ends: 489 [2023-02-17 05:44:38,726 INFO L226 Difference]: Without dead ends: 267 [2023-02-17 05:44:38,727 INFO L412 NwaCegarLoop]: 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 [2023-02-17 05:44:38,728 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 29 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:38,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 305 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:44:38,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-02-17 05:44:38,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 255. [2023-02-17 05:44:38,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.374015748031496) internal successors, (349), 254 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 349 transitions. [2023-02-17 05:44:38,738 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 349 transitions. Word has length 101 [2023-02-17 05:44:38,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:38,738 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 349 transitions. [2023-02-17 05:44:38,739 INFO L496 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) [2023-02-17 05:44:38,739 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 349 transitions. [2023-02-17 05:44:38,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-17 05:44:38,741 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:38,741 INFO L195 NwaCegarLoop]: 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] [2023-02-17 05:44:38,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 05:44:38,742 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:38,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:38,742 INFO L85 PathProgramCache]: Analyzing trace with hash 112174862, now seen corresponding path program 1 times [2023-02-17 05:44:38,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:38,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349341226] [2023-02-17 05:44:38,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:38,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:38,914 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-02-17 05:44:38,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:38,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349341226] [2023-02-17 05:44:38,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349341226] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:44:38,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:44:38,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:44:38,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402686432] [2023-02-17 05:44:38,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:44:38,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:44:38,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:38,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:44:38,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:44:38,921 INFO L87 Difference]: Start difference. First operand 255 states and 349 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) [2023-02-17 05:44:38,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:38,953 INFO L93 Difference]: Finished difference Result 743 states and 1017 transitions. [2023-02-17 05:44:38,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:44:38,954 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 [2023-02-17 05:44:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:38,958 INFO L225 Difference]: With dead ends: 743 [2023-02-17 05:44:38,958 INFO L226 Difference]: Without dead ends: 496 [2023-02-17 05:44:38,959 INFO L412 NwaCegarLoop]: 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 [2023-02-17 05:44:38,960 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 131 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:38,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 456 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:44:38,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2023-02-17 05:44:38,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2023-02-17 05:44:38,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 1.3616161616161617) internal successors, (674), 495 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 674 transitions. [2023-02-17 05:44:38,974 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 674 transitions. Word has length 121 [2023-02-17 05:44:38,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:38,974 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 674 transitions. [2023-02-17 05:44:38,975 INFO L496 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) [2023-02-17 05:44:38,975 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 674 transitions. [2023-02-17 05:44:38,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-17 05:44:38,976 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:38,976 INFO L195 NwaCegarLoop]: 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] [2023-02-17 05:44:38,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-17 05:44:38,977 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:38,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:38,978 INFO L85 PathProgramCache]: Analyzing trace with hash -785218416, now seen corresponding path program 1 times [2023-02-17 05:44:38,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:38,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60797160] [2023-02-17 05:44:38,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:38,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:39,041 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-17 05:44:39,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:39,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60797160] [2023-02-17 05:44:39,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60797160] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:44:39,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:44:39,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:44:39,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973815160] [2023-02-17 05:44:39,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:44:39,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:44:39,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:39,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:44:39,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:44:39,044 INFO L87 Difference]: Start difference. First operand 496 states and 674 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) [2023-02-17 05:44:39,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:39,081 INFO L93 Difference]: Finished difference Result 1227 states and 1670 transitions. [2023-02-17 05:44:39,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:44:39,082 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 [2023-02-17 05:44:39,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:39,085 INFO L225 Difference]: With dead ends: 1227 [2023-02-17 05:44:39,086 INFO L226 Difference]: Without dead ends: 739 [2023-02-17 05:44:39,087 INFO L412 NwaCegarLoop]: 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 [2023-02-17 05:44:39,088 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 133 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:39,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 492 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:44:39,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2023-02-17 05:44:39,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2023-02-17 05:44:39,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 1.3577235772357723) internal successors, (1002), 738 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:39,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1002 transitions. [2023-02-17 05:44:39,115 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1002 transitions. Word has length 121 [2023-02-17 05:44:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:39,115 INFO L495 AbstractCegarLoop]: Abstraction has 739 states and 1002 transitions. [2023-02-17 05:44:39,115 INFO L496 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) [2023-02-17 05:44:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1002 transitions. [2023-02-17 05:44:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-17 05:44:39,119 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:39,120 INFO L195 NwaCegarLoop]: 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] [2023-02-17 05:44:39,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 05:44:39,120 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:39,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:39,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1630617934, now seen corresponding path program 1 times [2023-02-17 05:44:39,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:39,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305919083] [2023-02-17 05:44:39,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:39,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-02-17 05:44:39,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:39,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305919083] [2023-02-17 05:44:39,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305919083] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:44:39,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:44:39,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:44:39,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068004872] [2023-02-17 05:44:39,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:44:39,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:44:39,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:39,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:44:39,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:44:39,190 INFO L87 Difference]: Start difference. First operand 739 states and 1002 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) [2023-02-17 05:44:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:39,214 INFO L93 Difference]: Finished difference Result 1494 states and 2022 transitions. [2023-02-17 05:44:39,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:44:39,215 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 [2023-02-17 05:44:39,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:39,218 INFO L225 Difference]: With dead ends: 1494 [2023-02-17 05:44:39,218 INFO L226 Difference]: Without dead ends: 763 [2023-02-17 05:44:39,220 INFO L412 NwaCegarLoop]: 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 [2023-02-17 05:44:39,222 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 10 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:39,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 386 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:44:39,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2023-02-17 05:44:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 763. [2023-02-17 05:44:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 762 states have (on average 1.353018372703412) internal successors, (1031), 762 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1031 transitions. [2023-02-17 05:44:39,244 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1031 transitions. Word has length 121 [2023-02-17 05:44:39,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:39,244 INFO L495 AbstractCegarLoop]: Abstraction has 763 states and 1031 transitions. [2023-02-17 05:44:39,245 INFO L496 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) [2023-02-17 05:44:39,249 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1031 transitions. [2023-02-17 05:44:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-17 05:44:39,251 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:39,252 INFO L195 NwaCegarLoop]: 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] [2023-02-17 05:44:39,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-17 05:44:39,252 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:39,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:39,253 INFO L85 PathProgramCache]: Analyzing trace with hash -402776112, now seen corresponding path program 1 times [2023-02-17 05:44:39,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:39,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088564916] [2023-02-17 05:44:39,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:39,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:39,306 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-02-17 05:44:39,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:39,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088564916] [2023-02-17 05:44:39,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088564916] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:44:39,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:44:39,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:44:39,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071537749] [2023-02-17 05:44:39,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:44:39,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:44:39,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:39,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:44:39,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:44:39,309 INFO L87 Difference]: Start difference. First operand 763 states and 1031 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) [2023-02-17 05:44:39,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:39,333 INFO L93 Difference]: Finished difference Result 1531 states and 2064 transitions. [2023-02-17 05:44:39,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:44:39,334 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 [2023-02-17 05:44:39,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:39,338 INFO L225 Difference]: With dead ends: 1531 [2023-02-17 05:44:39,338 INFO L226 Difference]: Without dead ends: 776 [2023-02-17 05:44:39,339 INFO L412 NwaCegarLoop]: 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 [2023-02-17 05:44:39,341 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 6 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:39,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 366 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:44:39,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-02-17 05:44:39,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2023-02-17 05:44:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 775 states have (on average 1.3470967741935485) internal successors, (1044), 775 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:39,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1044 transitions. [2023-02-17 05:44:39,358 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1044 transitions. Word has length 121 [2023-02-17 05:44:39,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:39,359 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 1044 transitions. [2023-02-17 05:44:39,359 INFO L496 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) [2023-02-17 05:44:39,359 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1044 transitions. [2023-02-17 05:44:39,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-02-17 05:44:39,363 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:39,363 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:44:39,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-17 05:44:39,364 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:39,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:39,365 INFO L85 PathProgramCache]: Analyzing trace with hash -541828422, now seen corresponding path program 1 times [2023-02-17 05:44:39,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:39,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816608645] [2023-02-17 05:44:39,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:39,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-02-17 05:44:39,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:39,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816608645] [2023-02-17 05:44:39,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816608645] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:44:39,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:44:39,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:44:39,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834645366] [2023-02-17 05:44:39,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:44:39,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:44:39,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:39,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:44:39,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:44:39,436 INFO L87 Difference]: Start difference. First operand 776 states and 1044 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:39,569 INFO L93 Difference]: Finished difference Result 1644 states and 2261 transitions. [2023-02-17 05:44:39,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:44:39,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 159 [2023-02-17 05:44:39,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:39,572 INFO L225 Difference]: With dead ends: 1644 [2023-02-17 05:44:39,573 INFO L226 Difference]: Without dead ends: 889 [2023-02-17 05:44:39,574 INFO L412 NwaCegarLoop]: 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 [2023-02-17 05:44:39,574 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 36 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:39,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 288 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:44:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2023-02-17 05:44:39,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 858. [2023-02-17 05:44:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 857 states have (on average 1.3325554259043173) internal successors, (1142), 857 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1142 transitions. [2023-02-17 05:44:39,593 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1142 transitions. Word has length 159 [2023-02-17 05:44:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:39,594 INFO L495 AbstractCegarLoop]: Abstraction has 858 states and 1142 transitions. [2023-02-17 05:44:39,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1142 transitions. [2023-02-17 05:44:39,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-02-17 05:44:39,596 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:39,597 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:44:39,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-17 05:44:39,597 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:39,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:39,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1280398319, now seen corresponding path program 1 times [2023-02-17 05:44:39,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:39,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426823247] [2023-02-17 05:44:39,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:39,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2023-02-17 05:44:39,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:39,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426823247] [2023-02-17 05:44:39,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426823247] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:44:39,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:44:39,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:44:39,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352511978] [2023-02-17 05:44:39,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:44:39,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:44:39,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:39,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:44:39,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:44:39,694 INFO L87 Difference]: Start difference. First operand 858 states and 1142 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:39,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:39,830 INFO L93 Difference]: Finished difference Result 1865 states and 2553 transitions. [2023-02-17 05:44:39,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:44:39,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 172 [2023-02-17 05:44:39,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:39,838 INFO L225 Difference]: With dead ends: 1865 [2023-02-17 05:44:39,839 INFO L226 Difference]: Without dead ends: 1025 [2023-02-17 05:44:39,840 INFO L412 NwaCegarLoop]: 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 [2023-02-17 05:44:39,841 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 159 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:39,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 156 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:44:39,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2023-02-17 05:44:39,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1008. [2023-02-17 05:44:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 1007 states have (on average 1.384309831181728) internal successors, (1394), 1007 states have internal predecessors, (1394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:39,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1394 transitions. [2023-02-17 05:44:39,866 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1394 transitions. Word has length 172 [2023-02-17 05:44:39,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:39,866 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1394 transitions. [2023-02-17 05:44:39,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1394 transitions. [2023-02-17 05:44:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2023-02-17 05:44:39,870 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:39,870 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:44:39,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-17 05:44:39,870 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:39,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:39,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2093330807, now seen corresponding path program 1 times [2023-02-17 05:44:39,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:39,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517063296] [2023-02-17 05:44:39,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:39,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:39,934 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2023-02-17 05:44:39,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:39,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517063296] [2023-02-17 05:44:39,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517063296] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:44:39,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:44:39,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:44:39,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659626535] [2023-02-17 05:44:39,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:44:39,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:44:39,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:39,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:44:39,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:44:39,937 INFO L87 Difference]: Start difference. First operand 1008 states and 1394 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:40,056 INFO L93 Difference]: Finished difference Result 2088 states and 2928 transitions. [2023-02-17 05:44:40,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:44:40,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2023-02-17 05:44:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:40,061 INFO L225 Difference]: With dead ends: 2088 [2023-02-17 05:44:40,061 INFO L226 Difference]: Without dead ends: 1101 [2023-02-17 05:44:40,064 INFO L412 NwaCegarLoop]: 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 [2023-02-17 05:44:40,065 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 14 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:40,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 299 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:44:40,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2023-02-17 05:44:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1101. [2023-02-17 05:44:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1100 states have (on average 1.3654545454545455) internal successors, (1502), 1100 states have internal predecessors, (1502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1502 transitions. [2023-02-17 05:44:40,095 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1502 transitions. Word has length 202 [2023-02-17 05:44:40,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:40,096 INFO L495 AbstractCegarLoop]: Abstraction has 1101 states and 1502 transitions. [2023-02-17 05:44:40,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1502 transitions. [2023-02-17 05:44:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-02-17 05:44:40,100 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:40,100 INFO L195 NwaCegarLoop]: 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:44:40,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-17 05:44:40,100 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:40,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:40,101 INFO L85 PathProgramCache]: Analyzing trace with hash -890289059, now seen corresponding path program 1 times [2023-02-17 05:44:40,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:40,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74342163] [2023-02-17 05:44:40,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:40,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2023-02-17 05:44:40,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:40,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74342163] [2023-02-17 05:44:40,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74342163] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:44:40,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:44:40,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:44:40,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909777541] [2023-02-17 05:44:40,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:44:40,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:44:40,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:40,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:44:40,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:44:40,208 INFO L87 Difference]: Start difference. First operand 1101 states and 1502 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:40,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:40,344 INFO L93 Difference]: Finished difference Result 2307 states and 3207 transitions. [2023-02-17 05:44:40,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:44:40,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 231 [2023-02-17 05:44:40,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:40,349 INFO L225 Difference]: With dead ends: 2307 [2023-02-17 05:44:40,349 INFO L226 Difference]: Without dead ends: 1096 [2023-02-17 05:44:40,351 INFO L412 NwaCegarLoop]: 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 [2023-02-17 05:44:40,352 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 9 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:40,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 306 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:44:40,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2023-02-17 05:44:40,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1096. [2023-02-17 05:44:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1095 states have (on average 1.3598173515981735) internal successors, (1489), 1095 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1489 transitions. [2023-02-17 05:44:40,381 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1489 transitions. Word has length 231 [2023-02-17 05:44:40,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:40,381 INFO L495 AbstractCegarLoop]: Abstraction has 1096 states and 1489 transitions. [2023-02-17 05:44:40,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1489 transitions. [2023-02-17 05:44:40,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2023-02-17 05:44:40,385 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:40,386 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:44:40,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-17 05:44:40,386 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:40,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:40,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1829254476, now seen corresponding path program 1 times [2023-02-17 05:44:40,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:40,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085132416] [2023-02-17 05:44:40,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:40,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:40,495 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2023-02-17 05:44:40,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:40,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085132416] [2023-02-17 05:44:40,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085132416] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:44:40,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:44:40,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:44:40,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031247187] [2023-02-17 05:44:40,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:44:40,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:44:40,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:40,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:44:40,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:44:40,497 INFO L87 Difference]: Start difference. First operand 1096 states and 1489 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:40,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:40,540 INFO L93 Difference]: Finished difference Result 3129 states and 4280 transitions. [2023-02-17 05:44:40,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:44:40,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 271 [2023-02-17 05:44:40,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:40,546 INFO L225 Difference]: With dead ends: 3129 [2023-02-17 05:44:40,547 INFO L226 Difference]: Without dead ends: 1391 [2023-02-17 05:44:40,549 INFO L412 NwaCegarLoop]: 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 [2023-02-17 05:44:40,550 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 117 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:40,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 515 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:44:40,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2023-02-17 05:44:40,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1389. [2023-02-17 05:44:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1388 states have (on average 1.3631123919308357) internal successors, (1892), 1388 states have internal predecessors, (1892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:40,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1892 transitions. [2023-02-17 05:44:40,587 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1892 transitions. Word has length 271 [2023-02-17 05:44:40,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:40,587 INFO L495 AbstractCegarLoop]: Abstraction has 1389 states and 1892 transitions. [2023-02-17 05:44:40,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1892 transitions. [2023-02-17 05:44:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2023-02-17 05:44:40,591 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:40,592 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:44:40,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-17 05:44:40,592 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:40,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:40,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1891635766, now seen corresponding path program 1 times [2023-02-17 05:44:40,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:40,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762859645] [2023-02-17 05:44:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:40,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2023-02-17 05:44:40,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:40,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762859645] [2023-02-17 05:44:40,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762859645] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:44:40,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:44:40,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:44:40,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956213996] [2023-02-17 05:44:40,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:44:40,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:44:40,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:40,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:44:40,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:44:40,677 INFO L87 Difference]: Start difference. First operand 1389 states and 1892 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) [2023-02-17 05:44:40,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:40,794 INFO L93 Difference]: Finished difference Result 2893 states and 3991 transitions. [2023-02-17 05:44:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:44:40,794 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 317 [2023-02-17 05:44:40,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:40,800 INFO L225 Difference]: With dead ends: 2893 [2023-02-17 05:44:40,800 INFO L226 Difference]: Without dead ends: 1525 [2023-02-17 05:44:40,803 INFO L412 NwaCegarLoop]: 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 [2023-02-17 05:44:40,804 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 18 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:40,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 300 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:44:40,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2023-02-17 05:44:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1497. [2023-02-17 05:44:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1496 states have (on average 1.3502673796791445) internal successors, (2020), 1496 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2020 transitions. [2023-02-17 05:44:40,863 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2020 transitions. Word has length 317 [2023-02-17 05:44:40,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:40,863 INFO L495 AbstractCegarLoop]: Abstraction has 1497 states and 2020 transitions. [2023-02-17 05:44:40,864 INFO L496 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) [2023-02-17 05:44:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2020 transitions. [2023-02-17 05:44:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2023-02-17 05:44:40,868 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:40,869 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:44:40,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-17 05:44:40,869 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:40,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:40,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1795423714, now seen corresponding path program 1 times [2023-02-17 05:44:40,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:40,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318361296] [2023-02-17 05:44:40,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:40,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:40,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1151 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2023-02-17 05:44:40,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:40,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318361296] [2023-02-17 05:44:40,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318361296] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:44:40,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:44:40,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:44:40,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396739640] [2023-02-17 05:44:40,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:44:40,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:44:40,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:40,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:44:40,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:44:40,969 INFO L87 Difference]: Start difference. First operand 1497 states and 2020 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:41,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:41,091 INFO L93 Difference]: Finished difference Result 3097 states and 4223 transitions. [2023-02-17 05:44:41,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:44:41,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 340 [2023-02-17 05:44:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:41,097 INFO L225 Difference]: With dead ends: 3097 [2023-02-17 05:44:41,097 INFO L226 Difference]: Without dead ends: 1621 [2023-02-17 05:44:41,099 INFO L412 NwaCegarLoop]: 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 [2023-02-17 05:44:41,099 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:41,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 300 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:44:41,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2023-02-17 05:44:41,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1613. [2023-02-17 05:44:41,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1612 states have (on average 1.337468982630273) internal successors, (2156), 1612 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:41,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2156 transitions. [2023-02-17 05:44:41,142 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2156 transitions. Word has length 340 [2023-02-17 05:44:41,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:41,142 INFO L495 AbstractCegarLoop]: Abstraction has 1613 states and 2156 transitions. [2023-02-17 05:44:41,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:41,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2156 transitions. [2023-02-17 05:44:41,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2023-02-17 05:44:41,147 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:41,148 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:44:41,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-17 05:44:41,148 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:41,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:41,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1520948552, now seen corresponding path program 1 times [2023-02-17 05:44:41,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:41,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283096952] [2023-02-17 05:44:41,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:41,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2023-02-17 05:44:41,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:41,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283096952] [2023-02-17 05:44:41,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283096952] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:44:41,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055196566] [2023-02-17 05:44:41,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:41,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:44:41,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:44:41,305 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) [2023-02-17 05:44:41,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 05:44:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:41,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 05:44:41,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:44:41,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2023-02-17 05:44:41,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:44:41,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2023-02-17 05:44:41,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055196566] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:44:41,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 05:44:41,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-02-17 05:44:41,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994459114] [2023-02-17 05:44:41,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 05:44:41,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 05:44:41,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:41,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 05:44:41,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 05:44:41,569 INFO L87 Difference]: Start difference. First operand 1613 states and 2156 transitions. Second operand has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:41,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:41,964 INFO L93 Difference]: Finished difference Result 3933 states and 5333 transitions. [2023-02-17 05:44:41,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 05:44:41,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 0 states have call successors, (0), 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 373 [2023-02-17 05:44:41,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:41,972 INFO L225 Difference]: With dead ends: 3933 [2023-02-17 05:44:41,973 INFO L226 Difference]: Without dead ends: 2222 [2023-02-17 05:44:41,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-02-17 05:44:41,976 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 911 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:41,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 385 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 05:44:41,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2023-02-17 05:44:42,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 1625. [2023-02-17 05:44:42,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1624 states have (on average 1.3226600985221675) internal successors, (2148), 1624 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:42,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 2148 transitions. [2023-02-17 05:44:42,026 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 2148 transitions. Word has length 373 [2023-02-17 05:44:42,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:42,026 INFO L495 AbstractCegarLoop]: Abstraction has 1625 states and 2148 transitions. [2023-02-17 05:44:42,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2148 transitions. [2023-02-17 05:44:42,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2023-02-17 05:44:42,033 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:42,033 INFO L195 NwaCegarLoop]: 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, 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] [2023-02-17 05:44:42,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 05:44:42,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-17 05:44:42,241 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:42,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:42,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1777333080, now seen corresponding path program 1 times [2023-02-17 05:44:42,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:42,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129427940] [2023-02-17 05:44:42,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:42,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2339 backedges. 1324 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2023-02-17 05:44:42,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:42,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129427940] [2023-02-17 05:44:42,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129427940] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:44:42,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:44:42,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:44:42,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862098957] [2023-02-17 05:44:42,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:44:42,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:44:42,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:42,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:44:42,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:44:42,361 INFO L87 Difference]: Start difference. First operand 1625 states and 2148 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:42,487 INFO L93 Difference]: Finished difference Result 3409 states and 4581 transitions. [2023-02-17 05:44:42,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:44:42,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 473 [2023-02-17 05:44:42,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:42,494 INFO L225 Difference]: With dead ends: 3409 [2023-02-17 05:44:42,494 INFO L226 Difference]: Without dead ends: 1805 [2023-02-17 05:44:42,496 INFO L412 NwaCegarLoop]: 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 [2023-02-17 05:44:42,497 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:42,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 291 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:44:42,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2023-02-17 05:44:42,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1795. [2023-02-17 05:44:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1794 states have (on average 1.306020066889632) internal successors, (2343), 1794 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2343 transitions. [2023-02-17 05:44:42,565 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2343 transitions. Word has length 473 [2023-02-17 05:44:42,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:42,565 INFO L495 AbstractCegarLoop]: Abstraction has 1795 states and 2343 transitions. [2023-02-17 05:44:42,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:42,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2343 transitions. [2023-02-17 05:44:42,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2023-02-17 05:44:42,574 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:42,575 INFO L195 NwaCegarLoop]: 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, 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] [2023-02-17 05:44:42,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-17 05:44:42,575 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:42,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:42,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1857511408, now seen corresponding path program 1 times [2023-02-17 05:44:42,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:42,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593550479] [2023-02-17 05:44:42,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:42,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:42,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3104 backedges. 1761 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2023-02-17 05:44:42,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:42,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593550479] [2023-02-17 05:44:42,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593550479] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:44:42,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:44:42,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:44:42,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910361848] [2023-02-17 05:44:42,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:44:42,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:44:42,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:42,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:44:42,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:44:42,701 INFO L87 Difference]: Start difference. First operand 1795 states and 2343 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:42,830 INFO L93 Difference]: Finished difference Result 3759 states and 4991 transitions. [2023-02-17 05:44:42,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:44:42,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 535 [2023-02-17 05:44:42,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:42,838 INFO L225 Difference]: With dead ends: 3759 [2023-02-17 05:44:42,838 INFO L226 Difference]: Without dead ends: 1985 [2023-02-17 05:44:42,840 INFO L412 NwaCegarLoop]: 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 [2023-02-17 05:44:42,841 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:42,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 291 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:44:42,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2023-02-17 05:44:42,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1975. [2023-02-17 05:44:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1975 states, 1974 states have (on average 1.2907801418439717) internal successors, (2548), 1974 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:42,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 2548 transitions. [2023-02-17 05:44:42,926 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 2548 transitions. Word has length 535 [2023-02-17 05:44:42,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:42,926 INFO L495 AbstractCegarLoop]: Abstraction has 1975 states and 2548 transitions. [2023-02-17 05:44:42,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:42,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2548 transitions. [2023-02-17 05:44:42,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2023-02-17 05:44:42,939 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:42,939 INFO L195 NwaCegarLoop]: 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, 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] [2023-02-17 05:44:42,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-17 05:44:42,940 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:42,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:42,940 INFO L85 PathProgramCache]: Analyzing trace with hash -145524280, now seen corresponding path program 1 times [2023-02-17 05:44:42,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:44:42,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492368017] [2023-02-17 05:44:42,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:42,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:44:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2023-02-17 05:44:43,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:44:43,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492368017] [2023-02-17 05:44:43,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492368017] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:44:43,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53423318] [2023-02-17 05:44:43,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:44:43,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:44:43,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:44:43,181 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) [2023-02-17 05:44:43,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 05:44:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:44:43,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 05:44:43,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:44:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2023-02-17 05:44:43,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:44:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2023-02-17 05:44:43,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53423318] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:44:43,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 05:44:43,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-02-17 05:44:43,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824900667] [2023-02-17 05:44:43,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 05:44:43,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 05:44:43,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:44:43,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 05:44:43,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 05:44:43,462 INFO L87 Difference]: Start difference. First operand 1975 states and 2548 transitions. Second operand has 8 states, 8 states have (on average 42.0) internal successors, (336), 8 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:43,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:43,856 INFO L93 Difference]: Finished difference Result 2819 states and 3650 transitions. [2023-02-17 05:44:43,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 05:44:43,857 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 42.0) internal successors, (336), 8 states have internal predecessors, (336), 0 states have call successors, (0), 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 601 [2023-02-17 05:44:43,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:43,858 INFO L225 Difference]: With dead ends: 2819 [2023-02-17 05:44:43,858 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 05:44:43,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1210 GetRequests, 1201 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-17 05:44:43,862 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 192 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:43,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 994 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 05:44:43,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 05:44:43,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 05:44:43,863 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) [2023-02-17 05:44:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 05:44:43,863 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 601 [2023-02-17 05:44:43,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:43,864 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 05:44:43,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.0) internal successors, (336), 8 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:43,864 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 05:44:43,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 05:44:43,867 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 05:44:43,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 05:44:44,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2023-02-17 05:44:44,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 05:44:44,092 INFO L899 garLoopResultBuilder]: For program point L465(lines 465 469) no Hoare annotation was computed. [2023-02-17 05:44:44,093 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8593#1(lines 184 614) the Hoare annotation is: (let ((.cse1 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8592)) 0) .cse3) (and .cse0 .cse2 .cse4) (and .cse0 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-17 05:44:44,097 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8529#1(lines 157 623) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|))) (let ((.cse0 (let ((.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse2 .cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse5) (and .cse2 .cse3 .cse5)))) (.cse1 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse1) (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse2 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3))))) [2023-02-17 05:44:44,097 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 608) no Hoare annotation was computed. [2023-02-17 05:44:44,097 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 619) no Hoare annotation was computed. [2023-02-17 05:44:44,098 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 630) no Hoare annotation was computed. [2023-02-17 05:44:44,100 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8497#1(lines 145 627) the Hoare annotation is: (let ((.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse2 (= 1 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse6 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse3 .cse4 .cse5 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and (or (and .cse0 .cse4 .cse2 .cse5) (and .cse0 .cse2 .cse5)) .cse6) (and .cse0 .cse3 .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-17 05:44:44,100 INFO L899 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2023-02-17 05:44:44,100 INFO L899 garLoopResultBuilder]: For program point L568(lines 568 572) no Hoare annotation was computed. [2023-02-17 05:44:44,100 INFO L899 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2023-02-17 05:44:44,101 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8482#1(lines 133 631) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or .cse0 (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and .cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)))) [2023-02-17 05:44:44,102 INFO L895 garLoopResultBuilder]: At program point L370(lines 352 388) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|))) (let ((.cse0 (let ((.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse2 .cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse5) (and .cse2 .cse3 .cse5)))) (.cse1 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse1) (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse2 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3))))) [2023-02-17 05:44:44,102 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 607) no Hoare annotation was computed. [2023-02-17 05:44:44,102 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 618) no Hoare annotation was computed. [2023-02-17 05:44:44,102 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 629) no Hoare annotation was computed. [2023-02-17 05:44:44,102 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2023-02-17 05:44:44,103 INFO L899 garLoopResultBuilder]: For program point L470(lines 470 481) no Hoare annotation was computed. [2023-02-17 05:44:44,103 INFO L899 garLoopResultBuilder]: For program point L536-2(lines 219 600) no Hoare annotation was computed. [2023-02-17 05:44:44,103 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 250) no Hoare annotation was computed. [2023-02-17 05:44:44,103 INFO L899 garLoopResultBuilder]: For program point L239-2(lines 239 250) no Hoare annotation was computed. [2023-02-17 05:44:44,103 INFO L899 garLoopResultBuilder]: For program point L372(lines 372 376) no Hoare annotation was computed. [2023-02-17 05:44:44,103 INFO L902 garLoopResultBuilder]: At program point L670(lines 75 687) the Hoare annotation is: true [2023-02-17 05:44:44,103 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 412) no Hoare annotation was computed. [2023-02-17 05:44:44,103 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 246) no Hoare annotation was computed. [2023-02-17 05:44:44,103 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 606) no Hoare annotation was computed. [2023-02-17 05:44:44,103 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 617) no Hoare annotation was computed. [2023-02-17 05:44:44,103 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 628) no Hoare annotation was computed. [2023-02-17 05:44:44,108 INFO L895 garLoopResultBuilder]: At program point L109-2(lines 109 669) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse9 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse10 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (let ((.cse20 (and .cse0 .cse4 .cse9 .cse10)) (.cse8 (and .cse4 .cse9 .cse10)) (.cse22 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8528)) 0))) (let ((.cse14 (let ((.cse27 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8560)) 0))) (or (and .cse0 .cse4 .cse9 .cse10 .cse27) (and .cse0 .cse4 .cse10 .cse27)))) (.cse6 (or (and .cse22 .cse0 .cse4 .cse10) (and .cse22 .cse0 .cse4 .cse9 .cse10))) (.cse13 (or .cse20 .cse8)) (.cse17 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse21 (let ((.cse26 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8512)) 0))) (or (and .cse0 .cse4 .cse26 .cse10) (and .cse0 .cse4 .cse9 .cse26 .cse10)))) (.cse18 (<= 0 (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8672)))) (.cse11 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8464)) (.cse2 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8656)) 0)) (.cse24 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3)) (.cse5 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8448)) 0)) (.cse23 (= 1 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse19 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8496)) 0)) (.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse15 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3)) (.cse16 (let ((.cse25 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8544)) 0))) (or (and .cse0 .cse4 .cse25 .cse10) (and .cse0 .cse4 .cse9 .cse25 .cse10)))) (.cse7 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5) (and .cse6 .cse7) .cse8 (and .cse0 .cse4 .cse9 .cse10 .cse11 .cse12 .cse7) (and .cse13 .cse7) (and .cse0 .cse4 .cse9 .cse5 .cse10 .cse7) (and .cse14 .cse12 .cse7) (and .cse0 .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5 .cse3) (and .cse0 .cse1 .cse3 .cse11) (and .cse14 .cse7) (and .cse6 .cse12 .cse7) (and .cse0 .cse15 .cse3) (and .cse16 .cse12 .cse7) (and .cse0 .cse15) (and .cse1 .cse3) (and .cse0 .cse17 .cse4 .cse9) (and .cse0 .cse4 .cse9 .cse5 .cse10 .cse12 .cse7) (and .cse13 .cse12 .cse7) (and .cse0 .cse4 .cse9 .cse10 .cse11 .cse7) (and .cse0 .cse9 .cse18 .cse3) (and .cse4 .cse1) (and .cse0 .cse17 .cse4 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8592)) 0) .cse9) (and .cse0 .cse4 .cse1) (and .cse0 .cse4 .cse9 .cse19 .cse10 .cse12 .cse7) (and .cse0 .cse17 .cse4 .cse9 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8608)) 0)) (and .cse0 .cse4 .cse1 .cse19) .cse20 (and .cse21 .cse12 .cse7) (and .cse21 .cse7) (and .cse0 .cse1 .cse18 .cse3) (and .cse0 .cse1 .cse19 .cse3) (and .cse0 (= 0 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse10 .cse11 .cse7) (and .cse22 .cse0 .cse1 .cse3) (and .cse0 .cse1 .cse23 .cse19) (and .cse0 .cse4 .cse1 .cse11) (and .cse0 .cse4 .cse9 .cse2) (and .cse0 .cse4 .cse9 .cse19 .cse10 .cse7) (and (or (and .cse9 .cse10 .cse3) (and .cse0 .cse9 .cse10 .cse3)) .cse15 .cse24) (and .cse0 .cse9 .cse24 .cse5 .cse10 .cse3 .cse7) (and (or (and .cse0 .cse23 .cse19 .cse10) (and .cse0 .cse9 .cse23 .cse19 .cse10)) .cse7) (and .cse0 .cse1 .cse3) (and .cse22 .cse0 .cse4 .cse1) (and .cse0 .cse4 .cse15) (and .cse16 .cse7))))) [2023-02-17 05:44:44,108 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2023-02-17 05:44:44,108 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 689 700) the Hoare annotation is: true [2023-02-17 05:44:44,109 INFO L899 garLoopResultBuilder]: For program point L639(lines 639 667) no Hoare annotation was computed. [2023-02-17 05:44:44,109 INFO L899 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2023-02-17 05:44:44,109 INFO L899 garLoopResultBuilder]: For program point L640(lines 640 664) no Hoare annotation was computed. [2023-02-17 05:44:44,109 INFO L899 garLoopResultBuilder]: For program point L574(lines 574 578) no Hoare annotation was computed. [2023-02-17 05:44:44,109 INFO L899 garLoopResultBuilder]: For program point L508(lines 508 512) no Hoare annotation was computed. [2023-02-17 05:44:44,109 INFO L899 garLoopResultBuilder]: For program point L574-2(lines 574 578) no Hoare annotation was computed. [2023-02-17 05:44:44,109 INFO L899 garLoopResultBuilder]: For program point L508-2(lines 219 600) no Hoare annotation was computed. [2023-02-17 05:44:44,109 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8481#1(lines 127 633) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse4) (and .cse0 .cse1 .cse5) (and .cse0 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-17 05:44:44,109 INFO L899 garLoopResultBuilder]: For program point L211(lines 211 605) no Hoare annotation was computed. [2023-02-17 05:44:44,109 INFO L899 garLoopResultBuilder]: For program point L178(lines 178 616) no Hoare annotation was computed. [2023-02-17 05:44:44,109 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 627) no Hoare annotation was computed. [2023-02-17 05:44:44,110 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 638) no Hoare annotation was computed. [2023-02-17 05:44:44,110 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 678) no Hoare annotation was computed. [2023-02-17 05:44:44,110 INFO L899 garLoopResultBuilder]: For program point L641(lines 641 650) no Hoare annotation was computed. [2023-02-17 05:44:44,110 INFO L899 garLoopResultBuilder]: For program point L674-2(lines 674 678) no Hoare annotation was computed. [2023-02-17 05:44:44,110 INFO L899 garLoopResultBuilder]: For program point L641-2(lines 640 662) no Hoare annotation was computed. [2023-02-17 05:44:44,110 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 282) no Hoare annotation was computed. [2023-02-17 05:44:44,110 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 316) no Hoare annotation was computed. [2023-02-17 05:44:44,110 INFO L899 garLoopResultBuilder]: For program point L312-2(lines 219 600) no Hoare annotation was computed. [2023-02-17 05:44:44,110 INFO L899 garLoopResultBuilder]: For program point L643(lines 643 647) no Hoare annotation was computed. [2023-02-17 05:44:44,110 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 604) no Hoare annotation was computed. [2023-02-17 05:44:44,110 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 615) no Hoare annotation was computed. [2023-02-17 05:44:44,110 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 626) no Hoare annotation was computed. [2023-02-17 05:44:44,111 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 637) no Hoare annotation was computed. [2023-02-17 05:44:44,111 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8448#1(lines 175 617) the Hoare annotation is: (let ((.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse3 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8448)) 0)) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (.cse6 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse4 .cse3 .cse5 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse2 .cse3 .cse7) (and .cse0 .cse4 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3) .cse3 .cse5 .cse7 .cse6))) [2023-02-17 05:44:44,111 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2023-02-17 05:44:44,112 INFO L899 garLoopResultBuilder]: For program point L347-2(lines 219 600) no Hoare annotation was computed. [2023-02-17 05:44:44,112 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 91) no Hoare annotation was computed. [2023-02-17 05:44:44,113 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 459) no Hoare annotation was computed. [2023-02-17 05:44:44,113 INFO L895 garLoopResultBuilder]: At program point L414(lines 405 425) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|))) (let ((.cse0 (let ((.cse5 (or (and .cse2 .cse3 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8544)) 0)) (and .cse2 .cse3))) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse5 .cse6) (and .cse5 .cse6)))) (.cse1 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse1) (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse2 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3))))) [2023-02-17 05:44:44,113 INFO L899 garLoopResultBuilder]: For program point L447-2(lines 447 459) no Hoare annotation was computed. [2023-02-17 05:44:44,113 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8657#1(lines 202 608) the Hoare annotation is: (let ((.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-17 05:44:44,113 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 614) no Hoare annotation was computed. [2023-02-17 05:44:44,113 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 625) no Hoare annotation was computed. [2023-02-17 05:44:44,113 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 636) no Hoare annotation was computed. [2023-02-17 05:44:44,113 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2023-02-17 05:44:44,113 INFO L899 garLoopResultBuilder]: For program point L86-2(lines 83 91) no Hoare annotation was computed. [2023-02-17 05:44:44,113 INFO L899 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2023-02-17 05:44:44,114 INFO L899 garLoopResultBuilder]: For program point L450(lines 450 455) no Hoare annotation was computed. [2023-02-17 05:44:44,114 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2023-02-17 05:44:44,114 INFO L899 garLoopResultBuilder]: For program point L252(lines 252 257) no Hoare annotation was computed. [2023-02-17 05:44:44,114 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 613) no Hoare annotation was computed. [2023-02-17 05:44:44,114 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 624) no Hoare annotation was computed. [2023-02-17 05:44:44,115 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 635) no Hoare annotation was computed. [2023-02-17 05:44:44,115 INFO L902 garLoopResultBuilder]: At program point ssl3_accept_switch_1_3#1(lines 214 604) the Hoare annotation is: true [2023-02-17 05:44:44,115 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 594) no Hoare annotation was computed. [2023-02-17 05:44:44,115 INFO L899 garLoopResultBuilder]: For program point L584-1(lines 584 594) no Hoare annotation was computed. [2023-02-17 05:44:44,115 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 522) no Hoare annotation was computed. [2023-02-17 05:44:44,115 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2023-02-17 05:44:44,116 INFO L902 garLoopResultBuilder]: At program point ssl3_accept_switch_1_default#1(lines 217 603) the Hoare annotation is: true [2023-02-17 05:44:44,116 INFO L899 garLoopResultBuilder]: For program point L486(lines 486 490) no Hoare annotation was computed. [2023-02-17 05:44:44,116 INFO L895 garLoopResultBuilder]: At program point L222(lines 115 637) the Hoare annotation is: (let ((.cse8 (<= 0 (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8672))))) (let ((.cse3 (let ((.cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3))) (or (and .cse8 .cse9) .cse9))) (.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse1 (let ((.cse7 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|))) (or .cse7 (and .cse7 .cse8)))) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse6 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1) (and .cse2 .cse0 .cse3) (and .cse0 .cse3) (and .cse2 .cse4 .cse1 .cse5 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse2 .cse0 .cse1) (and .cse2 .cse4 .cse1 .cse5 .cse6)))) [2023-02-17 05:44:44,116 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8577#1(lines 178 616) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse0 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse0 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-17 05:44:44,116 INFO L902 garLoopResultBuilder]: At program point L685(lines 75 687) the Hoare annotation is: true [2023-02-17 05:44:44,116 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 658) no Hoare annotation was computed. [2023-02-17 05:44:44,116 INFO L899 garLoopResultBuilder]: For program point L355(lines 355 387) no Hoare annotation was computed. [2023-02-17 05:44:44,116 INFO L899 garLoopResultBuilder]: For program point L322(lines 322 326) no Hoare annotation was computed. [2023-02-17 05:44:44,116 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 05:44:44,117 INFO L899 garLoopResultBuilder]: For program point L322-2(lines 322 326) no Hoare annotation was computed. [2023-02-17 05:44:44,117 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 612) no Hoare annotation was computed. [2023-02-17 05:44:44,117 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 623) no Hoare annotation was computed. [2023-02-17 05:44:44,117 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 634) no Hoare annotation was computed. [2023-02-17 05:44:44,117 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8641#1(lines 196 610) the Hoare annotation is: (let ((.cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 .cse1) (and .cse0 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (and .cse0 .cse2 .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-17 05:44:44,117 INFO L899 garLoopResultBuilder]: For program point L587(lines 587 591) no Hoare annotation was computed. [2023-02-17 05:44:44,117 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_ERROR#1(lines 75 687) the Hoare annotation is: false [2023-02-17 05:44:44,117 INFO L902 garLoopResultBuilder]: At program point ssl3_accept_returnLabel#1(lines 20 688) the Hoare annotation is: true [2023-02-17 05:44:44,117 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2023-02-17 05:44:44,117 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 75 687) no Hoare annotation was computed. [2023-02-17 05:44:44,117 INFO L899 garLoopResultBuilder]: For program point L358(lines 358 386) no Hoare annotation was computed. [2023-02-17 05:44:44,117 INFO L899 garLoopResultBuilder]: For program point L358-1(lines 358 386) no Hoare annotation was computed. [2023-02-17 05:44:44,118 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 272) no Hoare annotation was computed. [2023-02-17 05:44:44,118 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 611) no Hoare annotation was computed. [2023-02-17 05:44:44,118 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 622) no Hoare annotation was computed. [2023-02-17 05:44:44,118 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 633) no Hoare annotation was computed. [2023-02-17 05:44:44,118 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2023-02-17 05:44:44,118 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 05:44:44,118 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8673#1(lines 208 606) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse4 (<= 0 (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8672))))) (let ((.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse0 (let ((.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3))) (or (and .cse2 .cse4 .cse5) (and .cse4 .cse5))))) (or (and .cse0 .cse1) (and (let ((.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4))) .cse1) (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576))))) [2023-02-17 05:44:44,118 INFO L899 garLoopResultBuilder]: For program point L359(lines 359 383) no Hoare annotation was computed. [2023-02-17 05:44:44,118 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 231) no Hoare annotation was computed. [2023-02-17 05:44:44,118 INFO L899 garLoopResultBuilder]: For program point L227-2(lines 219 600) no Hoare annotation was computed. [2023-02-17 05:44:44,118 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8609#1(lines 190 612) the Hoare annotation is: (let ((.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse1 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4) (and .cse0 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and .cse0 .cse1 .cse2 .cse3 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8608)) 0)))) [2023-02-17 05:44:44,119 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 05:44:44,119 INFO L895 garLoopResultBuilder]: At program point $Ultimate##153(lines 394 431) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|))) (let ((.cse0 (let ((.cse5 (or (and .cse2 .cse3 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8544)) 0)) (and .cse2 .cse3))) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse5 .cse6) (and .cse5 .cse6)))) (.cse1 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse1) (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse2 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3))))) [2023-02-17 05:44:44,119 INFO L899 garLoopResultBuilder]: For program point L261(lines 261 266) no Hoare annotation was computed. [2023-02-17 05:44:44,119 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8466#1(lines 136 630) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse4) (and .cse0 (= 0 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4) (and .cse0 .cse1 .cse5) (and .cse0 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-17 05:44:44,119 INFO L899 garLoopResultBuilder]: For program point L559(lines 559 567) no Hoare annotation was computed. [2023-02-17 05:44:44,119 INFO L895 garLoopResultBuilder]: At program point $Ultimate##161(lines 405 425) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|))) (let ((.cse0 (let ((.cse5 (or (and .cse2 .cse3 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8544)) 0)) (and .cse2 .cse3))) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse5 .cse6) (and .cse5 .cse6)))) (.cse1 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse1) (and .cse2 .cse3 .cse4) (and .cse0 .cse1) (and .cse2 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3))))) [2023-02-17 05:44:44,119 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_12292#1(lines 112 638) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse1 (<= 0 (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8672))))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1))) [2023-02-17 05:44:44,119 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 299) no Hoare annotation was computed. [2023-02-17 05:44:44,119 INFO L899 garLoopResultBuilder]: For program point L295-2(lines 219 600) no Hoare annotation was computed. [2023-02-17 05:44:44,120 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 610) no Hoare annotation was computed. [2023-02-17 05:44:44,120 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 621) no Hoare annotation was computed. [2023-02-17 05:44:44,120 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 632) no Hoare annotation was computed. [2023-02-17 05:44:44,120 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 426) no Hoare annotation was computed. [2023-02-17 05:44:44,120 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 382) no Hoare annotation was computed. [2023-02-17 05:44:44,120 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 05:44:44,120 INFO L895 garLoopResultBuilder]: At program point $Ultimate##219(lines 639 667) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse9 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse10 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (let ((.cse20 (and .cse0 .cse4 .cse9 .cse10)) (.cse8 (and .cse4 .cse9 .cse10)) (.cse22 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8528)) 0))) (let ((.cse14 (let ((.cse27 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8560)) 0))) (or (and .cse0 .cse4 .cse9 .cse10 .cse27) (and .cse0 .cse4 .cse10 .cse27)))) (.cse6 (or (and .cse22 .cse0 .cse4 .cse10) (and .cse22 .cse0 .cse4 .cse9 .cse10))) (.cse13 (or .cse20 .cse8)) (.cse17 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse21 (let ((.cse26 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8512)) 0))) (or (and .cse0 .cse4 .cse26 .cse10) (and .cse0 .cse4 .cse9 .cse26 .cse10)))) (.cse18 (<= 0 (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8672)))) (.cse11 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8464)) (.cse2 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8656)) 0)) (.cse24 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3)) (.cse5 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8448)) 0)) (.cse23 (= 1 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse19 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8496)) 0)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (.cse15 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3)) (.cse16 (let ((.cse25 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8544)) 0))) (or (and .cse0 .cse4 .cse25 .cse10) (and .cse0 .cse4 .cse9 .cse25 .cse10)))) (.cse7 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5) (and .cse6 .cse7) .cse8 (and .cse0 .cse4 .cse9 .cse10 .cse11 .cse12 .cse7) (and .cse13 .cse7) (and .cse0 .cse4 .cse9 .cse5 .cse10 .cse7) (and .cse14 .cse12 .cse7) (and .cse0 .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse3 .cse11) (and .cse0 .cse1 .cse5 .cse3) (and .cse14 .cse7) (and .cse6 .cse12 .cse7) (and .cse0 .cse15 .cse3) (and .cse16 .cse12 .cse7) (and .cse0 .cse17 .cse4 .cse9) (and .cse1 .cse3) (and .cse0 .cse15) (and .cse0 .cse4 .cse9 .cse5 .cse10 .cse12 .cse7) (and .cse0 .cse4 .cse9 .cse10 .cse11 .cse7) (and .cse0 .cse9 .cse18 .cse3) (and .cse13 .cse12 .cse7) (and .cse4 .cse1) (and .cse0 .cse17 .cse4 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8592)) 0) .cse9) (and .cse0 .cse4 .cse1) (and .cse0 .cse17 .cse4 .cse9 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8608)) 0)) (and .cse0 .cse4 .cse9 .cse19 .cse10 .cse12 .cse7) (and .cse0 .cse4 .cse1 .cse19) .cse20 (and .cse21 .cse12 .cse7) (and .cse0 .cse1 .cse19 .cse3) (and .cse21 .cse7) (and .cse0 .cse1 .cse18 .cse3) (and .cse22 .cse0 .cse1 .cse3) (and .cse0 .cse1 .cse23 .cse19) (and .cse0 .cse4 .cse1 .cse11) (and .cse0 .cse4 .cse9 .cse2) (and .cse0 .cse4 .cse9 .cse19 .cse10 .cse7) (and (or (and .cse9 .cse10 .cse3) (and .cse0 .cse9 .cse10 .cse3)) .cse15 .cse24) (and .cse0 .cse9 .cse24 .cse5 .cse10 .cse3 .cse7) (and (or (and .cse0 .cse23 .cse19 .cse10) (and .cse0 .cse9 .cse23 .cse19 .cse10)) .cse7) (and .cse22 .cse0 .cse4 .cse1) (and .cse0 .cse1 .cse3) (and .cse0 .cse4 .cse15) (and .cse16 .cse7))))) [2023-02-17 05:44:44,121 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 681) no Hoare annotation was computed. [2023-02-17 05:44:44,121 INFO L899 garLoopResultBuilder]: For program point L396(lines 396 402) no Hoare annotation was computed. [2023-02-17 05:44:44,121 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8561#1(lines 169 619) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|))) (let ((.cse0 (let ((.cse5 (or (and .cse2 .cse3) (and .cse2 .cse3 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8560)) 0)))) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse5 .cse6) (and .cse5 .cse6)))) (.cse1 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse1) (and .cse2 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3))))) [2023-02-17 05:44:44,121 INFO L899 garLoopResultBuilder]: For program point L562(lines 562 566) no Hoare annotation was computed. [2023-02-17 05:44:44,121 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2023-02-17 05:44:44,121 INFO L899 garLoopResultBuilder]: For program point L364(lines 364 368) no Hoare annotation was computed. [2023-02-17 05:44:44,121 INFO L899 garLoopResultBuilder]: For program point L331-1(lines 331 340) no Hoare annotation was computed. [2023-02-17 05:44:44,121 INFO L899 garLoopResultBuilder]: For program point L364-2(lines 362 380) no Hoare annotation was computed. [2023-02-17 05:44:44,121 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 609) no Hoare annotation was computed. [2023-02-17 05:44:44,121 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 620) no Hoare annotation was computed. [2023-02-17 05:44:44,121 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 631) no Hoare annotation was computed. [2023-02-17 05:44:44,122 INFO L899 garLoopResultBuilder]: For program point L497(lines 497 501) no Hoare annotation was computed. [2023-02-17 05:44:44,122 INFO L895 garLoopResultBuilder]: At program point $Ultimate##125(lines 331 340) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|))) (let ((.cse0 (let ((.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse2 .cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse5) (and .cse2 .cse3 .cse5)))) (.cse1 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse1) (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse2 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3))))) [2023-02-17 05:44:44,124 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:44:44,126 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 05:44:44,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 05:44:44 BoogieIcfgContainer [2023-02-17 05:44:44,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 05:44:44,179 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 05:44:44,179 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 05:44:44,179 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 05:44:44,179 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:44:36" (3/4) ... [2023-02-17 05:44:44,182 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 05:44:44,202 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-02-17 05:44:44,203 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 05:44:44,203 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 05:44:44,204 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 05:44:44,289 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 05:44:44,294 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 05:44:44,294 INFO L158 Benchmark]: Toolchain (without parser) took 8466.62ms. Allocated memory was 119.5MB in the beginning and 232.8MB in the end (delta: 113.2MB). Free memory was 76.9MB in the beginning and 92.0MB in the end (delta: -15.1MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2023-02-17 05:44:44,295 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 119.5MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 05:44:44,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.66ms. Allocated memory is still 119.5MB. Free memory was 76.5MB in the beginning and 61.0MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-17 05:44:44,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.74ms. Allocated memory is still 119.5MB. Free memory was 61.0MB in the beginning and 58.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 05:44:44,296 INFO L158 Benchmark]: Boogie Preprocessor took 40.72ms. Allocated memory is still 119.5MB. Free memory was 58.0MB in the beginning and 55.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 05:44:44,299 INFO L158 Benchmark]: RCFGBuilder took 695.74ms. Allocated memory is still 119.5MB. Free memory was 55.9MB in the beginning and 70.1MB in the end (delta: -14.1MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2023-02-17 05:44:44,299 INFO L158 Benchmark]: TraceAbstraction took 7224.36ms. Allocated memory was 119.5MB in the beginning and 232.8MB in the end (delta: 113.2MB). Free memory was 69.5MB in the beginning and 100.4MB in the end (delta: -30.9MB). Peak memory consumption was 81.9MB. Max. memory is 16.1GB. [2023-02-17 05:44:44,299 INFO L158 Benchmark]: Witness Printer took 115.14ms. Allocated memory is still 232.8MB. Free memory was 100.4MB in the beginning and 92.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 05:44:44,300 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.18ms. Allocated memory is still 119.5MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.66ms. Allocated memory is still 119.5MB. Free memory was 76.5MB in the beginning and 61.0MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.74ms. Allocated memory is still 119.5MB. Free memory was 61.0MB in the beginning and 58.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.72ms. Allocated memory is still 119.5MB. Free memory was 58.0MB in the beginning and 55.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 695.74ms. Allocated memory is still 119.5MB. Free memory was 55.9MB in the beginning and 70.1MB in the end (delta: -14.1MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7224.36ms. Allocated memory was 119.5MB in the beginning and 232.8MB in the end (delta: 113.2MB). Free memory was 69.5MB in the beginning and 100.4MB in the end (delta: -30.9MB). Peak memory consumption was 81.9MB. Max. memory is 16.1GB. * Witness Printer took 115.14ms. Allocated memory is still 232.8MB. Free memory was 100.4MB in the beginning and 92.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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: 681]: 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, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 20, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1872 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1872 mSDsluCounter, 7377 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3098 mSDsCounter, 508 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2547 IncrementalHoareTripleChecker+Invalid, 3055 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 508 mSolverCounterUnsat, 4279 mSDtfsCounter, 2547 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2020 GetRequests, 1985 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1975occurred in iteration=19, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 729 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 206 NumberOfFragments, 3629 HoareAnnotationTreeSize, 29 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 5499 NumberOfCodeBlocks, 5499 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6449 ConstructedInterpolants, 0 QuantifiedInterpolants, 9077 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1526 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 26034/26190 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: 112]: Loop Invariant Derived loop invariant: ((!(s__hit == 0) && 0 <= s__state + -8672) && blastFlag == 3) || ((2 == blastFlag && !(s__hit == 0)) && 0 <= s__state + -8672) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0)) && s__state + -8448 == 0) || (((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8448 == 0) && s__state <= 8576) && !(8576 <= s__state))) || ((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8448 == 0) && s__state <= 8576) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || (((s__state <= 8672 && !(s__hit == 0)) && s__state + -8448 == 0) && blastFlag == 3)) || ((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && s__s3__tmp__next_state___0 == 3) && s__state + -8448 == 0) && s__state <= 8576) && blastFlag == 3) && !(8576 <= s__state)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) || ((s__state <= 8672 && 2 == blastFlag) && s__state <= 8576)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state)) || (((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) || ((s__state <= 8672 && 2 == blastFlag) && s__state <= 8576)) && !(8576 <= s__state))) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) || ((s__state <= 8672 && 2 == blastFlag) && s__state <= 8576)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state)) || (((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) || ((s__state <= 8672 && 2 == blastFlag) && s__state <= 8576)) && !(8576 <= s__state))) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((((s__state <= 8672 && !(s__hit == 0)) && 1 == blastFlag) || ((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && !(8576 <= s__state))) || (((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || (((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && 1 == blastFlag) && s__state <= 8576) || ((s__state <= 8672 && 1 == blastFlag) && s__state <= 8576)) && !(8576 <= s__state))) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: (((((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3)) || ((((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8608 == 0) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((((((s__s3__tmp__next_state___0 <= 8576 && (((s__state <= 8672 && 2 == blastFlag) && s__state + -8544 == 0) || (s__state <= 8672 && 2 == blastFlag))) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__state + -8544 == 0) || (s__state <= 8672 && 2 == blastFlag)) && s__state <= 8576)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 8576 && (((s__state <= 8672 && 2 == blastFlag) && s__state + -8544 == 0) || (s__state <= 8672 && 2 == blastFlag))) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__state + -8544 == 0) || (s__state <= 8672 && 2 == blastFlag)) && s__state <= 8576)) && !(8576 <= s__state))) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) || ((((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__state + -8592 == 0) && s__s3__tmp__next_state___0 <= 8576)) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && !(8576 <= s__state)) || (((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || (((s__state <= 8672 && 0 == blastFlag) && s__state <= 8576) && !(8576 <= s__state))) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) || (((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((((s__state <= 8672 && 0 <= s__state + -8672) && blastFlag == 3) || (0 <= s__state + -8672 && blastFlag == 3)) && !(s__hit == 0)) || ((((s__state <= 8672 && 2 == blastFlag) && 0 <= s__state + -8672) || (2 == blastFlag && 0 <= s__state + -8672)) && !(s__hit == 0))) || ((((s__state <= 8672 && 0 <= s__state + -8672) && blastFlag == 3) || (0 <= s__state + -8672 && blastFlag == 3)) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && !(8576 <= s__state)) || (((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 639]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((s__state <= 8672 && !(s__hit == 0)) && s__state + -8656 == 0) && blastFlag == 3) || (((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0)) && s__state + -8448 == 0)) || (((((s__state + -8528 == 0 && s__state <= 8672) && 2 == blastFlag) && s__state <= 8576) || ((((s__state + -8528 == 0 && s__state <= 8672) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) && !(8576 <= s__state))) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__state == 8464) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || (((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) && !(8576 <= s__state))) || (((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8448 == 0) && s__state <= 8576) && !(8576 <= s__state))) || (((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__state + -8560 == 0) || (((s__state <= 8672 && 2 == blastFlag) && s__state <= 8576) && s__state + -8560 == 0)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || (((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0)) && s__state + -8656 == 0)) || (((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) && s__state == 8464)) || (((s__state <= 8672 && !(s__hit == 0)) && s__state + -8448 == 0) && blastFlag == 3)) || ((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__state + -8560 == 0) || (((s__state <= 8672 && 2 == blastFlag) && s__state <= 8576) && s__state + -8560 == 0)) && !(8576 <= s__state))) || ((((((s__state + -8528 == 0 && s__state <= 8672) && 2 == blastFlag) && s__state <= 8576) || ((((s__state + -8528 == 0 && s__state <= 8672) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || ((s__state <= 8672 && s__state == 3) && blastFlag == 3)) || ((((((s__state <= 8672 && 2 == blastFlag) && s__state + -8544 == 0) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8544 == 0) && s__state <= 8576)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || (((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || (!(s__hit == 0) && blastFlag == 3)) || (s__state <= 8672 && s__state == 3)) || ((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8448 == 0) && s__state <= 8576) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || (((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__state == 8464) && !(8576 <= s__state))) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && 0 <= s__state + -8672) && blastFlag == 3)) || ((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || (2 == blastFlag && !(s__hit == 0))) || ((((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__state + -8592 == 0) && s__s3__tmp__next_state___0 <= 8576)) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8608 == 0)) || ((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8496 == 0) && s__state <= 8576) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || (((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0)) && s__state + -8496 == 0)) || (((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((((((s__state <= 8672 && 2 == blastFlag) && s__state + -8512 == 0) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8512 == 0) && s__state <= 8576)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || (((s__state <= 8672 && !(s__hit == 0)) && s__state + -8496 == 0) && blastFlag == 3)) || (((((s__state <= 8672 && 2 == blastFlag) && s__state + -8512 == 0) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8512 == 0) && s__state <= 8576)) && !(8576 <= s__state))) || (((s__state <= 8672 && !(s__hit == 0)) && 0 <= s__state + -8672) && blastFlag == 3)) || (((s__state + -8528 == 0 && s__state <= 8672) && !(s__hit == 0)) && blastFlag == 3)) || (((s__state <= 8672 && !(s__hit == 0)) && 1 == blastFlag) && s__state + -8496 == 0)) || (((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0)) && s__state == 8464)) || (((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8656 == 0)) || (((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8496 == 0) && s__state <= 8576) && !(8576 <= s__state))) || (((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && blastFlag == 3) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && blastFlag == 3)) && s__state == 3) && s__s3__tmp__next_state___0 == 3)) || ((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && s__s3__tmp__next_state___0 == 3) && s__state + -8448 == 0) && s__state <= 8576) && blastFlag == 3) && !(8576 <= s__state))) || (((((s__state <= 8672 && 1 == blastFlag) && s__state + -8496 == 0) && s__state <= 8576) || ((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && 1 == blastFlag) && s__state + -8496 == 0) && s__state <= 8576)) && !(8576 <= s__state))) || (((s__state + -8528 == 0 && s__state <= 8672) && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3)) || ((s__state <= 8672 && 2 == blastFlag) && s__state == 3)) || (((((s__state <= 8672 && 2 == blastFlag) && s__state + -8544 == 0) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8544 == 0) && s__state <= 8576)) && !(8576 <= s__state)) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((s__state <= 8672 && !(s__hit == 0)) || (((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((!(s__hit == 0) && (2 == blastFlag || (2 == blastFlag && 0 <= s__state + -8672))) || ((s__state <= 8672 && !(s__hit == 0)) && ((0 <= s__state + -8672 && blastFlag == 3) || blastFlag == 3))) || (!(s__hit == 0) && ((0 <= s__state + -8672 && blastFlag == 3) || blastFlag == 3))) || (((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && (2 == blastFlag || (2 == blastFlag && 0 <= s__state + -8672))) && s__state <= 8576) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || ((s__state <= 8672 && !(s__hit == 0)) && (2 == blastFlag || (2 == blastFlag && 0 <= s__state + -8672)))) || ((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && (2 == blastFlag || (2 == blastFlag && 0 <= s__state + -8672))) && s__state <= 8576) && !(8576 <= s__state)) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) || ((s__state <= 8672 && 2 == blastFlag) && s__state <= 8576)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state)) || (((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) || ((s__state <= 8672 && 2 == blastFlag) && s__state <= 8576)) && !(8576 <= s__state))) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (s__state <= 8672 || (s__state <= 8672 && blastFlag == 3)) || (s__state <= 8672 && 2 == blastFlag) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 8576 && ((s__state <= 8672 && 2 == blastFlag) || ((s__state <= 8672 && 2 == blastFlag) && s__state + -8560 == 0))) && s__state <= 8576) || (((s__state <= 8672 && 2 == blastFlag) || ((s__state <= 8672 && 2 == blastFlag) && s__state + -8560 == 0)) && s__state <= 8576)) && !(8576 <= s__state)) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || (((((s__s3__tmp__next_state___0 <= 8576 && ((s__state <= 8672 && 2 == blastFlag) || ((s__state <= 8672 && 2 == blastFlag) && s__state + -8560 == 0))) && s__state <= 8576) || (((s__state <= 8672 && 2 == blastFlag) || ((s__state <= 8672 && 2 == blastFlag) && s__state + -8560 == 0)) && s__state <= 8576)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: (((((((s__s3__tmp__next_state___0 <= 8576 && (((s__state <= 8672 && 2 == blastFlag) && s__state + -8544 == 0) || (s__state <= 8672 && 2 == blastFlag))) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__state + -8544 == 0) || (s__state <= 8672 && 2 == blastFlag)) && s__state <= 8576)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 8576 && (((s__state <= 8672 && 2 == blastFlag) && s__state + -8544 == 0) || (s__state <= 8672 && 2 == blastFlag))) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__state + -8544 == 0) || (s__state <= 8672 && 2 == blastFlag)) && s__state <= 8576)) && !(8576 <= s__state))) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((s__state <= 8672 && !(s__hit == 0)) && s__state + -8656 == 0) && blastFlag == 3) || (((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0)) && s__state + -8448 == 0)) || (((((s__state + -8528 == 0 && s__state <= 8672) && 2 == blastFlag) && s__state <= 8576) || ((((s__state + -8528 == 0 && s__state <= 8672) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) && !(8576 <= s__state))) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__state == 8464) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || (((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) && !(8576 <= s__state))) || (((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8448 == 0) && s__state <= 8576) && !(8576 <= s__state))) || (((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__state + -8560 == 0) || (((s__state <= 8672 && 2 == blastFlag) && s__state <= 8576) && s__state + -8560 == 0)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || (((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0)) && s__state + -8656 == 0)) || (((s__state <= 8672 && !(s__hit == 0)) && s__state + -8448 == 0) && blastFlag == 3)) || (((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) && s__state == 8464)) || ((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__state + -8560 == 0) || (((s__state <= 8672 && 2 == blastFlag) && s__state <= 8576) && s__state + -8560 == 0)) && !(8576 <= s__state))) || ((((((s__state + -8528 == 0 && s__state <= 8672) && 2 == blastFlag) && s__state <= 8576) || ((((s__state + -8528 == 0 && s__state <= 8672) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || ((s__state <= 8672 && s__state == 3) && blastFlag == 3)) || ((((((s__state <= 8672 && 2 == blastFlag) && s__state + -8544 == 0) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8544 == 0) && s__state <= 8576)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || (s__state <= 8672 && s__state == 3)) || (!(s__hit == 0) && blastFlag == 3)) || (((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || ((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8448 == 0) && s__state <= 8576) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || ((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || (((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__state == 8464) && !(8576 <= s__state))) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && 0 <= s__state + -8672) && blastFlag == 3)) || (2 == blastFlag && !(s__hit == 0))) || ((((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__state + -8592 == 0) && s__s3__tmp__next_state___0 <= 8576)) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8496 == 0) && s__state <= 8576) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || ((((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8608 == 0)) || (((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0)) && s__state + -8496 == 0)) || (((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((((((s__state <= 8672 && 2 == blastFlag) && s__state + -8512 == 0) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8512 == 0) && s__state <= 8576)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || (((((s__state <= 8672 && 2 == blastFlag) && s__state + -8512 == 0) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8512 == 0) && s__state <= 8576)) && !(8576 <= s__state))) || (((s__state <= 8672 && !(s__hit == 0)) && 0 <= s__state + -8672) && blastFlag == 3)) || (((s__state <= 8672 && !(s__hit == 0)) && s__state + -8496 == 0) && blastFlag == 3)) || ((((s__state <= 8672 && 0 == blastFlag) && s__state <= 8576) && s__state == 8464) && !(8576 <= s__state))) || (((s__state + -8528 == 0 && s__state <= 8672) && !(s__hit == 0)) && blastFlag == 3)) || (((s__state <= 8672 && !(s__hit == 0)) && 1 == blastFlag) && s__state + -8496 == 0)) || (((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0)) && s__state == 8464)) || (((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8656 == 0)) || (((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8496 == 0) && s__state <= 8576) && !(8576 <= s__state))) || (((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && blastFlag == 3) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && blastFlag == 3)) && s__state == 3) && s__s3__tmp__next_state___0 == 3)) || ((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && s__s3__tmp__next_state___0 == 3) && s__state + -8448 == 0) && s__state <= 8576) && blastFlag == 3) && !(8576 <= s__state))) || (((((s__state <= 8672 && 1 == blastFlag) && s__state + -8496 == 0) && s__state <= 8576) || ((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && 1 == blastFlag) && s__state + -8496 == 0) && s__state <= 8576)) && !(8576 <= s__state))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3)) || (((s__state + -8528 == 0 && s__state <= 8672) && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && 2 == blastFlag) && s__state == 3)) || (((((s__state <= 8672 && 2 == blastFlag) && s__state + -8544 == 0) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8544 == 0) && s__state <= 8576)) && !(8576 <= s__state)) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: (((((((s__s3__tmp__next_state___0 <= 8576 && (((s__state <= 8672 && 2 == blastFlag) && s__state + -8544 == 0) || (s__state <= 8672 && 2 == blastFlag))) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__state + -8544 == 0) || (s__state <= 8672 && 2 == blastFlag)) && s__state <= 8576)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state)) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((((s__s3__tmp__next_state___0 <= 8576 && (((s__state <= 8672 && 2 == blastFlag) && s__state + -8544 == 0) || (s__state <= 8672 && 2 == blastFlag))) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__state + -8544 == 0) || (s__state <= 8672 && 2 == blastFlag)) && s__state <= 8576)) && !(8576 <= s__state))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) RESULT: Ultimate proved your program to be correct! [2023-02-17 05:44:44,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE