./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.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_3a_alt.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 c802d0dd4f8edaf03f1251784a424c8f295192f6a4e7c65ec93469eacce08251 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 05:45:04,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 05:45:04,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 05:45:04,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 05:45:04,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 05:45:04,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 05:45:04,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 05:45:04,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 05:45:04,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 05:45:04,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 05:45:04,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 05:45:04,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 05:45:04,977 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 05:45:04,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 05:45:04,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 05:45:04,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 05:45:04,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 05:45:04,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 05:45:04,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 05:45:04,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 05:45:04,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 05:45:04,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 05:45:04,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 05:45:04,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 05:45:04,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 05:45:04,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 05:45:04,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 05:45:04,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 05:45:04,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 05:45:04,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 05:45:04,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 05:45:04,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 05:45:04,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 05:45:04,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 05:45:04,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 05:45:05,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 05:45:05,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 05:45:05,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 05:45:05,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 05:45:05,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 05:45:05,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 05:45:05,003 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:45:05,036 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 05:45:05,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 05:45:05,037 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 05:45:05,037 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 05:45:05,037 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 05:45:05,037 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 05:45:05,038 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 05:45:05,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 05:45:05,038 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 05:45:05,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 05:45:05,039 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 05:45:05,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 05:45:05,039 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 05:45:05,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 05:45:05,039 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 05:45:05,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 05:45:05,040 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 05:45:05,040 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 05:45:05,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 05:45:05,040 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 05:45:05,040 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 05:45:05,040 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 05:45:05,041 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 05:45:05,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 05:45:05,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:45:05,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 05:45:05,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 05:45:05,041 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 05:45:05,041 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 05:45:05,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 05:45:05,042 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 05:45:05,042 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 05:45:05,042 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 05:45:05,042 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 05:45:05,042 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 05:45:05,042 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 -> c802d0dd4f8edaf03f1251784a424c8f295192f6a4e7c65ec93469eacce08251 [2023-02-17 05:45:05,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 05:45:05,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 05:45:05,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 05:45:05,251 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 05:45:05,251 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 05:45:05,252 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2023-02-17 05:45:06,253 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 05:45:06,434 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 05:45:06,435 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2023-02-17 05:45:06,442 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ceda5163/aa6a322859b04eb4ac73f27f6f0a1ebd/FLAGee26992e9 [2023-02-17 05:45:06,461 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ceda5163/aa6a322859b04eb4ac73f27f6f0a1ebd [2023-02-17 05:45:06,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 05:45:06,465 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 05:45:06,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 05:45:06,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 05:45:06,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 05:45:06,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:45:06" (1/1) ... [2023-02-17 05:45:06,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dce7015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:45:06, skipping insertion in model container [2023-02-17 05:45:06,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:45:06" (1/1) ... [2023-02-17 05:45:06,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 05:45:06,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 05:45:06,641 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_3a_alt.BV.c.cil.c[44628,44641] [2023-02-17 05:45:06,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:45:06,651 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 05:45:06,681 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_3a_alt.BV.c.cil.c[44628,44641] [2023-02-17 05:45:06,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:45:06,694 INFO L208 MainTranslator]: Completed translation [2023-02-17 05:45:06,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:45:06 WrapperNode [2023-02-17 05:45:06,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 05:45:06,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 05:45:06,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 05:45:06,696 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 05:45:06,700 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:45:06" (1/1) ... [2023-02-17 05:45:06,707 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:45:06" (1/1) ... [2023-02-17 05:45:06,726 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 522 [2023-02-17 05:45:06,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 05:45:06,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 05:45:06,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 05:45:06,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 05:45:06,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:45:06" (1/1) ... [2023-02-17 05:45:06,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:45:06" (1/1) ... [2023-02-17 05:45:06,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:45:06" (1/1) ... [2023-02-17 05:45:06,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:45:06" (1/1) ... [2023-02-17 05:45:06,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:45:06" (1/1) ... [2023-02-17 05:45:06,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:45:06" (1/1) ... [2023-02-17 05:45:06,763 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:45:06" (1/1) ... [2023-02-17 05:45:06,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:45:06" (1/1) ... [2023-02-17 05:45:06,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 05:45:06,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 05:45:06,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 05:45:06,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 05:45:06,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:45:06" (1/1) ... [2023-02-17 05:45:06,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:45:06,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:45:06,793 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:45:06,799 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:45:06,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 05:45:06,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 05:45:06,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 05:45:06,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 05:45:06,886 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 05:45:06,888 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 05:45:06,901 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-02-17 05:45:07,286 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2023-02-17 05:45:07,286 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2023-02-17 05:45:07,286 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 05:45:07,291 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 05:45:07,294 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 05:45:07,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:45:07 BoogieIcfgContainer [2023-02-17 05:45:07,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 05:45:07,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 05:45:07,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 05:45:07,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 05:45:07,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 05:45:06" (1/3) ... [2023-02-17 05:45:07,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a54cf30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:45:07, skipping insertion in model container [2023-02-17 05:45:07,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:45:06" (2/3) ... [2023-02-17 05:45:07,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a54cf30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:45:07, skipping insertion in model container [2023-02-17 05:45:07,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:45:07" (3/3) ... [2023-02-17 05:45:07,303 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2023-02-17 05:45:07,314 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 05:45:07,315 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 05:45:07,356 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 05:45:07,361 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;@778d3942, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 05:45:07,362 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 05:45:07,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 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:45:07,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 05:45:07,373 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:07,375 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:45:07,376 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:07,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:07,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1632003015, now seen corresponding path program 1 times [2023-02-17 05:45:07,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:07,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253000366] [2023-02-17 05:45:07,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:07,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:07,677 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:45:07,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:07,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253000366] [2023-02-17 05:45:07,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253000366] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:07,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:07,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:07,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252450886] [2023-02-17 05:45:07,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:07,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:07,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:07,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:07,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:07,702 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 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:45:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:07,920 INFO L93 Difference]: Finished difference Result 297 states and 509 transitions. [2023-02-17 05:45:07,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:07,923 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:45:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:07,933 INFO L225 Difference]: With dead ends: 297 [2023-02-17 05:45:07,934 INFO L226 Difference]: Without dead ends: 145 [2023-02-17 05:45:07,937 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:45:07,942 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 32 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:07,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 359 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 05:45:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-17 05:45:07,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2023-02-17 05:45:07,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.524822695035461) internal successors, (215), 141 states have internal predecessors, (215), 0 states have call successors, (0), 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:45:07,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 215 transitions. [2023-02-17 05:45:07,985 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 215 transitions. Word has length 44 [2023-02-17 05:45:07,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:07,986 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 215 transitions. [2023-02-17 05:45:07,986 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:45:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 215 transitions. [2023-02-17 05:45:07,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-17 05:45:07,991 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:07,992 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:45:07,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 05:45:07,993 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:07,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:07,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1722912794, now seen corresponding path program 1 times [2023-02-17 05:45:07,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:07,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224700344] [2023-02-17 05:45:07,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:07,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:08,085 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:45:08,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:08,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224700344] [2023-02-17 05:45:08,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224700344] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:08,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:08,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:08,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971006343] [2023-02-17 05:45:08,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:08,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:08,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:08,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:08,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:08,088 INFO L87 Difference]: Start difference. First operand 142 states and 215 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:45:08,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:08,205 INFO L93 Difference]: Finished difference Result 301 states and 462 transitions. [2023-02-17 05:45:08,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:08,205 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:45:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:08,208 INFO L225 Difference]: With dead ends: 301 [2023-02-17 05:45:08,209 INFO L226 Difference]: Without dead ends: 167 [2023-02-17 05:45:08,213 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:45:08,215 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 14 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:08,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 283 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:45:08,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-17 05:45:08,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2023-02-17 05:45:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4876543209876543) internal successors, (241), 162 states have internal predecessors, (241), 0 states have call successors, (0), 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:45:08,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2023-02-17 05:45:08,232 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 60 [2023-02-17 05:45:08,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:08,233 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2023-02-17 05:45:08,235 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:45:08,235 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2023-02-17 05:45:08,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-17 05:45:08,239 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:08,239 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:45:08,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 05:45:08,240 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:08,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1797387181, now seen corresponding path program 1 times [2023-02-17 05:45:08,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:08,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370466907] [2023-02-17 05:45:08,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:08,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:08,309 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:45:08,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:08,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370466907] [2023-02-17 05:45:08,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370466907] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:08,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:08,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:08,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043857596] [2023-02-17 05:45:08,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:08,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:08,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:08,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:08,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:08,311 INFO L87 Difference]: Start difference. First operand 163 states and 241 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:45:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:08,405 INFO L93 Difference]: Finished difference Result 345 states and 517 transitions. [2023-02-17 05:45:08,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:08,405 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:45:08,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:08,407 INFO L225 Difference]: With dead ends: 345 [2023-02-17 05:45:08,407 INFO L226 Difference]: Without dead ends: 190 [2023-02-17 05:45:08,409 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:45:08,413 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 13 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 296 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:45:08,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 296 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:45:08,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-17 05:45:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2023-02-17 05:45:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.4516129032258065) internal successors, (270), 186 states have internal predecessors, (270), 0 states have call successors, (0), 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:45:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 270 transitions. [2023-02-17 05:45:08,423 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 270 transitions. Word has length 81 [2023-02-17 05:45:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:08,423 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 270 transitions. [2023-02-17 05:45:08,424 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:45:08,424 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 270 transitions. [2023-02-17 05:45:08,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-17 05:45:08,425 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:08,425 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:45:08,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 05:45:08,425 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:08,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:08,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2045533675, now seen corresponding path program 1 times [2023-02-17 05:45:08,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:08,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391251502] [2023-02-17 05:45:08,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:08,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:08,482 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:45:08,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:08,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391251502] [2023-02-17 05:45:08,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391251502] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:08,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:08,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:08,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920383299] [2023-02-17 05:45:08,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:08,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:08,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:08,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:08,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:08,488 INFO L87 Difference]: Start difference. First operand 187 states and 270 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:45:08,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:08,591 INFO L93 Difference]: Finished difference Result 411 states and 610 transitions. [2023-02-17 05:45:08,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:08,592 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:45:08,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:08,594 INFO L225 Difference]: With dead ends: 411 [2023-02-17 05:45:08,594 INFO L226 Difference]: Without dead ends: 232 [2023-02-17 05:45:08,594 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:45:08,598 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 15 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:08,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 283 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:45:08,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-17 05:45:08,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2023-02-17 05:45:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.3920704845814977) internal successors, (316), 227 states have internal predecessors, (316), 0 states have call successors, (0), 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:45:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 316 transitions. [2023-02-17 05:45:08,613 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 316 transitions. Word has length 81 [2023-02-17 05:45:08,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:08,614 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 316 transitions. [2023-02-17 05:45:08,615 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:45:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 316 transitions. [2023-02-17 05:45:08,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-02-17 05:45:08,616 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:08,616 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:45:08,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 05:45:08,616 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:08,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:08,617 INFO L85 PathProgramCache]: Analyzing trace with hash 755662145, now seen corresponding path program 1 times [2023-02-17 05:45:08,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:08,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737514160] [2023-02-17 05:45:08,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:08,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:08,663 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:45:08,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:08,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737514160] [2023-02-17 05:45:08,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737514160] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:08,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:08,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:08,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190192759] [2023-02-17 05:45:08,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:08,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:08,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:08,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:08,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:08,666 INFO L87 Difference]: Start difference. First operand 228 states and 316 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:45:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:08,750 INFO L93 Difference]: Finished difference Result 485 states and 686 transitions. [2023-02-17 05:45:08,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:08,751 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:45:08,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:08,753 INFO L225 Difference]: With dead ends: 485 [2023-02-17 05:45:08,753 INFO L226 Difference]: Without dead ends: 265 [2023-02-17 05:45:08,753 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:45:08,754 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 29 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:08,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 298 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:45:08,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-02-17 05:45:08,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 253. [2023-02-17 05:45:08,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.373015873015873) internal successors, (346), 252 states have internal predecessors, (346), 0 states have call successors, (0), 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:45:08,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 346 transitions. [2023-02-17 05:45:08,766 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 346 transitions. Word has length 101 [2023-02-17 05:45:08,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:08,766 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 346 transitions. [2023-02-17 05:45:08,766 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:45:08,766 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 346 transitions. [2023-02-17 05:45:08,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-17 05:45:08,767 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:08,767 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:45:08,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 05:45:08,767 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:08,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:08,767 INFO L85 PathProgramCache]: Analyzing trace with hash -687746511, now seen corresponding path program 1 times [2023-02-17 05:45:08,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:08,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669630045] [2023-02-17 05:45:08,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:08,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:08,835 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:45:08,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:08,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669630045] [2023-02-17 05:45:08,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669630045] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:08,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:08,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:08,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452480967] [2023-02-17 05:45:08,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:08,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:08,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:08,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:08,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:08,837 INFO L87 Difference]: Start difference. First operand 253 states and 346 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:45:08,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:08,864 INFO L93 Difference]: Finished difference Result 739 states and 1011 transitions. [2023-02-17 05:45:08,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:08,864 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:45:08,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:08,866 INFO L225 Difference]: With dead ends: 739 [2023-02-17 05:45:08,866 INFO L226 Difference]: Without dead ends: 494 [2023-02-17 05:45:08,866 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:45:08,867 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 131 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:08,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 487 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:45:08,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2023-02-17 05:45:08,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2023-02-17 05:45:08,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 1.3630831643002028) internal successors, (672), 493 states have internal predecessors, (672), 0 states have call successors, (0), 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:45:08,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 672 transitions. [2023-02-17 05:45:08,875 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 672 transitions. Word has length 121 [2023-02-17 05:45:08,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:08,875 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 672 transitions. [2023-02-17 05:45:08,875 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:45:08,875 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 672 transitions. [2023-02-17 05:45:08,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-17 05:45:08,876 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:08,876 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:45:08,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-17 05:45:08,876 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:08,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:08,877 INFO L85 PathProgramCache]: Analyzing trace with hash 209646767, now seen corresponding path program 1 times [2023-02-17 05:45:08,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:08,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835361446] [2023-02-17 05:45:08,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:08,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:08,928 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:45:08,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:08,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835361446] [2023-02-17 05:45:08,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835361446] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:08,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:08,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:08,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941253629] [2023-02-17 05:45:08,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:08,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:08,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:08,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:08,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:08,930 INFO L87 Difference]: Start difference. First operand 494 states and 672 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:45:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:08,951 INFO L93 Difference]: Finished difference Result 1219 states and 1660 transitions. [2023-02-17 05:45:08,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:08,952 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:45:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:08,954 INFO L225 Difference]: With dead ends: 1219 [2023-02-17 05:45:08,954 INFO L226 Difference]: Without dead ends: 733 [2023-02-17 05:45:08,955 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:45:08,955 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 129 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:08,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 453 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:45:08,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2023-02-17 05:45:08,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2023-02-17 05:45:08,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 732 states have (on average 1.3592896174863387) internal successors, (995), 732 states have internal predecessors, (995), 0 states have call successors, (0), 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:45:08,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 995 transitions. [2023-02-17 05:45:08,966 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 995 transitions. Word has length 121 [2023-02-17 05:45:08,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:08,967 INFO L495 AbstractCegarLoop]: Abstraction has 733 states and 995 transitions. [2023-02-17 05:45:08,967 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:45:08,967 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 995 transitions. [2023-02-17 05:45:08,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-17 05:45:08,968 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:08,968 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:45:08,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 05:45:08,969 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:08,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:08,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1728089839, now seen corresponding path program 1 times [2023-02-17 05:45:08,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:08,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495575236] [2023-02-17 05:45:08,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:08,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:08,995 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:45:08,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:08,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495575236] [2023-02-17 05:45:08,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495575236] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:08,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:08,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:08,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598270296] [2023-02-17 05:45:08,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:08,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:08,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:08,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:08,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:08,998 INFO L87 Difference]: Start difference. First operand 733 states and 995 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:45:09,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:09,014 INFO L93 Difference]: Finished difference Result 1482 states and 2008 transitions. [2023-02-17 05:45:09,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:09,015 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:45:09,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:09,017 INFO L225 Difference]: With dead ends: 1482 [2023-02-17 05:45:09,017 INFO L226 Difference]: Without dead ends: 757 [2023-02-17 05:45:09,018 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:45:09,018 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 10 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:09,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 382 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:45:09,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2023-02-17 05:45:09,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2023-02-17 05:45:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 756 states have (on average 1.3544973544973544) internal successors, (1024), 756 states have internal predecessors, (1024), 0 states have call successors, (0), 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:45:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1024 transitions. [2023-02-17 05:45:09,030 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1024 transitions. Word has length 121 [2023-02-17 05:45:09,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:09,030 INFO L495 AbstractCegarLoop]: Abstraction has 757 states and 1024 transitions. [2023-02-17 05:45:09,030 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:45:09,030 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1024 transitions. [2023-02-17 05:45:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-17 05:45:09,031 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:09,032 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:45:09,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-17 05:45:09,032 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:09,032 INFO L85 PathProgramCache]: Analyzing trace with hash -305304207, now seen corresponding path program 1 times [2023-02-17 05:45:09,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:09,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139126512] [2023-02-17 05:45:09,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:09,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:09,057 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:45:09,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:09,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139126512] [2023-02-17 05:45:09,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139126512] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:09,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:09,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:09,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451162804] [2023-02-17 05:45:09,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:09,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:09,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:09,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:09,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:09,059 INFO L87 Difference]: Start difference. First operand 757 states and 1024 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:45:09,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:09,074 INFO L93 Difference]: Finished difference Result 1519 states and 2050 transitions. [2023-02-17 05:45:09,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:09,074 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:45:09,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:09,077 INFO L225 Difference]: With dead ends: 1519 [2023-02-17 05:45:09,077 INFO L226 Difference]: Without dead ends: 770 [2023-02-17 05:45:09,077 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:45:09,078 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 6 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:09,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 362 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:45:09,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2023-02-17 05:45:09,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2023-02-17 05:45:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 1.3485045513654097) internal successors, (1037), 769 states have internal predecessors, (1037), 0 states have call successors, (0), 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:45:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1037 transitions. [2023-02-17 05:45:09,089 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1037 transitions. Word has length 121 [2023-02-17 05:45:09,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:09,090 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 1037 transitions. [2023-02-17 05:45:09,090 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:45:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1037 transitions. [2023-02-17 05:45:09,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-02-17 05:45:09,091 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:09,092 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:45:09,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-17 05:45:09,092 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:09,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:09,092 INFO L85 PathProgramCache]: Analyzing trace with hash -247255522, now seen corresponding path program 1 times [2023-02-17 05:45:09,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:09,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262851805] [2023-02-17 05:45:09,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:09,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:09,104 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 05:45:09,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [809503154] [2023-02-17 05:45:09,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:09,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:45:09,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:45:09,107 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:45:09,136 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:45:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:09,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 05:45:09,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:45:09,241 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:45:09,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:45:09,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:09,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262851805] [2023-02-17 05:45:09,241 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 05:45:09,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809503154] [2023-02-17 05:45:09,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809503154] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:09,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:09,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:09,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865403721] [2023-02-17 05:45:09,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:09,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:09,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:09,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:09,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:09,242 INFO L87 Difference]: Start difference. First operand 770 states and 1037 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:45:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:09,373 INFO L93 Difference]: Finished difference Result 1632 states and 2247 transitions. [2023-02-17 05:45:09,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:09,373 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:45:09,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:09,376 INFO L225 Difference]: With dead ends: 1632 [2023-02-17 05:45:09,376 INFO L226 Difference]: Without dead ends: 883 [2023-02-17 05:45:09,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 157 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:45:09,377 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 34 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:09,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 283 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:45:09,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2023-02-17 05:45:09,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 852. [2023-02-17 05:45:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 851 states have (on average 1.3337250293772034) internal successors, (1135), 851 states have internal predecessors, (1135), 0 states have call successors, (0), 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:45:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1135 transitions. [2023-02-17 05:45:09,391 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1135 transitions. Word has length 159 [2023-02-17 05:45:09,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:09,391 INFO L495 AbstractCegarLoop]: Abstraction has 852 states and 1135 transitions. [2023-02-17 05:45:09,391 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:45:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1135 transitions. [2023-02-17 05:45:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-02-17 05:45:09,393 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:09,393 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] [2023-02-17 05:45:09,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 05:45:09,600 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,SelfDestructingSolverStorable9 [2023-02-17 05:45:09,601 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:09,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:09,601 INFO L85 PathProgramCache]: Analyzing trace with hash -485577875, now seen corresponding path program 1 times [2023-02-17 05:45:09,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:09,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507445717] [2023-02-17 05:45:09,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:09,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:09,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:09,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507445717] [2023-02-17 05:45:09,627 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 05:45:09,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039238267] [2023-02-17 05:45:09,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:09,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:45:09,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:45:09,630 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:45:09,632 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:45:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:09,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 05:45:09,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:45:09,719 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:45:09,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:45:09,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039238267] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:09,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:09,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:09,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015485438] [2023-02-17 05:45:09,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:09,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:09,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:09,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:09,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:09,721 INFO L87 Difference]: Start difference. First operand 852 states and 1135 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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:45:09,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:09,828 INFO L93 Difference]: Finished difference Result 1850 states and 2535 transitions. [2023-02-17 05:45:09,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:09,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 171 [2023-02-17 05:45:09,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:09,831 INFO L225 Difference]: With dead ends: 1850 [2023-02-17 05:45:09,831 INFO L226 Difference]: Without dead ends: 1016 [2023-02-17 05:45:09,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 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:45:09,833 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 156 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:09,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 150 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:45:09,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2023-02-17 05:45:09,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1002. [2023-02-17 05:45:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 1001 states have (on average 1.3856143856143857) internal successors, (1387), 1001 states have internal predecessors, (1387), 0 states have call successors, (0), 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:45:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1387 transitions. [2023-02-17 05:45:09,851 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1387 transitions. Word has length 171 [2023-02-17 05:45:09,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:09,851 INFO L495 AbstractCegarLoop]: Abstraction has 1002 states and 1387 transitions. [2023-02-17 05:45:09,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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:45:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1387 transitions. [2023-02-17 05:45:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2023-02-17 05:45:09,854 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:09,854 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] [2023-02-17 05:45:09,861 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:45:10,063 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,SelfDestructingSolverStorable10 [2023-02-17 05:45:10,064 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:10,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:10,064 INFO L85 PathProgramCache]: Analyzing trace with hash 118327499, now seen corresponding path program 1 times [2023-02-17 05:45:10,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:10,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487867568] [2023-02-17 05:45:10,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:10,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:10,076 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 05:45:10,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072344390] [2023-02-17 05:45:10,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:10,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:45:10,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:45:10,077 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 05:45:10,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 05:45:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:10,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 05:45:10,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:45:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-02-17 05:45:10,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:45:10,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:10,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487867568] [2023-02-17 05:45:10,195 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 05:45:10,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072344390] [2023-02-17 05:45:10,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072344390] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:10,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:10,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:10,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666649490] [2023-02-17 05:45:10,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:10,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:10,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:10,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:10,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:10,197 INFO L87 Difference]: Start difference. First operand 1002 states and 1387 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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:45:10,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:10,307 INFO L93 Difference]: Finished difference Result 2112 states and 2980 transitions. [2023-02-17 05:45:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:10,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 201 [2023-02-17 05:45:10,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:10,310 INFO L225 Difference]: With dead ends: 2112 [2023-02-17 05:45:10,310 INFO L226 Difference]: Without dead ends: 1098 [2023-02-17 05:45:10,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 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:45:10,312 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 28 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:10,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 292 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:45:10,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2023-02-17 05:45:10,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1095. [2023-02-17 05:45:10,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1094 states have (on average 1.3720292504570384) internal successors, (1501), 1094 states have internal predecessors, (1501), 0 states have call successors, (0), 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:45:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1501 transitions. [2023-02-17 05:45:10,327 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1501 transitions. Word has length 201 [2023-02-17 05:45:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:10,327 INFO L495 AbstractCegarLoop]: Abstraction has 1095 states and 1501 transitions. [2023-02-17 05:45:10,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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:45:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1501 transitions. [2023-02-17 05:45:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2023-02-17 05:45:10,330 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:10,330 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:45:10,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 05:45:10,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:45:10,536 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:10,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:10,536 INFO L85 PathProgramCache]: Analyzing trace with hash 810941761, now seen corresponding path program 1 times [2023-02-17 05:45:10,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:10,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084430040] [2023-02-17 05:45:10,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:10,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:10,548 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 05:45:10,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2074814047] [2023-02-17 05:45:10,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:10,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:45:10,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:45:10,550 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 05:45:10,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 05:45:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:10,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 05:45:10,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:45:10,649 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2023-02-17 05:45:10,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:45:10,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:10,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084430040] [2023-02-17 05:45:10,650 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 05:45:10,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074814047] [2023-02-17 05:45:10,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074814047] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:10,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:10,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:10,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355762988] [2023-02-17 05:45:10,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:10,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:10,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:10,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:10,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:10,654 INFO L87 Difference]: Start difference. First operand 1095 states and 1501 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:45:10,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:10,736 INFO L93 Difference]: Finished difference Result 2262 states and 3091 transitions. [2023-02-17 05:45:10,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:10,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 257 [2023-02-17 05:45:10,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:10,740 INFO L225 Difference]: With dead ends: 2262 [2023-02-17 05:45:10,740 INFO L226 Difference]: Without dead ends: 1090 [2023-02-17 05:45:10,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 255 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:45:10,744 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 9 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:10,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 299 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:45:10,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2023-02-17 05:45:10,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1090. [2023-02-17 05:45:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 1089 states have (on average 1.3663911845730028) internal successors, (1488), 1089 states have internal predecessors, (1488), 0 states have call successors, (0), 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:45:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1488 transitions. [2023-02-17 05:45:10,761 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1488 transitions. Word has length 257 [2023-02-17 05:45:10,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:10,761 INFO L495 AbstractCegarLoop]: Abstraction has 1090 states and 1488 transitions. [2023-02-17 05:45:10,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:45:10,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1488 transitions. [2023-02-17 05:45:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2023-02-17 05:45:10,764 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:10,764 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] [2023-02-17 05:45:10,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 05:45:10,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:45:10,969 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:10,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:10,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1622703552, now seen corresponding path program 1 times [2023-02-17 05:45:10,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:10,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63641722] [2023-02-17 05:45:10,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:10,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:10,982 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 05:45:10,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1102783184] [2023-02-17 05:45:10,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:10,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:45:10,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:45:10,983 INFO L229 MonitoredProcess]: Starting monitored process 6 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:45:10,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 05:45:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:11,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 05:45:11,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:45:11,086 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:45:11,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:45:11,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:11,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63641722] [2023-02-17 05:45:11,087 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 05:45:11,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102783184] [2023-02-17 05:45:11,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102783184] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:11,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:11,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:11,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061406366] [2023-02-17 05:45:11,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:11,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:11,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:11,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:11,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:11,089 INFO L87 Difference]: Start difference. First operand 1090 states and 1488 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:45:11,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:11,135 INFO L93 Difference]: Finished difference Result 3111 states and 4277 transitions. [2023-02-17 05:45:11,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:11,136 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 269 [2023-02-17 05:45:11,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:11,140 INFO L225 Difference]: With dead ends: 3111 [2023-02-17 05:45:11,140 INFO L226 Difference]: Without dead ends: 1383 [2023-02-17 05:45:11,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 267 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:45:11,142 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 116 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 510 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:45:11,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 510 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:45:11,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2023-02-17 05:45:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1381. [2023-02-17 05:45:11,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1380 states have (on average 1.3695652173913044) internal successors, (1890), 1380 states have internal predecessors, (1890), 0 states have call successors, (0), 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:45:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1890 transitions. [2023-02-17 05:45:11,162 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1890 transitions. Word has length 269 [2023-02-17 05:45:11,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:11,162 INFO L495 AbstractCegarLoop]: Abstraction has 1381 states and 1890 transitions. [2023-02-17 05:45:11,162 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:45:11,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1890 transitions. [2023-02-17 05:45:11,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2023-02-17 05:45:11,165 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:11,165 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] [2023-02-17 05:45:11,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 05:45:11,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-17 05:45:11,374 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:11,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:11,374 INFO L85 PathProgramCache]: Analyzing trace with hash 746936446, now seen corresponding path program 1 times [2023-02-17 05:45:11,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:11,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359642175] [2023-02-17 05:45:11,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:11,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:11,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:11,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359642175] [2023-02-17 05:45:11,398 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 05:45:11,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774399144] [2023-02-17 05:45:11,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:11,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:45:11,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:45:11,400 INFO L229 MonitoredProcess]: Starting monitored process 7 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:45:11,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 05:45:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:11,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 05:45:11,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:45:11,502 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:45:11,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:45:11,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774399144] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:11,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:11,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:11,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135878697] [2023-02-17 05:45:11,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:11,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:11,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:11,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:11,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:11,504 INFO L87 Difference]: Start difference. First operand 1381 states and 1890 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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:45:11,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:11,597 INFO L93 Difference]: Finished difference Result 2877 states and 3987 transitions. [2023-02-17 05:45:11,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:11,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 315 [2023-02-17 05:45:11,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:11,602 INFO L225 Difference]: With dead ends: 2877 [2023-02-17 05:45:11,602 INFO L226 Difference]: Without dead ends: 1517 [2023-02-17 05:45:11,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 313 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:45:11,604 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 18 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:11,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 293 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:45:11,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2023-02-17 05:45:11,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1489. [2023-02-17 05:45:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1488 states have (on average 1.3561827956989247) internal successors, (2018), 1488 states have internal predecessors, (2018), 0 states have call successors, (0), 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:45:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 2018 transitions. [2023-02-17 05:45:11,625 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 2018 transitions. Word has length 315 [2023-02-17 05:45:11,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:11,626 INFO L495 AbstractCegarLoop]: Abstraction has 1489 states and 2018 transitions. [2023-02-17 05:45:11,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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:45:11,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 2018 transitions. [2023-02-17 05:45:11,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2023-02-17 05:45:11,629 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:11,629 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] [2023-02-17 05:45:11,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 05:45:11,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-17 05:45:11,834 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:11,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:11,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1865013778, now seen corresponding path program 1 times [2023-02-17 05:45:11,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:11,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013150805] [2023-02-17 05:45:11,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:11,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:11,849 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 05:45:11,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1528951590] [2023-02-17 05:45:11,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:11,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:45:11,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:45:11,850 INFO L229 MonitoredProcess]: Starting monitored process 8 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:45:11,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 05:45:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:11,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 05:45:11,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:45:11,968 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:45:11,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:45:11,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:11,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013150805] [2023-02-17 05:45:11,969 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 05:45:11,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528951590] [2023-02-17 05:45:11,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528951590] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:11,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:11,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:11,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35091439] [2023-02-17 05:45:11,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:11,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:11,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:11,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:11,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:11,971 INFO L87 Difference]: Start difference. First operand 1489 states and 2018 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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:45:12,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:12,069 INFO L93 Difference]: Finished difference Result 3081 states and 4219 transitions. [2023-02-17 05:45:12,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:12,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 338 [2023-02-17 05:45:12,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:12,074 INFO L225 Difference]: With dead ends: 3081 [2023-02-17 05:45:12,074 INFO L226 Difference]: Without dead ends: 1613 [2023-02-17 05:45:12,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 336 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:45:12,076 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 11 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:12,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:45:12,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2023-02-17 05:45:12,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1605. [2023-02-17 05:45:12,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.3428927680798004) internal successors, (2154), 1604 states have internal predecessors, (2154), 0 states have call successors, (0), 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:45:12,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2154 transitions. [2023-02-17 05:45:12,102 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2154 transitions. Word has length 338 [2023-02-17 05:45:12,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:12,103 INFO L495 AbstractCegarLoop]: Abstraction has 1605 states and 2154 transitions. [2023-02-17 05:45:12,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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:45:12,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2154 transitions. [2023-02-17 05:45:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2023-02-17 05:45:12,106 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:12,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:12,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-17 05:45:12,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:45:12,314 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:12,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:12,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1876884711, now seen corresponding path program 1 times [2023-02-17 05:45:12,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:12,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169466831] [2023-02-17 05:45:12,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:12,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:12,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:12,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169466831] [2023-02-17 05:45:12,343 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 05:45:12,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296954293] [2023-02-17 05:45:12,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:12,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:45:12,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:45:12,345 INFO L229 MonitoredProcess]: Starting monitored process 9 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:45:12,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 05:45:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:12,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 05:45:12,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:45:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2023-02-17 05:45:12,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:45:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2023-02-17 05:45:12,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296954293] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:45:12,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:45:12,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-02-17 05:45:12,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501616008] [2023-02-17 05:45:12,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:45:12,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 05:45:12,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:12,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 05:45:12,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 05:45:12,479 INFO L87 Difference]: Start difference. First operand 1605 states and 2154 transitions. Second operand has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:45:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:12,907 INFO L93 Difference]: Finished difference Result 5409 states and 7434 transitions. [2023-02-17 05:45:12,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 05:45:12,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 370 [2023-02-17 05:45:12,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:12,917 INFO L225 Difference]: With dead ends: 5409 [2023-02-17 05:45:12,917 INFO L226 Difference]: Without dead ends: 3652 [2023-02-17 05:45:12,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 738 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:45:12,921 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 545 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:12,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 590 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 05:45:12,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3652 states. [2023-02-17 05:45:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3652 to 2133. [2023-02-17 05:45:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 2132 states have (on average 1.420731707317073) internal successors, (3029), 2132 states have internal predecessors, (3029), 0 states have call successors, (0), 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:45:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 3029 transitions. [2023-02-17 05:45:12,960 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 3029 transitions. Word has length 370 [2023-02-17 05:45:12,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:12,960 INFO L495 AbstractCegarLoop]: Abstraction has 2133 states and 3029 transitions. [2023-02-17 05:45:12,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:45:12,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 3029 transitions. [2023-02-17 05:45:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2023-02-17 05:45:12,965 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:12,966 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:12,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-17 05:45:13,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-17 05:45:13,171 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:13,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:13,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1752367566, now seen corresponding path program 1 times [2023-02-17 05:45:13,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:13,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736445855] [2023-02-17 05:45:13,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:13,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:13,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:13,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736445855] [2023-02-17 05:45:13,203 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 05:45:13,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321799426] [2023-02-17 05:45:13,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:13,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:45:13,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:45:13,205 INFO L229 MonitoredProcess]: Starting monitored process 10 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:45:13,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-17 05:45:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:13,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 05:45:13,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:45:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2023-02-17 05:45:13,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:45:13,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321799426] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:13,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:13,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:13,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107350781] [2023-02-17 05:45:13,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:13,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:13,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:13,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:13,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:13,342 INFO L87 Difference]: Start difference. First operand 2133 states and 3029 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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:45:13,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:13,457 INFO L93 Difference]: Finished difference Result 4569 states and 6591 transitions. [2023-02-17 05:45:13,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:13,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 470 [2023-02-17 05:45:13,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:13,464 INFO L225 Difference]: With dead ends: 4569 [2023-02-17 05:45:13,464 INFO L226 Difference]: Without dead ends: 2457 [2023-02-17 05:45:13,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 468 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:45:13,468 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 11 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:13,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:45:13,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2023-02-17 05:45:13,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2439. [2023-02-17 05:45:13,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2439 states, 2438 states have (on average 1.3863822805578343) internal successors, (3380), 2438 states have internal predecessors, (3380), 0 states have call successors, (0), 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:45:13,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2439 states and 3380 transitions. [2023-02-17 05:45:13,504 INFO L78 Accepts]: Start accepts. Automaton has 2439 states and 3380 transitions. Word has length 470 [2023-02-17 05:45:13,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:13,505 INFO L495 AbstractCegarLoop]: Abstraction has 2439 states and 3380 transitions. [2023-02-17 05:45:13,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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:45:13,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 3380 transitions. [2023-02-17 05:45:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2023-02-17 05:45:13,509 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:13,509 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:13,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-17 05:45:13,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-17 05:45:13,715 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:13,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:13,716 INFO L85 PathProgramCache]: Analyzing trace with hash -742298620, now seen corresponding path program 1 times [2023-02-17 05:45:13,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:13,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114174680] [2023-02-17 05:45:13,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:13,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:13,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:13,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114174680] [2023-02-17 05:45:13,751 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 05:45:13,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449238724] [2023-02-17 05:45:13,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:13,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:45:13,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:45:13,753 INFO L229 MonitoredProcess]: Starting monitored process 11 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:45:13,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-17 05:45:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:13,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 05:45:13,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:45:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2023-02-17 05:45:13,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:45:13,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449238724] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:13,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:13,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:13,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915403989] [2023-02-17 05:45:13,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:13,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:13,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:13,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:13,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:13,896 INFO L87 Difference]: Start difference. First operand 2439 states and 3380 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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:45:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:14,007 INFO L93 Difference]: Finished difference Result 5044 states and 7061 transitions. [2023-02-17 05:45:14,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:14,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 532 [2023-02-17 05:45:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:14,014 INFO L225 Difference]: With dead ends: 5044 [2023-02-17 05:45:14,014 INFO L226 Difference]: Without dead ends: 2626 [2023-02-17 05:45:14,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 530 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:45:14,016 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 11 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:14,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:45:14,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states. [2023-02-17 05:45:14,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2256. [2023-02-17 05:45:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 2255 states have (on average 1.366740576496674) internal successors, (3082), 2255 states have internal predecessors, (3082), 0 states have call successors, (0), 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:45:14,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3082 transitions. [2023-02-17 05:45:14,085 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3082 transitions. Word has length 532 [2023-02-17 05:45:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:14,085 INFO L495 AbstractCegarLoop]: Abstraction has 2256 states and 3082 transitions. [2023-02-17 05:45:14,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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:45:14,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3082 transitions. [2023-02-17 05:45:14,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2023-02-17 05:45:14,088 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:14,089 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, 11, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:45:14,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-17 05:45:14,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:45:14,294 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:14,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:14,295 INFO L85 PathProgramCache]: Analyzing trace with hash 478731582, now seen corresponding path program 1 times [2023-02-17 05:45:14,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:14,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533632549] [2023-02-17 05:45:14,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:14,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:14,315 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 05:45:14,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1573855804] [2023-02-17 05:45:14,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:14,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:45:14,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:45:14,316 INFO L229 MonitoredProcess]: Starting monitored process 12 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:45:14,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-17 05:45:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:14,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 05:45:14,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:45:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3956 backedges. 2220 proven. 0 refuted. 0 times theorem prover too weak. 1736 trivial. 0 not checked. [2023-02-17 05:45:14,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:45:14,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:14,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533632549] [2023-02-17 05:45:14,468 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 05:45:14,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573855804] [2023-02-17 05:45:14,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573855804] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:14,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:14,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:14,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119226216] [2023-02-17 05:45:14,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:14,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:14,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:14,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:14,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:14,470 INFO L87 Difference]: Start difference. First operand 2256 states and 3082 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:45:14,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:14,558 INFO L93 Difference]: Finished difference Result 4127 states and 5520 transitions. [2023-02-17 05:45:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:14,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 588 [2023-02-17 05:45:14,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:14,562 INFO L225 Difference]: With dead ends: 4127 [2023-02-17 05:45:14,563 INFO L226 Difference]: Without dead ends: 1776 [2023-02-17 05:45:14,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 586 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:45:14,566 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:14,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 264 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:45:14,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2023-02-17 05:45:14,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1776. [2023-02-17 05:45:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1775 states have (on average 1.2569014084507042) internal successors, (2231), 1775 states have internal predecessors, (2231), 0 states have call successors, (0), 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:45:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2231 transitions. [2023-02-17 05:45:14,594 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2231 transitions. Word has length 588 [2023-02-17 05:45:14,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:14,594 INFO L495 AbstractCegarLoop]: Abstraction has 1776 states and 2231 transitions. [2023-02-17 05:45:14,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:45:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2231 transitions. [2023-02-17 05:45:14,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2023-02-17 05:45:14,597 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:14,597 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:14,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-17 05:45:14,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:45:14,803 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:14,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:14,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1835374162, now seen corresponding path program 1 times [2023-02-17 05:45:14,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:14,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327988443] [2023-02-17 05:45:14,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:14,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:14,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:14,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327988443] [2023-02-17 05:45:14,850 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 05:45:14,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487210547] [2023-02-17 05:45:14,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:14,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:45:14,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:45:14,852 INFO L229 MonitoredProcess]: Starting monitored process 13 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:45:14,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-17 05:45:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:14,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 05:45:14,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:45:15,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2023-02-17 05:45:15,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:45:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2023-02-17 05:45:15,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487210547] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:45:15,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:45:15,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-02-17 05:45:15,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361407592] [2023-02-17 05:45:15,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:45:15,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 05:45:15,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:15,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 05:45:15,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 05:45:15,035 INFO L87 Difference]: Start difference. First operand 1776 states and 2231 transitions. Second operand has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 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:45:15,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:15,459 INFO L93 Difference]: Finished difference Result 5510 states and 7035 transitions. [2023-02-17 05:45:15,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 05:45:15,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 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 598 [2023-02-17 05:45:15,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:15,470 INFO L225 Difference]: With dead ends: 5510 [2023-02-17 05:45:15,470 INFO L226 Difference]: Without dead ends: 3642 [2023-02-17 05:45:15,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1200 GetRequests, 1193 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-02-17 05:45:15,474 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 332 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:15,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 968 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 05:45:15,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3642 states. [2023-02-17 05:45:15,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3642 to 2178. [2023-02-17 05:45:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2178 states, 2177 states have (on average 1.3100597152044098) internal successors, (2852), 2177 states have internal predecessors, (2852), 0 states have call successors, (0), 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:45:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 2852 transitions. [2023-02-17 05:45:15,524 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 2852 transitions. Word has length 598 [2023-02-17 05:45:15,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:15,524 INFO L495 AbstractCegarLoop]: Abstraction has 2178 states and 2852 transitions. [2023-02-17 05:45:15,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 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:45:15,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 2852 transitions. [2023-02-17 05:45:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2023-02-17 05:45:15,539 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:15,539 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 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, 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] [2023-02-17 05:45:15,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-17 05:45:15,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-17 05:45:15,745 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:15,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:15,745 INFO L85 PathProgramCache]: Analyzing trace with hash 465535293, now seen corresponding path program 1 times [2023-02-17 05:45:15,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:45:15,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336799399] [2023-02-17 05:45:15,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:15,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:45:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:15,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:45:15,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336799399] [2023-02-17 05:45:15,799 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 05:45:15,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503447578] [2023-02-17 05:45:15,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:15,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:45:15,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:45:15,801 INFO L229 MonitoredProcess]: Starting monitored process 14 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:45:15,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-17 05:45:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:15,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 1110 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 05:45:15,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:45:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5990 backedges. 3252 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2023-02-17 05:45:15,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:45:15,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503447578] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:45:15,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:45:15,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:45:15,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709759363] [2023-02-17 05:45:15,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:45:15,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:45:15,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:45:15,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:45:15,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:45:15,981 INFO L87 Difference]: Start difference. First operand 2178 states and 2852 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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:45:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:16,057 INFO L93 Difference]: Finished difference Result 2777 states and 3618 transitions. [2023-02-17 05:45:16,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:45:16,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 722 [2023-02-17 05:45:16,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:16,058 INFO L225 Difference]: With dead ends: 2777 [2023-02-17 05:45:16,058 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 05:45:16,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 721 GetRequests, 720 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:45:16,061 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 120 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:16,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 146 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:45:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 05:45:16,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 05:45:16,062 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:45:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 05:45:16,062 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 722 [2023-02-17 05:45:16,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:16,063 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 05:45:16,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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:45:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 05:45:16,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 05:45:16,065 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 05:45:16,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-17 05:45:16,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-17 05:45:16,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 05:45:16,289 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 536) no Hoare annotation was computed. [2023-02-17 05:45:16,289 INFO L899 garLoopResultBuilder]: For program point L399(lines 399 405) no Hoare annotation was computed. [2023-02-17 05:45:16,289 INFO L899 garLoopResultBuilder]: For program point L366(lines 366 385) no Hoare annotation was computed. [2023-02-17 05:45:16,290 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8593#1(lines 184 611) the Hoare annotation is: (let ((.cse3 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8656)) (.cse6 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse1 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and .cse0 .cse1 .cse2 .cse5 .cse4) (and .cse0 .cse6 .cse2) (and .cse0 .cse1 .cse2 .cse3) (and (or (and .cse0 .cse1 .cse6 .cse5 .cse4) (and .cse0 .cse1 .cse6 .cse5) (and .cse0 .cse1 .cse6 .cse4) (and .cse0 .cse1 .cse6)) (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (and .cse0 .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse2 .cse5))) [2023-02-17 05:45:16,290 INFO L899 garLoopResultBuilder]: For program point L565(lines 565 569) no Hoare annotation was computed. [2023-02-17 05:45:16,290 INFO L899 garLoopResultBuilder]: For program point L499(lines 499 503) no Hoare annotation was computed. [2023-02-17 05:45:16,290 INFO L899 garLoopResultBuilder]: For program point L367(lines 367 371) no Hoare annotation was computed. [2023-02-17 05:45:16,290 INFO L899 garLoopResultBuilder]: For program point L367-2(lines 366 383) no Hoare annotation was computed. [2023-02-17 05:45:16,290 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8529#1(lines 157 620) the Hoare annotation is: (let ((.cse1 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and .cse0 .cse2 .cse1) (and (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (let ((.cse3 (let ((.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse5) (and .cse0 .cse2 .cse5)))) (.cse4 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse3 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse4) (and .cse3 .cse4) (and .cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3) .cse4)))))) [2023-02-17 05:45:16,290 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 605) no Hoare annotation was computed. [2023-02-17 05:45:16,290 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 616) no Hoare annotation was computed. [2023-02-17 05:45:16,290 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 627) no Hoare annotation was computed. [2023-02-17 05:45:16,290 INFO L899 garLoopResultBuilder]: For program point L467(lines 467 471) no Hoare annotation was computed. [2023-02-17 05:45:16,291 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8497#1(lines 145 624) the Hoare annotation is: (let ((.cse0 (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse3 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse2 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse7 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse10 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse6 (= 1 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|))) (or (and .cse0 (let ((.cse1 (or (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse6 .cse7)))) (or (and .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3) .cse2)))) (and .cse4 .cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and .cse0 (let ((.cse9 (or (and .cse4 .cse10 .cse5 .cse7) (and .cse4 .cse10 .cse7)))) (or (and .cse9 .cse3 .cse2) (and .cse9 .cse2)))) (and .cse4 .cse10 .cse8) (and .cse4 .cse8 .cse6))) [2023-02-17 05:45:16,291 INFO L899 garLoopResultBuilder]: For program point L335-1(lines 335 344) no Hoare annotation was computed. [2023-02-17 05:45:16,291 INFO L902 garLoopResultBuilder]: At program point L667(lines 74 684) the Hoare annotation is: true [2023-02-17 05:45:16,291 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8482#1(lines 133 628) 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:45:16,291 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 604) no Hoare annotation was computed. [2023-02-17 05:45:16,291 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 615) no Hoare annotation was computed. [2023-02-17 05:45:16,291 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 626) no Hoare annotation was computed. [2023-02-17 05:45:16,291 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 256) no Hoare annotation was computed. [2023-02-17 05:45:16,291 INFO L899 garLoopResultBuilder]: For program point L239-2(lines 219 597) no Hoare annotation was computed. [2023-02-17 05:45:16,291 INFO L899 garLoopResultBuilder]: For program point L636(lines 636 664) no Hoare annotation was computed. [2023-02-17 05:45:16,291 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 343) no Hoare annotation was computed. [2023-02-17 05:45:16,291 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 661) no Hoare annotation was computed. [2023-02-17 05:45:16,291 INFO L899 garLoopResultBuilder]: For program point L571(lines 571 575) no Hoare annotation was computed. [2023-02-17 05:45:16,291 INFO L899 garLoopResultBuilder]: For program point L538(lines 538 542) no Hoare annotation was computed. [2023-02-17 05:45:16,291 INFO L899 garLoopResultBuilder]: For program point L571-2(lines 571 575) no Hoare annotation was computed. [2023-02-17 05:45:16,291 INFO L899 garLoopResultBuilder]: For program point L472(lines 472 483) no Hoare annotation was computed. [2023-02-17 05:45:16,291 INFO L899 garLoopResultBuilder]: For program point L538-2(lines 219 597) no Hoare annotation was computed. [2023-02-17 05:45:16,291 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 443) no Hoare annotation was computed. [2023-02-17 05:45:16,291 INFO L895 garLoopResultBuilder]: At program point L373(lines 356 391) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and (let ((.cse0 (let ((.cse4 (<= |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) .cse4) (and .cse2 .cse3 .cse4)))) (.cse1 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse1) (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3) .cse1) (and .cse0 .cse1))) (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (and .cse2 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and .cse2 .cse3 .cse5))) [2023-02-17 05:45:16,291 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 246) no Hoare annotation was computed. [2023-02-17 05:45:16,291 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 603) no Hoare annotation was computed. [2023-02-17 05:45:16,292 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 614) no Hoare annotation was computed. [2023-02-17 05:45:16,292 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 625) no Hoare annotation was computed. [2023-02-17 05:45:16,292 INFO L895 garLoopResultBuilder]: At program point L109-2(lines 109 666) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse9 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (let ((.cse33 (and .cse0 .cse1 .cse7 .cse9)) (.cse12 (and .cse1 .cse7 .cse9)) (.cse22 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (let ((.cse17 (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse28 (= 1 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse25 (let ((.cse36 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8656))) (or (and .cse0 .cse22 .cse2 .cse36) (and .cse22 .cse2 .cse36)))) (.cse5 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8656)) 0)) (.cse31 (or .cse33 .cse12)) (.cse21 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3)) (.cse18 (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse24 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608)) (.cse23 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (.cse3 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8496)) 0)) (.cse26 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8464)) (.cse14 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse10 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3)) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse8 (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse11 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (.cse20 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8528)) 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse4) (and .cse0 .cse2 .cse5 .cse6) (and .cse0 .cse7 .cse4 .cse8 .cse9 .cse6 .cse10 .cse11) .cse12 (and .cse0 .cse2 .cse6) (and (let ((.cse13 (or (and .cse0 .cse1 .cse3 .cse9) (and .cse0 .cse1 .cse7 .cse3 .cse9)))) (or (and .cse13 .cse14 .cse11) (and .cse13 .cse11))) .cse8) (and .cse8 (let ((.cse15 (let ((.cse16 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8512)) 0))) (or (and .cse0 .cse1 .cse16 .cse9) (and .cse0 .cse1 .cse7 .cse16 .cse9))))) (or (and .cse15 .cse14 .cse11) (and .cse15 .cse11) (and .cse15 .cse10 .cse11)))) (and .cse0 .cse2 .cse6 .cse17) (and .cse8 (or (and .cse0 .cse7 .cse6 .cse17) (and .cse0 .cse6 .cse17)) .cse18) (and (let ((.cse19 (or (and .cse20 .cse0 .cse1 .cse9) (and .cse20 .cse0 .cse1 .cse7 .cse9)))) (or (and .cse19 .cse10 .cse11) (and .cse19 .cse11) (and .cse19 .cse14 .cse11))) .cse8) (and (or (and .cse7 .cse9 .cse6) (and .cse0 .cse7 .cse9 .cse6)) .cse21 .cse10) (and .cse0 .cse22 .cse2 .cse23) (and .cse0 .cse22 .cse1 .cse8 .cse18) (and .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse26) (and (let ((.cse27 (or (and .cse0 .cse28 .cse3 .cse9) (and .cse0 .cse7 .cse28 .cse3 .cse9)))) (or (and .cse27 .cse10 .cse11) (and .cse27 .cse11) (and .cse27 .cse14 .cse11))) .cse8) (and .cse21 (or (and .cse0 .cse7 .cse9) (and .cse7 .cse9)) .cse10) (and (let ((.cse29 (let ((.cse30 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8560))) (or (and .cse0 .cse1 .cse30 .cse9) (and .cse0 .cse1 .cse30 .cse7 .cse9))))) (or (and .cse29 .cse11) (and .cse29 .cse10 .cse11) (and .cse29 .cse14 .cse11))) .cse8) (and (or (and .cse0 .cse1 .cse7 .cse5) (and .cse0 .cse1 .cse5)) .cse8 .cse18) (and .cse31 .cse14 .cse11) (and .cse0 .cse1 .cse7 .cse4 .cse8 .cse9 .cse14 .cse11) (and .cse0 .cse21 .cse4 .cse6) (and .cse0 .cse2 .cse28 .cse3) (and .cse8 (let ((.cse32 (or (and .cse0 .cse1 .cse7 .cse9 .cse26) (and .cse0 .cse1 .cse9 .cse26)))) (or (and .cse32 .cse11) (and .cse32 .cse14 .cse11)))) (and .cse23 .cse25) (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse6 .cse26) (and .cse0 .cse1 .cse2 .cse5) .cse33 (and .cse8 .cse31 .cse11) (and .cse0 .cse21 .cse4) (and .cse0 .cse22 .cse2 .cse24) (and .cse0 .cse22 .cse2 .cse7 .cse24) (and .cse0 .cse22 .cse2 .cse7 .cse23) (and .cse0 .cse21 .cse1 .cse4) (and .cse2 .cse6) (and .cse0 .cse22 .cse2 .cse18) (and .cse8 (or (and .cse0 .cse22 .cse1 .cse24) (and .cse0 .cse22 .cse1 .cse7 .cse24))) (and .cse8 (or (and .cse0 .cse22 .cse1 .cse7 .cse23) (and .cse0 .cse22 .cse1 .cse23))) (and .cse0 .cse2 .cse3 .cse6) (and .cse0 (= 0 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse8 .cse9 .cse26 .cse11) (and .cse8 (let ((.cse34 (let ((.cse35 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8544))) (or (and .cse0 .cse35 .cse1 .cse9) (and .cse0 .cse35 .cse1 .cse7 .cse9))))) (or (and .cse34 .cse11) (and .cse34 .cse14 .cse11) (and .cse34 .cse10 .cse11)))) (and .cse0 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse7 .cse4 .cse8 .cse9 .cse11) (and .cse1 .cse2) (and .cse20 .cse0 .cse2 .cse6) (and .cse20 .cse0 .cse1 .cse2))))) [2023-02-17 05:45:16,292 INFO L899 garLoopResultBuilder]: For program point L671(lines 671 675) no Hoare annotation was computed. [2023-02-17 05:45:16,293 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 647) no Hoare annotation was computed. [2023-02-17 05:45:16,293 INFO L899 garLoopResultBuilder]: For program point L671-2(lines 671 675) no Hoare annotation was computed. [2023-02-17 05:45:16,293 INFO L899 garLoopResultBuilder]: For program point L638-2(lines 637 659) no Hoare annotation was computed. [2023-02-17 05:45:16,293 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2023-02-17 05:45:16,293 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 686 697) the Hoare annotation is: true [2023-02-17 05:45:16,293 INFO L899 garLoopResultBuilder]: For program point L375(lines 375 379) no Hoare annotation was computed. [2023-02-17 05:45:16,293 INFO L899 garLoopResultBuilder]: For program point L640(lines 640 644) no Hoare annotation was computed. [2023-02-17 05:45:16,293 INFO L899 garLoopResultBuilder]: For program point L409(lines 409 415) no Hoare annotation was computed. [2023-02-17 05:45:16,293 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8481#1(lines 127 630) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (let ((.cse2 (let ((.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse4 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse5) (and .cse0 .cse4 .cse5)))) (.cse3 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse2 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse3) (and .cse2 .cse3)))) (and .cse0 .cse4 .cse1))) [2023-02-17 05:45:16,293 INFO L899 garLoopResultBuilder]: For program point L211(lines 211 602) no Hoare annotation was computed. [2023-02-17 05:45:16,293 INFO L899 garLoopResultBuilder]: For program point L178(lines 178 613) no Hoare annotation was computed. [2023-02-17 05:45:16,295 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 624) no Hoare annotation was computed. [2023-02-17 05:45:16,295 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 635) no Hoare annotation was computed. [2023-02-17 05:45:16,295 INFO L899 garLoopResultBuilder]: For program point L476(lines 476 480) no Hoare annotation was computed. [2023-02-17 05:45:16,295 INFO L899 garLoopResultBuilder]: For program point L511(lines 511 515) no Hoare annotation was computed. [2023-02-17 05:45:16,295 INFO L899 garLoopResultBuilder]: For program point L511-2(lines 219 597) no Hoare annotation was computed. [2023-02-17 05:45:16,296 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 252) no Hoare annotation was computed. [2023-02-17 05:45:16,296 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 601) no Hoare annotation was computed. [2023-02-17 05:45:16,296 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 612) no Hoare annotation was computed. [2023-02-17 05:45:16,296 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 623) no Hoare annotation was computed. [2023-02-17 05:45:16,296 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 634) no Hoare annotation was computed. [2023-02-17 05:45:16,296 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 91) no Hoare annotation was computed. [2023-02-17 05:45:16,296 INFO L899 garLoopResultBuilder]: For program point L282(lines 282 286) no Hoare annotation was computed. [2023-02-17 05:45:16,296 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8657#1(lines 202 605) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (or (and .cse0 .cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (and .cse0 .cse2)) (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (and .cse0 .cse2 .cse1))) [2023-02-17 05:45:16,296 INFO L899 garLoopResultBuilder]: For program point L316(lines 316 320) no Hoare annotation was computed. [2023-02-17 05:45:16,297 INFO L899 garLoopResultBuilder]: For program point L316-2(lines 219 597) no Hoare annotation was computed. [2023-02-17 05:45:16,297 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 611) no Hoare annotation was computed. [2023-02-17 05:45:16,297 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 622) no Hoare annotation was computed. [2023-02-17 05:45:16,297 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 633) no Hoare annotation was computed. [2023-02-17 05:45:16,297 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 591) no Hoare annotation was computed. [2023-02-17 05:45:16,297 INFO L899 garLoopResultBuilder]: For program point L581-1(lines 581 591) no Hoare annotation was computed. [2023-02-17 05:45:16,297 INFO L899 garLoopResultBuilder]: For program point L449-1(lines 449 461) no Hoare annotation was computed. [2023-02-17 05:45:16,297 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2023-02-17 05:45:16,298 INFO L899 garLoopResultBuilder]: For program point L86-2(lines 83 91) no Hoare annotation was computed. [2023-02-17 05:45:16,298 INFO L895 garLoopResultBuilder]: At program point L417(lines 408 428) the Hoare annotation is: (let ((.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse6 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (let ((.cse0 (let ((.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse3 (or (and .cse4 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8544) .cse5) (and .cse4 .cse5)))) (or (and (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse2 .cse3) (and .cse2 .cse3)))) (.cse1 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3) .cse1) (and .cse0 .cse1) (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse1)))) (and .cse4 .cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and .cse4 .cse5 .cse6))) [2023-02-17 05:45:16,298 INFO L899 garLoopResultBuilder]: For program point L351(lines 351 355) no Hoare annotation was computed. [2023-02-17 05:45:16,298 INFO L899 garLoopResultBuilder]: For program point L351-2(lines 219 597) no Hoare annotation was computed. [2023-02-17 05:45:16,299 INFO L902 garLoopResultBuilder]: At program point L682(lines 74 684) the Hoare annotation is: true [2023-02-17 05:45:16,299 INFO L899 garLoopResultBuilder]: For program point L649(lines 649 655) no Hoare annotation was computed. [2023-02-17 05:45:16,299 INFO L899 garLoopResultBuilder]: For program point L550(lines 550 555) no Hoare annotation was computed. [2023-02-17 05:45:16,299 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 610) no Hoare annotation was computed. [2023-02-17 05:45:16,300 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 621) no Hoare annotation was computed. [2023-02-17 05:45:16,300 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 632) no Hoare annotation was computed. [2023-02-17 05:45:16,300 INFO L902 garLoopResultBuilder]: At program point ssl3_accept_switch_1_3#1(lines 214 601) the Hoare annotation is: true [2023-02-17 05:45:16,300 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 588) no Hoare annotation was computed. [2023-02-17 05:45:16,300 INFO L899 garLoopResultBuilder]: For program point L452(lines 452 457) no Hoare annotation was computed. [2023-02-17 05:45:16,300 INFO L895 garLoopResultBuilder]: At program point $Ultimate##173(lines 449 461) the Hoare annotation is: (let ((.cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse8 (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.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)) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3)) (.cse7 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse4 .cse3 .cse8 .cse5 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse7) (and .cse0 .cse2 .cse3 .cse9) (and .cse0 .cse1 .cse4 .cse3 .cse8 .cse5 .cse7) (and .cse0 .cse4 .cse3 .cse5 .cse9 .cse6 .cse7))) [2023-02-17 05:45:16,300 INFO L902 garLoopResultBuilder]: At program point ssl3_accept_switch_1_default#1(lines 217 600) the Hoare annotation is: true [2023-02-17 05:45:16,300 INFO L899 garLoopResultBuilder]: For program point L420(lines 420 424) no Hoare annotation was computed. [2023-02-17 05:45:16,301 INFO L895 garLoopResultBuilder]: At program point L222(lines 115 634) the Hoare annotation is: (let ((.cse8 (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (let ((.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse4 (let ((.cse10 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|))) (or (and .cse10 .cse8) .cse10))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448))) (let ((.cse5 (let ((.cse9 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse4 .cse3 .cse9) (and .cse1 .cse4 .cse3 .cse9)))) (.cse6 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (let ((.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3))) (or (and .cse7 .cse8) .cse7))) (.cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse5 .cse6) (and .cse5 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse2 .cse4) (and .cse0 .cse2))))) [2023-02-17 05:45:16,301 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8577#1(lines 178 613) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (let ((.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576))) (or (and .cse0 .cse2 .cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse0 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse2 .cse3)))) (and .cse0 .cse2 .cse1))) [2023-02-17 05:45:16,301 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 05:45:16,301 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 609) no Hoare annotation was computed. [2023-02-17 05:45:16,301 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 620) no Hoare annotation was computed. [2023-02-17 05:45:16,301 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 631) no Hoare annotation was computed. [2023-02-17 05:45:16,301 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8641#1(lines 196 607) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1) (and (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (let ((.cse2 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse2 .cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (and .cse0 .cse2 .cse3))) (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and .cse0 .cse3 .cse1))) [2023-02-17 05:45:16,301 INFO L899 garLoopResultBuilder]: For program point L521(lines 521 525) no Hoare annotation was computed. [2023-02-17 05:45:16,302 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2023-02-17 05:45:16,302 INFO L899 garLoopResultBuilder]: For program point L521-2(lines 521 525) no Hoare annotation was computed. [2023-02-17 05:45:16,302 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_ERROR#1(lines 74 684) the Hoare annotation is: false [2023-02-17 05:45:16,302 INFO L902 garLoopResultBuilder]: At program point ssl3_accept_returnLabel#1(lines 19 685) the Hoare annotation is: true [2023-02-17 05:45:16,302 INFO L895 garLoopResultBuilder]: At program point $Ultimate##127(lines 335 344) the Hoare annotation is: (let ((.cse1 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and .cse0 .cse2 .cse1) (and (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (let ((.cse3 (let ((.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse5) (and .cse0 .cse2 .cse5)))) (.cse4 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse3 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse4) (and .cse3 .cse4) (and .cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3) .cse4)))))) [2023-02-17 05:45:16,302 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2023-02-17 05:45:16,302 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 74 684) no Hoare annotation was computed. [2023-02-17 05:45:16,302 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 608) no Hoare annotation was computed. [2023-02-17 05:45:16,302 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 619) no Hoare annotation was computed. [2023-02-17 05:45:16,303 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 630) no Hoare annotation was computed. [2023-02-17 05:45:16,303 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2023-02-17 05:45:16,303 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 05:45:16,303 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8673#1(lines 208 603) the Hoare annotation is: (let ((.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (.cse5 (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (let ((.cse1 (and .cse6 .cse7 .cse5)) (.cse2 (and .cse7 .cse5))) (let ((.cse0 (or .cse1 .cse2)) (.cse3 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (or (and (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse0) .cse1 .cse2) (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (and .cse3 .cse0) (and .cse3 (let ((.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|))) (or (and .cse4 .cse5) (and .cse6 .cse4 .cse5)))))))) [2023-02-17 05:45:16,303 INFO L899 garLoopResultBuilder]: For program point L359(lines 359 390) no Hoare annotation was computed. [2023-02-17 05:45:16,303 INFO L899 garLoopResultBuilder]: For program point L326(lines 326 330) no Hoare annotation was computed. [2023-02-17 05:45:16,303 INFO L899 garLoopResultBuilder]: For program point L326-2(lines 326 330) no Hoare annotation was computed. [2023-02-17 05:45:16,303 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 231) no Hoare annotation was computed. [2023-02-17 05:45:16,303 INFO L899 garLoopResultBuilder]: For program point L227-2(lines 219 597) no Hoare annotation was computed. [2023-02-17 05:45:16,304 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8609#1(lines 190 609) the Hoare annotation is: (let ((.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse6 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (let ((.cse7 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (and .cse1 .cse6 .cse2)) (.cse9 (and .cse1 .cse6 .cse2 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8656))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608)) (.cse10 (and .cse1 .cse6 .cse2 .cse8))) (or .cse0 (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and (let ((.cse3 (and .cse1 .cse6 .cse7 .cse8)) (.cse4 (and .cse1 .cse6 .cse7))) (or (and (or .cse3 .cse4) .cse5) .cse3 .cse4)) (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) .cse9 (and .cse1 .cse7 .cse2) (and (or .cse0 .cse9 .cse10) .cse5) .cse10))) [2023-02-17 05:45:16,304 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 05:45:16,304 INFO L895 garLoopResultBuilder]: At program point $Ultimate##155(lines 397 434) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse6 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (let ((.cse2 (let ((.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse5 (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8544) .cse6) (and .cse0 .cse6)))) (or (and (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse4 .cse5) (and .cse4 .cse5)))) (.cse3 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3) .cse3) (and .cse2 .cse3) (and .cse2 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse3)))) (and .cse0 .cse6 .cse1))) [2023-02-17 05:45:16,304 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8466#1(lines 136 627) the Hoare annotation is: (let ((.cse2 (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and .cse2 (let ((.cse3 (or (and .cse0 .cse5 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse5 .cse6)))) (or (and .cse3 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse4) (and .cse3 .cse4)))) (and .cse0 (= 0 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse6 .cse4) (and .cse0 .cse5 .cse1))) [2023-02-17 05:45:16,304 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_12292#1(lines 112 635) the Hoare annotation is: (let ((.cse0 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse1 (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3) .cse1))) [2023-02-17 05:45:16,304 INFO L895 garLoopResultBuilder]: At program point $Ultimate##163(lines 408 428) the Hoare annotation is: (let ((.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse6 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (let ((.cse0 (let ((.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse3 (or (and .cse4 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8544) .cse5) (and .cse4 .cse5)))) (or (and (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse2 .cse3) (and .cse2 .cse3)))) (.cse1 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3) .cse1) (and .cse0 .cse1) (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse1)))) (and .cse4 .cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and .cse4 .cse5 .cse6))) [2023-02-17 05:45:16,304 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 607) no Hoare annotation was computed. [2023-02-17 05:45:16,305 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 618) no Hoare annotation was computed. [2023-02-17 05:45:16,305 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 629) no Hoare annotation was computed. [2023-02-17 05:45:16,305 INFO L899 garLoopResultBuilder]: For program point L560(lines 560 564) no Hoare annotation was computed. [2023-02-17 05:45:16,305 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 389) no Hoare annotation was computed. [2023-02-17 05:45:16,305 INFO L899 garLoopResultBuilder]: For program point L362-1(lines 362 389) no Hoare annotation was computed. [2023-02-17 05:45:16,305 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 05:45:16,306 INFO L895 garLoopResultBuilder]: At program point $Ultimate##219(lines 636 664) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse9 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (let ((.cse33 (and .cse0 .cse1 .cse7 .cse9)) (.cse12 (and .cse1 .cse7 .cse9)) (.cse22 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (let ((.cse17 (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse28 (= 1 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse25 (let ((.cse36 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8656))) (or (and .cse0 .cse22 .cse2 .cse36) (and .cse22 .cse2 .cse36)))) (.cse26 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8464)) (.cse5 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8656)) 0)) (.cse31 (or .cse33 .cse12)) (.cse21 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3)) (.cse18 (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse24 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608)) (.cse23 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (.cse3 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8496)) 0)) (.cse14 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse10 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3)) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse8 (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse11 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (.cse20 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8528)) 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse4) (and .cse0 .cse2 .cse5 .cse6) (and .cse0 .cse7 .cse4 .cse8 .cse9 .cse6 .cse10 .cse11) .cse12 (and .cse8 (let ((.cse13 (let ((.cse15 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| (- 8512)) 0))) (or (and .cse0 .cse1 .cse15 .cse9) (and .cse0 .cse1 .cse7 .cse15 .cse9))))) (or (and .cse13 .cse14 .cse11) (and .cse13 .cse11) (and .cse13 .cse10 .cse11)))) (and (let ((.cse16 (or (and .cse0 .cse1 .cse3 .cse9) (and .cse0 .cse1 .cse7 .cse3 .cse9)))) (or (and .cse16 .cse14 .cse11) (and .cse16 .cse11))) .cse8) (and .cse0 .cse2 .cse6) (and .cse0 .cse2 .cse6 .cse17) (and .cse8 (or (and .cse0 .cse7 .cse6 .cse17) (and .cse0 .cse6 .cse17)) .cse18) (and (let ((.cse19 (or (and .cse20 .cse0 .cse1 .cse9) (and .cse20 .cse0 .cse1 .cse7 .cse9)))) (or (and .cse19 .cse10 .cse11) (and .cse19 .cse11) (and .cse19 .cse14 .cse11))) .cse8) (and (or (and .cse7 .cse9 .cse6) (and .cse0 .cse7 .cse9 .cse6)) .cse21 .cse10) (and .cse0 .cse22 .cse2 .cse23) (and .cse0 .cse22 .cse1 .cse8 .cse18) (and .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse26) (and (let ((.cse27 (or (and .cse0 .cse28 .cse3 .cse9) (and .cse0 .cse7 .cse28 .cse3 .cse9)))) (or (and .cse27 .cse10 .cse11) (and .cse27 .cse11) (and .cse27 .cse14 .cse11))) .cse8) (and .cse21 (or (and .cse0 .cse7 .cse9) (and .cse7 .cse9)) .cse10) (and (let ((.cse29 (let ((.cse30 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8560))) (or (and .cse0 .cse1 .cse30 .cse9) (and .cse0 .cse1 .cse30 .cse7 .cse9))))) (or (and .cse29 .cse11) (and .cse29 .cse10 .cse11) (and .cse29 .cse14 .cse11))) .cse8) (and (or (and .cse0 .cse1 .cse7 .cse5) (and .cse0 .cse1 .cse5)) .cse8 .cse18) (and .cse31 .cse14 .cse11) (and .cse0 .cse1 .cse7 .cse4 .cse8 .cse9 .cse14 .cse11) (and .cse0 .cse2 .cse28 .cse3) (and .cse0 .cse21 .cse4 .cse6) (and .cse8 (let ((.cse32 (or (and .cse0 .cse1 .cse7 .cse9 .cse26) (and .cse0 .cse1 .cse9 .cse26)))) (or (and .cse32 .cse11) (and .cse32 .cse14 .cse11)))) (and .cse23 .cse25) (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse6 .cse26) (and .cse0 .cse1 .cse2 .cse5) .cse33 (and .cse8 .cse31 .cse11) (and .cse0 .cse21 .cse4) (and .cse0 .cse22 .cse2 .cse24) (and .cse0 .cse22 .cse2 .cse7 .cse24) (and .cse0 .cse22 .cse2 .cse7 .cse23) (and .cse0 .cse21 .cse1 .cse4) (and .cse2 .cse6) (and .cse0 .cse22 .cse2 .cse18) (and .cse8 (or (and .cse0 .cse22 .cse1 .cse24) (and .cse0 .cse22 .cse1 .cse7 .cse24))) (and .cse8 (or (and .cse0 .cse22 .cse1 .cse7 .cse23) (and .cse0 .cse22 .cse1 .cse23))) (and .cse0 .cse2 .cse3 .cse6) (and .cse8 (let ((.cse34 (let ((.cse35 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8544))) (or (and .cse0 .cse35 .cse1 .cse9) (and .cse0 .cse35 .cse1 .cse7 .cse9))))) (or (and .cse34 .cse11) (and .cse34 .cse14 .cse11) (and .cse34 .cse10 .cse11)))) (and .cse0 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse7 .cse4 .cse8 .cse9 .cse11) (and .cse1 .cse2) (and .cse20 .cse0 .cse2 .cse6) (and .cse20 .cse0 .cse1 .cse2))))) [2023-02-17 05:45:16,306 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 678) no Hoare annotation was computed. [2023-02-17 05:45:16,306 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 386) no Hoare annotation was computed. [2023-02-17 05:45:16,306 INFO L899 garLoopResultBuilder]: For program point L264(lines 264 276) no Hoare annotation was computed. [2023-02-17 05:45:16,306 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8561#1(lines 169 616) the Hoare annotation is: (let ((.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse6 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and (let ((.cse0 (let ((.cse2 (or (and .cse4 .cse5) (and .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8560)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse3) (and .cse2 .cse3)))) (.cse1 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse1) (and .cse0 .cse1) (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3) .cse1))) (>= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (and .cse4 .cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and .cse4 .cse5 .cse6))) [2023-02-17 05:45:16,307 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 270) no Hoare annotation was computed. [2023-02-17 05:45:16,307 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 606) no Hoare annotation was computed. [2023-02-17 05:45:16,307 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 617) no Hoare annotation was computed. [2023-02-17 05:45:16,307 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 628) no Hoare annotation was computed. [2023-02-17 05:45:16,307 INFO L899 garLoopResultBuilder]: For program point L398(lines 398 429) no Hoare annotation was computed. [2023-02-17 05:45:16,307 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 303) no Hoare annotation was computed. [2023-02-17 05:45:16,307 INFO L899 garLoopResultBuilder]: For program point L299-2(lines 219 597) no Hoare annotation was computed. [2023-02-17 05:45:16,310 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, 1, 1] [2023-02-17 05:45:16,312 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 05:45:16,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 05:45:16 BoogieIcfgContainer [2023-02-17 05:45:16,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 05:45:16,349 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 05:45:16,349 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 05:45:16,349 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 05:45:16,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:45:07" (3/4) ... [2023-02-17 05:45:16,352 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 05:45:16,365 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-02-17 05:45:16,365 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 05:45:16,366 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 05:45:16,366 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 05:45:16,446 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 05:45:16,446 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 05:45:16,447 INFO L158 Benchmark]: Toolchain (without parser) took 9981.98ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 106.1MB in the beginning and 212.0MB in the end (delta: -105.9MB). Peak memory consumption was 146.8MB. Max. memory is 16.1GB. [2023-02-17 05:45:16,450 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 98.6MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 05:45:16,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.85ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 90.2MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-17 05:45:16,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.31ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 87.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 05:45:16,451 INFO L158 Benchmark]: Boogie Preprocessor took 39.90ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 85.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 05:45:16,451 INFO L158 Benchmark]: RCFGBuilder took 528.94ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 97.7MB in the end (delta: -12.9MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2023-02-17 05:45:16,451 INFO L158 Benchmark]: TraceAbstraction took 9050.42ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 97.0MB in the beginning and 75.1MB in the end (delta: 22.0MB). Peak memory consumption was 128.9MB. Max. memory is 16.1GB. [2023-02-17 05:45:16,454 INFO L158 Benchmark]: Witness Printer took 97.59ms. Allocated memory is still 249.6MB. Free memory was 75.1MB in the beginning and 212.0MB in the end (delta: -136.9MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2023-02-17 05:45:16,459 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.13ms. Allocated memory is still 98.6MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.85ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 90.2MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.31ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 87.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.90ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 85.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 528.94ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 97.7MB in the end (delta: -12.9MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9050.42ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 97.0MB in the beginning and 75.1MB in the end (delta: 22.0MB). Peak memory consumption was 128.9MB. Max. memory is 16.1GB. * Witness Printer took 97.59ms. Allocated memory is still 249.6MB. Free memory was 75.1MB in the beginning and 212.0MB in the end (delta: -136.9MB). Peak memory consumption was 6.7MB. 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: 678]: 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, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 22, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1809 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1809 mSDsluCounter, 7877 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3241 mSDsCounter, 559 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2864 IncrementalHoareTripleChecker+Invalid, 3423 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 559 mSolverCounterUnsat, 4636 mSDtfsCounter, 2864 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5984 GetRequests, 5949 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2439occurred in iteration=18, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 3483 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 194 NumberOfFragments, 5619 HoareAnnotationTreeSize, 29 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 9019 NumberOfCodeBlocks, 9019 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 6785 ConstructedInterpolants, 0 QuantifiedInterpolants, 8883 SizeOfPredicates, 14 NumberOfNonLiveVariables, 8081 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 24 InterpolantComputations, 20 PerfectInterpolantSequences, 30777/30881 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: ((2 == blastFlag && !(0 == s__hit)) && s__state >= 8672) || ((!(0 == s__hit) && blastFlag == 3) && s__state >= 8672) - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: (((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3) || (s__state >= 8448 && (((((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && (((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) || (s__state <= 8672 && 2 == blastFlag))) || (s__state <= 8576 && (((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) || (s__state <= 8672 && 2 == blastFlag)))) && s__s3__tmp__next_state___0 <= 3) && !(8576 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && (((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) || (s__state <= 8672 && 2 == blastFlag))) || (s__state <= 8576 && (((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) || (s__state <= 8672 && 2 == blastFlag)))) && !(8576 <= s__state))) || (((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && (((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) || (s__state <= 8672 && 2 == blastFlag))) || (s__state <= 8576 && (((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) || (s__state <= 8672 && 2 == blastFlag)))) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))))) || ((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit)) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3) || ((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit))) || (s__state >= 8448 && ((((((((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__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) || ((s__state <= 8672 && 2 == blastFlag) && s__state <= 8576)) && s__s3__tmp__next_state___0 <= 3) && !(8576 <= s__state)))) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((s__state >= 8448 && (((((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && (((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) || (s__state <= 8672 && 2 == blastFlag))) || (s__state <= 8576 && (((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) || (s__state <= 8672 && 2 == blastFlag)))) && s__s3__tmp__next_state___0 <= 3) && !(8576 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && (((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) || (s__state <= 8672 && 2 == blastFlag))) || (s__state <= 8576 && (((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) || (s__state <= 8672 && 2 == blastFlag)))) && !(8576 <= s__state))) || (((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && (((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) || (s__state <= 8672 && 2 == blastFlag))) || (s__state <= 8576 && (((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) || (s__state <= 8672 && 2 == blastFlag)))) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state)))) || ((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3)) || ((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit)) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((s__state >= 8448 && (((((((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 && s__s3__tmp__next_state___0 <= 8576) && 1 == blastFlag) && s__state <= 8576) || ((s__state <= 8672 && 1 == blastFlag) && 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)) && s__s3__tmp__next_state___0 <= 3) && !(8576 <= s__state)))) || ((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3)) || (s__state >= 8448 && (((((((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) && !(0 == s__hit))) || ((s__state <= 8672 && !(0 == s__hit)) && 1 == blastFlag) - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: (((((((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) || ((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3)) || ((((((((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 == 8608) || (((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 >= 8448)) || (((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__s3__tmp__next_state___0 < 8656)) || ((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit))) || (((((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) || (((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__s3__tmp__next_state___0 < 8656)) || (((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__s3__tmp__next_state___0 <= 8576)) && s__state == 8608)) || (((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((((((((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__s3__tmp__next_state___0 < 8656) && s__state == 8592) || ((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit))) || ((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3)) || ((((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592)) || ((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit))) || (((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__s3__tmp__next_state___0 < 8656)) || ((((((((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592) || (((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)) || ((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag)) && s__state >= 8448)) || (((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__state == 8592)) || (((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3) || (s__state >= 8448 && (((((((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 && 0 == blastFlag) && s__state >= 8448) && s__state <= 8576) && !(8576 <= s__state))) || ((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit)) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3) || (s__state >= 8448 && ((((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) && !(0 == s__hit)) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((s__state >= 8448 && (((s__s3__tmp__next_state___0 <= 8576 && (((s__state <= 8672 && blastFlag == 3) && s__state >= 8672) || (blastFlag == 3 && s__state >= 8672))) || ((s__state <= 8672 && blastFlag == 3) && s__state >= 8672)) || (blastFlag == 3 && s__state >= 8672))) && s__state >= 8640) || (!(0 == s__hit) && (((s__state <= 8672 && blastFlag == 3) && s__state >= 8672) || (blastFlag == 3 && s__state >= 8672)))) || (!(0 == s__hit) && ((2 == blastFlag && s__state >= 8672) || ((s__state <= 8672 && 2 == blastFlag) && s__state >= 8672))) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3) || (s__state >= 8448 && (((((((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) && !(0 == s__hit)) - InvariantResult [Line: 636]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit)) && s__state + -8496 == 0) || (((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit)) && s__state <= 8448)) || (((s__state <= 8672 && !(0 == s__hit)) && s__state + -8656 == 0) && blastFlag == 3)) || (((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && s__state >= 8448) && s__state <= 8576) && blastFlag == 3) && s__s3__tmp__next_state___0 <= 3) && !(8576 <= s__state))) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (s__state >= 8448 && ((((((((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 && 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 <= 3) && !(8576 <= s__state))))) || ((((((((s__state <= 8672 && 2 == blastFlag) && s__state + -8496 == 0) && s__state <= 8576) || ((((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__state + -8496 == 0) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8496 == 0) && s__state <= 8576)) && !(8576 <= s__state))) && s__state >= 8448)) || ((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3)) || (((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3) && s__state >= 8672)) || ((s__state >= 8448 && ((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 3) && s__state >= 8672) || ((s__state <= 8672 && blastFlag == 3) && s__state >= 8672))) && s__state >= 8640)) || (((((((((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 <= 3) && !(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)) && !(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 >= 8448)) || (((((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 && !(8656 <= s__state)) && !(0 == s__hit)) && s__state == 8592)) || ((((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__state >= 8448) && s__state >= 8640)) || (s__state == 8608 && ((((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__s3__tmp__next_state___0 < 8656) || ((!(8656 <= s__state) && !(0 == s__hit)) && s__s3__tmp__next_state___0 < 8656)))) || (((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit)) && s__state == 8464)) || (((((((((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)) && s__s3__tmp__next_state___0 <= 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 && 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)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) && s__state >= 8448)) || ((s__state <= 3 && (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) || (s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576))) && s__s3__tmp__next_state___0 <= 3)) || ((((((((s__state <= 8672 && 2 == blastFlag) && s__state == 8560) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__state == 8560) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) && !(8576 <= s__state)) || ((((((s__state <= 8672 && 2 == blastFlag) && s__state == 8560) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__state == 8560) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) && s__s3__tmp__next_state___0 <= 3) && !(8576 <= s__state))) || ((((((s__state <= 8672 && 2 == blastFlag) && s__state == 8560) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__state == 8560) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) && s__state >= 8448)) || ((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8656 == 0) || ((s__state <= 8672 && 2 == blastFlag) && s__state + -8656 == 0)) && s__state >= 8448) && s__state >= 8640)) || ((((((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 <= 8448) && s__state >= 8448) && s__state <= 8576) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || (((s__state <= 8672 && !(0 == s__hit)) && 1 == blastFlag) && s__state + -8496 == 0)) || (((s__state <= 8672 && s__state <= 3) && s__state <= 8448) && blastFlag == 3)) || (s__state >= 8448 && (((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__state == 8464) || (((s__state <= 8672 && 2 == blastFlag) && s__state <= 8576) && s__state == 8464)) && !(8576 <= s__state)) || (((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__state == 8464) || (((s__state <= 8672 && 2 == blastFlag) && s__state <= 8576) && s__state == 8464)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))))) || (s__state == 8592 && ((((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__s3__tmp__next_state___0 < 8656) || ((!(8656 <= s__state) && !(0 == s__hit)) && s__s3__tmp__next_state___0 < 8656)))) || ((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit))) || (((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3) && s__state == 8464)) || (((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit)) && s__state + -8656 == 0)) || (((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((s__state >= 8448 && ((((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 && s__state <= 3) && s__state <= 8448)) || (((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__state == 8608)) || ((((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608)) || ((((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592)) || (((s__state <= 8672 && s__state <= 3) && 2 == blastFlag) && s__state <= 8448)) || (!(0 == s__hit) && blastFlag == 3)) || (((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__state >= 8640)) || (s__state >= 8448 && ((((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__state == 8608) || ((((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608)))) || (s__state >= 8448 && (((((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592) || (((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__state == 8592)))) || (((s__state <= 8672 && !(0 == s__hit)) && s__state + -8496 == 0) && blastFlag == 3)) || (s__state >= 8448 && (((((((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) && s__state <= 8576) || ((((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) && !(8576 <= s__state)) || ((((((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) && s__state <= 8576) || ((((s__state <= 8672 && s__state == 8544) && 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 == 8544) && 2 == blastFlag) && s__state <= 8576) || ((((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) && s__s3__tmp__next_state___0 <= 3) && !(8576 <= s__state))))) || (((s__state <= 8672 && !(0 == s__hit)) && s__state <= 8448) && blastFlag == 3)) || ((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && s__state >= 8448) && s__state <= 8576) && !(8576 <= s__state))) || (2 == blastFlag && !(0 == s__hit))) || (((s__state + -8528 == 0 && s__state <= 8672) && !(0 == s__hit)) && blastFlag == 3)) || (((s__state + -8528 == 0 && s__state <= 8672) && 2 == blastFlag) && !(0 == s__hit)) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((s__state <= 8672 && !(0 == s__hit)) || ((s__state >= 8448 && ((((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 >= 8640)) || ((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3)) || ((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit)) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((blastFlag == 3 && s__state >= 8672) || blastFlag == 3) && s__state <= 8672) && !(0 == s__hit)) && s__state <= 8448) || (((s__state <= 8672 && !(0 == s__hit)) && ((2 == blastFlag && s__state >= 8672) || 2 == blastFlag)) && s__state <= 8448)) || ((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && ((2 == blastFlag && s__state >= 8672) || 2 == blastFlag)) && s__state <= 8448) && s__state <= 8576) || (((s__state <= 8672 && ((2 == blastFlag && s__state >= 8672) || 2 == blastFlag)) && s__state <= 8448) && s__state <= 8576)) && !(8576 <= s__state))) || (((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && ((2 == blastFlag && s__state >= 8672) || 2 == blastFlag)) && s__state <= 8448) && s__state <= 8576) || (((s__state <= 8672 && ((2 == blastFlag && s__state >= 8672) || 2 == blastFlag)) && s__state <= 8448) && s__state <= 8576)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || (!(0 == s__hit) && ((2 == blastFlag && s__state >= 8672) || 2 == blastFlag))) || (((blastFlag == 3 && s__state >= 8672) || blastFlag == 3) && !(0 == s__hit)) - InvariantResult [Line: 356]: 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)) && s__s3__tmp__next_state___0 <= 3) && !(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 >= 8448) || ((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3)) || ((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit)) - 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__state <= 8672 && 2 == blastFlag) || ((s__state <= 8672 && 2 == blastFlag) && s__state == 8560)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) || (((s__state <= 8672 && 2 == blastFlag) || ((s__state <= 8672 && 2 == blastFlag) && s__state == 8560)) && s__state <= 8576)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state)) || ((((((s__state <= 8672 && 2 == blastFlag) || ((s__state <= 8672 && 2 == blastFlag) && s__state == 8560)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) || (((s__state <= 8672 && 2 == blastFlag) || ((s__state <= 8672 && 2 == blastFlag) && s__state == 8560)) && s__state <= 8576)) && !(8576 <= s__state))) || (((((((s__state <= 8672 && 2 == blastFlag) || ((s__state <= 8672 && 2 == blastFlag) && s__state == 8560)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) || (((s__state <= 8672 && 2 == blastFlag) || ((s__state <= 8672 && 2 == blastFlag) && s__state == 8560)) && s__state <= 8576)) && s__s3__tmp__next_state___0 <= 3) && !(8576 <= s__state))) && s__state >= 8448) || ((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3)) || ((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit)) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3) || ((s__state >= 8448 && (((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) || (s__state <= 8672 && 2 == blastFlag))) && s__state >= 8640)) || ((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit)) - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: (((((((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit)) && s__state <= 8448) || (((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && s__state <= 8576) && s__s3__tmp__next_state___0 <= 3) && !(8576 <= s__state))) || (((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && s__state >= 8448) && s__state <= 8576) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || (((s__state <= 8672 && !(0 == s__hit)) && s__state <= 8448) && blastFlag == 3)) || ((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && s__state >= 8448) && s__state <= 8576) && !(8576 <= s__state))) || ((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && s__state <= 8576) && blastFlag == 3) && s__s3__tmp__next_state___0 <= 3) && !(8576 <= s__state)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit)) && s__state + -8496 == 0) || (((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit)) && s__state <= 8448)) || (((s__state <= 8672 && !(0 == s__hit)) && s__state + -8656 == 0) && blastFlag == 3)) || (((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && s__state >= 8448) && s__state <= 8576) && blastFlag == 3) && s__s3__tmp__next_state___0 <= 3) && !(8576 <= s__state))) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3)) || ((((((((s__state <= 8672 && 2 == blastFlag) && s__state + -8496 == 0) && s__state <= 8576) || ((((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__state + -8496 == 0) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8496 == 0) && s__state <= 8576)) && !(8576 <= s__state))) && s__state >= 8448)) || (s__state >= 8448 && ((((((((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 && 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 <= 3) && !(8576 <= s__state))))) || (((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3) && s__state >= 8672)) || ((s__state >= 8448 && ((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 3) && s__state >= 8672) || ((s__state <= 8672 && blastFlag == 3) && s__state >= 8672))) && s__state >= 8640)) || (((((((((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 <= 3) && !(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)) && !(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 >= 8448)) || (((((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 && !(8656 <= s__state)) && !(0 == s__hit)) && s__state == 8592)) || ((((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__state >= 8448) && s__state >= 8640)) || (s__state == 8608 && ((((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__s3__tmp__next_state___0 < 8656) || ((!(8656 <= s__state) && !(0 == s__hit)) && s__s3__tmp__next_state___0 < 8656)))) || (((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit)) && s__state == 8464)) || (((((((((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)) && s__s3__tmp__next_state___0 <= 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 && 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)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) && s__state >= 8448)) || ((s__state <= 3 && (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) || (s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576))) && s__s3__tmp__next_state___0 <= 3)) || ((((((((s__state <= 8672 && 2 == blastFlag) && s__state == 8560) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__state == 8560) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) && !(8576 <= s__state)) || ((((((s__state <= 8672 && 2 == blastFlag) && s__state == 8560) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__state == 8560) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) && s__s3__tmp__next_state___0 <= 3) && !(8576 <= s__state))) || ((((((s__state <= 8672 && 2 == blastFlag) && s__state == 8560) && s__state <= 8576) || ((((s__state <= 8672 && 2 == blastFlag) && s__state == 8560) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) && s__state >= 8448)) || ((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state + -8656 == 0) || ((s__state <= 8672 && 2 == blastFlag) && s__state + -8656 == 0)) && s__state >= 8448) && s__state >= 8640)) || ((((((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 <= 8448) && s__state >= 8448) && s__state <= 8576) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))) || (((s__state <= 8672 && s__state <= 3) && s__state <= 8448) && blastFlag == 3)) || (((s__state <= 8672 && !(0 == s__hit)) && 1 == blastFlag) && s__state + -8496 == 0)) || (s__state >= 8448 && (((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__state == 8464) || (((s__state <= 8672 && 2 == blastFlag) && s__state <= 8576) && s__state == 8464)) && !(8576 <= s__state)) || (((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__state == 8464) || (((s__state <= 8672 && 2 == blastFlag) && s__state <= 8576) && s__state == 8464)) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state))))) || (s__state == 8592 && ((((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__s3__tmp__next_state___0 < 8656) || ((!(8656 <= s__state) && !(0 == s__hit)) && s__s3__tmp__next_state___0 < 8656)))) || ((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit))) || (((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3) && s__state == 8464)) || (((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit)) && s__state + -8656 == 0)) || (((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((s__state >= 8448 && ((((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 && s__state <= 3) && s__state <= 8448)) || (((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__state == 8608)) || ((((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608)) || ((((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592)) || (((s__state <= 8672 && s__state <= 3) && 2 == blastFlag) && s__state <= 8448)) || (!(0 == s__hit) && blastFlag == 3)) || (((s__state <= 8672 && !(8656 <= s__state)) && !(0 == s__hit)) && s__state >= 8640)) || (s__state >= 8448 && ((((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__state == 8608) || ((((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608)))) || (s__state >= 8448 && (((((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592) || (((s__state <= 8672 && !(8656 <= s__state)) && 2 == blastFlag) && s__state == 8592)))) || (((s__state <= 8672 && !(0 == s__hit)) && s__state + -8496 == 0) && blastFlag == 3)) || (((((s__state <= 8672 && 0 == blastFlag) && s__state >= 8448) && s__state <= 8576) && s__state == 8464) && !(8576 <= s__state))) || (s__state >= 8448 && (((((((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) && s__state <= 8576) || ((((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) && !(8576 <= s__state)) || ((((((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) && s__state <= 8576) || ((((s__state <= 8672 && s__state == 8544) && 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 == 8544) && 2 == blastFlag) && s__state <= 8576) || ((((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) && s__s3__tmp__next_state___0 <= 3) && !(8576 <= s__state))))) || (((s__state <= 8672 && !(0 == s__hit)) && s__state <= 8448) && blastFlag == 3)) || ((((((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && s__state >= 8448) && s__state <= 8576) && !(8576 <= s__state))) || (2 == blastFlag && !(0 == s__hit))) || (((s__state + -8528 == 0 && s__state <= 8672) && !(0 == s__hit)) && blastFlag == 3)) || (((s__state + -8528 == 0 && s__state <= 8672) && 2 == blastFlag) && !(0 == s__hit)) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((s__state >= 8448 && (((((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && (((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) || (s__state <= 8672 && 2 == blastFlag))) || (s__state <= 8576 && (((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) || (s__state <= 8672 && 2 == blastFlag)))) && s__s3__tmp__next_state___0 <= 3) && !(8576 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && (((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) || (s__state <= 8672 && 2 == blastFlag))) || (s__state <= 8576 && (((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) || (s__state <= 8672 && 2 == blastFlag)))) && !(8576 <= s__state))) || (((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && (((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) || (s__state <= 8672 && 2 == blastFlag))) || (s__state <= 8576 && (((s__state <= 8672 && s__state == 8544) && 2 == blastFlag) || (s__state <= 8672 && 2 == blastFlag)))) && s__s3__tmp__next_state___0 < 8576) && !(8576 <= s__state)))) || ((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3)) || ((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((s__state <= 8672 && !(0 == s__hit)) && blastFlag == 3) || ((s__state <= 8672 && 2 == blastFlag) && !(0 == s__hit))) || (s__state >= 8448 && ((((((((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__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) || ((s__state <= 8672 && 2 == blastFlag) && s__state <= 8576)) && s__s3__tmp__next_state___0 <= 3) && !(8576 <= s__state)))) RESULT: Ultimate proved your program to be correct! [2023-02-17 05:45:16,497 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