./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae 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_2a.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 b8cfead7c1f307a9ba2676fad86c005fa434c5b4bc168c34fe90a644ea9973b2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 00:42:45,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:42:45,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:42:45,777 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:42:45,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:42:45,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:42:45,783 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:42:45,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:42:45,786 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:42:45,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:42:45,790 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:42:45,792 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:42:45,792 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:42:45,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:42:45,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:42:45,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:42:45,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:42:45,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:42:45,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:42:45,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:42:45,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:42:45,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:42:45,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:42:45,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:42:45,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:42:45,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:42:45,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:42:45,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:42:45,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:42:45,814 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:42:45,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:42:45,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:42:45,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:42:45,816 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:42:45,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:42:45,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:42:45,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:42:45,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:42:45,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:42:45,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:42:45,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:42:45,826 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:42:45,858 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:42:45,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:42:45,858 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:42:45,858 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:42:45,859 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:42:45,859 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:42:45,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:42:45,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:42:45,860 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:42:45,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:42:45,860 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:42:45,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:42:45,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:42:45,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:42:45,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:42:45,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:42:45,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:42:45,861 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:42:45,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:42:45,861 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:42:45,861 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:42:45,861 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:42:45,861 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:42:45,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:42:45,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:42:45,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:42:45,862 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:42:45,862 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:42:45,862 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:42:45,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:42:45,862 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:42:45,862 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:42:45,863 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:42:45,863 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:42:45,863 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:42:45,863 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 -> b8cfead7c1f307a9ba2676fad86c005fa434c5b4bc168c34fe90a644ea9973b2 [2023-02-16 00:42:46,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:42:46,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:42:46,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:42:46,054 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:42:46,055 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:42:46,055 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c [2023-02-16 00:42:47,029 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:42:47,170 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:42:47,171 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c [2023-02-16 00:42:47,177 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/604c41e14/2c12a10626394e48b4a8dce9c21320ad/FLAGa9f5c0632 [2023-02-16 00:42:47,186 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/604c41e14/2c12a10626394e48b4a8dce9c21320ad [2023-02-16 00:42:47,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:42:47,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:42:47,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:42:47,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:42:47,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:42:47,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:42:47" (1/1) ... [2023-02-16 00:42:47,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52a703b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:47, skipping insertion in model container [2023-02-16 00:42:47,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:42:47" (1/1) ... [2023-02-16 00:42:47,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:42:47,215 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:42:47,353 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_2a.BV.c.cil.c[44872,44885] [2023-02-16 00:42:47,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:42:47,367 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:42:47,399 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_2a.BV.c.cil.c[44872,44885] [2023-02-16 00:42:47,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:42:47,414 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:42:47,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:47 WrapperNode [2023-02-16 00:42:47,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:42:47,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:42:47,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:42:47,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:42:47,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:47" (1/1) ... [2023-02-16 00:42:47,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:47" (1/1) ... [2023-02-16 00:42:47,467 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 528 [2023-02-16 00:42:47,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:42:47,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:42:47,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:42:47,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:42:47,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:47" (1/1) ... [2023-02-16 00:42:47,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:47" (1/1) ... [2023-02-16 00:42:47,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:47" (1/1) ... [2023-02-16 00:42:47,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:47" (1/1) ... [2023-02-16 00:42:47,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:47" (1/1) ... [2023-02-16 00:42:47,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:47" (1/1) ... [2023-02-16 00:42:47,515 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:47" (1/1) ... [2023-02-16 00:42:47,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:47" (1/1) ... [2023-02-16 00:42:47,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:42:47,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:42:47,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:42:47,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:42:47,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:47" (1/1) ... [2023-02-16 00:42:47,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:42:47,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:42:47,542 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-16 00:42:47,546 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-16 00:42:47,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:42:47,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:42:47,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:42:47,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:42:47,648 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:42:47,651 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:42:47,676 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-02-16 00:42:48,091 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2023-02-16 00:42:48,091 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2023-02-16 00:42:48,091 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:42:48,096 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:42:48,096 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-16 00:42:48,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:42:48 BoogieIcfgContainer [2023-02-16 00:42:48,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:42:48,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:42:48,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:42:48,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:42:48,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:42:47" (1/3) ... [2023-02-16 00:42:48,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec7608e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:42:48, skipping insertion in model container [2023-02-16 00:42:48,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:47" (2/3) ... [2023-02-16 00:42:48,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec7608e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:42:48, skipping insertion in model container [2023-02-16 00:42:48,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:42:48" (3/3) ... [2023-02-16 00:42:48,117 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_2a.BV.c.cil.c [2023-02-16 00:42:48,128 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:42:48,129 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:42:48,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:42:48,164 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;@1b6a3e5a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:42:48,165 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:42:48,168 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-16 00:42:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 00:42:48,179 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:48,192 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-16 00:42:48,193 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:48,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:48,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1632002022, now seen corresponding path program 1 times [2023-02-16 00:42:48,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:48,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039842510] [2023-02-16 00:42:48,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:48,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:48,485 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-16 00:42:48,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:48,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039842510] [2023-02-16 00:42:48,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039842510] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:48,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:48,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:48,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767332114] [2023-02-16 00:42:48,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:48,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:48,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:48,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:48,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:48,512 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-16 00:42:48,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:48,655 INFO L93 Difference]: Finished difference Result 284 states and 484 transitions. [2023-02-16 00:42:48,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:48,657 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-16 00:42:48,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:48,664 INFO L225 Difference]: With dead ends: 284 [2023-02-16 00:42:48,664 INFO L226 Difference]: Without dead ends: 128 [2023-02-16 00:42:48,667 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-16 00:42:48,669 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 20 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:48,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 326 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:42:48,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-16 00:42:48,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2023-02-16 00:42:48,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.4919354838709677) internal successors, (185), 124 states have internal predecessors, (185), 0 states have call successors, (0), 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-16 00:42:48,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 185 transitions. [2023-02-16 00:42:48,697 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 185 transitions. Word has length 44 [2023-02-16 00:42:48,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:48,697 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 185 transitions. [2023-02-16 00:42:48,698 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-16 00:42:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 185 transitions. [2023-02-16 00:42:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-16 00:42:48,700 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:48,701 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-16 00:42:48,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 00:42:48,701 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:48,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:48,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2033157093, now seen corresponding path program 1 times [2023-02-16 00:42:48,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:48,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145992839] [2023-02-16 00:42:48,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:48,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:48,837 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-16 00:42:48,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:48,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145992839] [2023-02-16 00:42:48,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145992839] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:48,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:48,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:48,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297897027] [2023-02-16 00:42:48,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:48,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:48,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:48,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:48,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:48,839 INFO L87 Difference]: Start difference. First operand 125 states and 185 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-16 00:42:48,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:48,868 INFO L93 Difference]: Finished difference Result 331 states and 502 transitions. [2023-02-16 00:42:48,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:48,869 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-16 00:42:48,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:48,870 INFO L225 Difference]: With dead ends: 331 [2023-02-16 00:42:48,870 INFO L226 Difference]: Without dead ends: 225 [2023-02-16 00:42:48,871 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-16 00:42:48,872 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 111 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:48,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 346 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:42:48,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-16 00:42:48,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2023-02-16 00:42:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.5) internal successors, (336), 224 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 336 transitions. [2023-02-16 00:42:48,891 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 336 transitions. Word has length 60 [2023-02-16 00:42:48,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:48,893 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 336 transitions. [2023-02-16 00:42:48,894 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-16 00:42:48,895 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 336 transitions. [2023-02-16 00:42:48,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-16 00:42:48,900 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:48,901 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-16 00:42:48,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 00:42:48,902 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:48,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:48,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2013663709, now seen corresponding path program 1 times [2023-02-16 00:42:48,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:48,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660739331] [2023-02-16 00:42:48,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:48,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:48,968 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-16 00:42:48,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:48,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660739331] [2023-02-16 00:42:48,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660739331] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:48,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:48,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:48,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938955542] [2023-02-16 00:42:48,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:48,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:48,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:48,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:48,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:48,973 INFO L87 Difference]: Start difference. First operand 225 states and 336 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-16 00:42:48,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:48,996 INFO L93 Difference]: Finished difference Result 433 states and 652 transitions. [2023-02-16 00:42:48,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:48,996 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-16 00:42:48,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:48,999 INFO L225 Difference]: With dead ends: 433 [2023-02-16 00:42:49,000 INFO L226 Difference]: Without dead ends: 227 [2023-02-16 00:42:49,003 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-16 00:42:49,005 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 6 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 326 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-16 00:42:49,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 326 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:42:49,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-16 00:42:49,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2023-02-16 00:42:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4955752212389382) internal successors, (338), 226 states have internal predecessors, (338), 0 states have call successors, (0), 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-16 00:42:49,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 338 transitions. [2023-02-16 00:42:49,018 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 338 transitions. Word has length 60 [2023-02-16 00:42:49,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:49,019 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 338 transitions. [2023-02-16 00:42:49,019 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-16 00:42:49,019 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 338 transitions. [2023-02-16 00:42:49,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-16 00:42:49,020 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:49,020 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-16 00:42:49,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 00:42:49,020 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:49,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:49,021 INFO L85 PathProgramCache]: Analyzing trace with hash 64836761, now seen corresponding path program 1 times [2023-02-16 00:42:49,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:49,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655353546] [2023-02-16 00:42:49,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:49,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:49,083 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-16 00:42:49,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:49,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655353546] [2023-02-16 00:42:49,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655353546] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:49,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:49,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:49,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171979691] [2023-02-16 00:42:49,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:49,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:49,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:49,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:49,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:49,086 INFO L87 Difference]: Start difference. First operand 227 states and 338 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-16 00:42:49,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:49,210 INFO L93 Difference]: Finished difference Result 524 states and 805 transitions. [2023-02-16 00:42:49,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:49,210 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-16 00:42:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:49,212 INFO L225 Difference]: With dead ends: 524 [2023-02-16 00:42:49,213 INFO L226 Difference]: Without dead ends: 318 [2023-02-16 00:42:49,214 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-16 00:42:49,221 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 14 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:49,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 272 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:42:49,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2023-02-16 00:42:49,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 310. [2023-02-16 00:42:49,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.3948220064724919) internal successors, (431), 309 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 431 transitions. [2023-02-16 00:42:49,241 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 431 transitions. Word has length 81 [2023-02-16 00:42:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:49,242 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 431 transitions. [2023-02-16 00:42:49,242 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-16 00:42:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 431 transitions. [2023-02-16 00:42:49,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-16 00:42:49,245 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:49,245 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-16 00:42:49,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 00:42:49,246 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:49,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:49,246 INFO L85 PathProgramCache]: Analyzing trace with hash 312983255, now seen corresponding path program 1 times [2023-02-16 00:42:49,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:49,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402476925] [2023-02-16 00:42:49,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:49,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:49,296 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-16 00:42:49,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:49,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402476925] [2023-02-16 00:42:49,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402476925] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:49,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:49,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:49,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681049478] [2023-02-16 00:42:49,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:49,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:49,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:49,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:49,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:49,299 INFO L87 Difference]: Start difference. First operand 310 states and 431 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-16 00:42:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:49,374 INFO L93 Difference]: Finished difference Result 628 states and 882 transitions. [2023-02-16 00:42:49,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:49,375 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-16 00:42:49,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:49,376 INFO L225 Difference]: With dead ends: 628 [2023-02-16 00:42:49,376 INFO L226 Difference]: Without dead ends: 339 [2023-02-16 00:42:49,377 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-16 00:42:49,377 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 12 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:49,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 273 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:42:49,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-02-16 00:42:49,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 333. [2023-02-16 00:42:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.3825301204819278) internal successors, (459), 332 states have internal predecessors, (459), 0 states have call successors, (0), 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-16 00:42:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 459 transitions. [2023-02-16 00:42:49,397 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 459 transitions. Word has length 81 [2023-02-16 00:42:49,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:49,398 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 459 transitions. [2023-02-16 00:42:49,398 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-16 00:42:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 459 transitions. [2023-02-16 00:42:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-02-16 00:42:49,400 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:49,400 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-16 00:42:49,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 00:42:49,403 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:49,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:49,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1731331013, now seen corresponding path program 1 times [2023-02-16 00:42:49,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:49,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769579131] [2023-02-16 00:42:49,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:49,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:49,455 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-16 00:42:49,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:49,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769579131] [2023-02-16 00:42:49,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769579131] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:49,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:49,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:49,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573628433] [2023-02-16 00:42:49,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:49,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:49,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:49,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:49,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:49,456 INFO L87 Difference]: Start difference. First operand 333 states and 459 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-16 00:42:49,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:49,538 INFO L93 Difference]: Finished difference Result 719 states and 1015 transitions. [2023-02-16 00:42:49,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:49,539 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-16 00:42:49,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:49,540 INFO L225 Difference]: With dead ends: 719 [2023-02-16 00:42:49,540 INFO L226 Difference]: Without dead ends: 407 [2023-02-16 00:42:49,541 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-16 00:42:49,541 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 28 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:49,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 272 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:42:49,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-02-16 00:42:49,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 383. [2023-02-16 00:42:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.3586387434554974) internal successors, (519), 382 states have internal predecessors, (519), 0 states have call successors, (0), 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-16 00:42:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 519 transitions. [2023-02-16 00:42:49,548 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 519 transitions. Word has length 101 [2023-02-16 00:42:49,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:49,548 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 519 transitions. [2023-02-16 00:42:49,549 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-16 00:42:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 519 transitions. [2023-02-16 00:42:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-16 00:42:49,549 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:49,550 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-16 00:42:49,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 00:42:49,550 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:49,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:49,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1340556462, now seen corresponding path program 1 times [2023-02-16 00:42:49,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:49,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858827163] [2023-02-16 00:42:49,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:49,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:49,618 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-16 00:42:49,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:49,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858827163] [2023-02-16 00:42:49,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858827163] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:49,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:49,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:49,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724011982] [2023-02-16 00:42:49,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:49,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:49,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:49,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:49,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:49,620 INFO L87 Difference]: Start difference. First operand 383 states and 519 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-16 00:42:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:49,640 INFO L93 Difference]: Finished difference Result 912 states and 1246 transitions. [2023-02-16 00:42:49,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:49,640 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-16 00:42:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:49,642 INFO L225 Difference]: With dead ends: 912 [2023-02-16 00:42:49,642 INFO L226 Difference]: Without dead ends: 550 [2023-02-16 00:42:49,642 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-16 00:42:49,642 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 111 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 482 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-16 00:42:49,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 482 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:42:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2023-02-16 00:42:49,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2023-02-16 00:42:49,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.360655737704918) internal successors, (747), 549 states have internal predecessors, (747), 0 states have call successors, (0), 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-16 00:42:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 747 transitions. [2023-02-16 00:42:49,651 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 747 transitions. Word has length 121 [2023-02-16 00:42:49,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:49,651 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 747 transitions. [2023-02-16 00:42:49,651 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-16 00:42:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 747 transitions. [2023-02-16 00:42:49,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-16 00:42:49,652 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:49,652 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-16 00:42:49,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 00:42:49,652 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:49,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:49,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2057017556, now seen corresponding path program 1 times [2023-02-16 00:42:49,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:49,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046938852] [2023-02-16 00:42:49,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:49,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:49,691 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-16 00:42:49,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:49,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046938852] [2023-02-16 00:42:49,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046938852] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:49,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:49,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:49,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782621650] [2023-02-16 00:42:49,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:49,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:49,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:49,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:49,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:49,693 INFO L87 Difference]: Start difference. First operand 550 states and 747 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-16 00:42:49,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:49,724 INFO L93 Difference]: Finished difference Result 1271 states and 1733 transitions. [2023-02-16 00:42:49,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:49,724 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-16 00:42:49,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:49,727 INFO L225 Difference]: With dead ends: 1271 [2023-02-16 00:42:49,727 INFO L226 Difference]: Without dead ends: 742 [2023-02-16 00:42:49,728 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-16 00:42:49,729 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 113 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 480 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-16 00:42:49,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 480 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:42:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2023-02-16 00:42:49,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2023-02-16 00:42:49,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 1.3576248313090418) internal successors, (1006), 741 states have internal predecessors, (1006), 0 states have call successors, (0), 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-16 00:42:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1006 transitions. [2023-02-16 00:42:49,742 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1006 transitions. Word has length 121 [2023-02-16 00:42:49,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:49,742 INFO L495 AbstractCegarLoop]: Abstraction has 742 states and 1006 transitions. [2023-02-16 00:42:49,742 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-16 00:42:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1006 transitions. [2023-02-16 00:42:49,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-02-16 00:42:49,747 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:49,747 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:42:49,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 00:42:49,748 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:49,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:49,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1067369758, now seen corresponding path program 1 times [2023-02-16 00:42:49,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:49,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071621434] [2023-02-16 00:42:49,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:49,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-02-16 00:42:49,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:49,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071621434] [2023-02-16 00:42:49,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071621434] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:49,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:49,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:49,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573047390] [2023-02-16 00:42:49,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:49,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:49,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:49,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:49,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:49,818 INFO L87 Difference]: Start difference. First operand 742 states and 1006 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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-16 00:42:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:49,923 INFO L93 Difference]: Finished difference Result 1592 states and 2215 transitions. [2023-02-16 00:42:49,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:49,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 183 [2023-02-16 00:42:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:49,926 INFO L225 Difference]: With dead ends: 1592 [2023-02-16 00:42:49,926 INFO L226 Difference]: Without dead ends: 871 [2023-02-16 00:42:49,927 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-16 00:42:49,929 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 35 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:49,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 267 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:42:49,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2023-02-16 00:42:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 865. [2023-02-16 00:42:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 864 states have (on average 1.3240740740740742) internal successors, (1144), 864 states have internal predecessors, (1144), 0 states have call successors, (0), 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-16 00:42:49,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1144 transitions. [2023-02-16 00:42:49,943 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1144 transitions. Word has length 183 [2023-02-16 00:42:49,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:49,944 INFO L495 AbstractCegarLoop]: Abstraction has 865 states and 1144 transitions. [2023-02-16 00:42:49,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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-16 00:42:49,944 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1144 transitions. [2023-02-16 00:42:49,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2023-02-16 00:42:49,946 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:49,946 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:42:49,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 00:42:49,946 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:49,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:49,947 INFO L85 PathProgramCache]: Analyzing trace with hash -860101462, now seen corresponding path program 1 times [2023-02-16 00:42:49,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:49,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112779146] [2023-02-16 00:42:49,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:49,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:50,018 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-02-16 00:42:50,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:50,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112779146] [2023-02-16 00:42:50,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112779146] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:50,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:50,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:50,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209077073] [2023-02-16 00:42:50,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:50,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:50,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:50,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:50,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:50,021 INFO L87 Difference]: Start difference. First operand 865 states and 1144 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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-16 00:42:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:50,117 INFO L93 Difference]: Finished difference Result 1881 states and 2567 transitions. [2023-02-16 00:42:50,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:50,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 225 [2023-02-16 00:42:50,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:50,120 INFO L225 Difference]: With dead ends: 1881 [2023-02-16 00:42:50,120 INFO L226 Difference]: Without dead ends: 989 [2023-02-16 00:42:50,121 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-16 00:42:50,122 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 36 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:50,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 267 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:42:50,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2023-02-16 00:42:50,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 989. [2023-02-16 00:42:50,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 988 states have (on average 1.3036437246963564) internal successors, (1288), 988 states have internal predecessors, (1288), 0 states have call successors, (0), 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-16 00:42:50,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1288 transitions. [2023-02-16 00:42:50,136 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1288 transitions. Word has length 225 [2023-02-16 00:42:50,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:50,136 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1288 transitions. [2023-02-16 00:42:50,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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-16 00:42:50,137 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1288 transitions. [2023-02-16 00:42:50,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-02-16 00:42:50,139 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:50,139 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:42:50,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-16 00:42:50,139 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:50,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:50,140 INFO L85 PathProgramCache]: Analyzing trace with hash -482554043, now seen corresponding path program 1 times [2023-02-16 00:42:50,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:50,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924264649] [2023-02-16 00:42:50,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:50,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-02-16 00:42:50,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:50,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924264649] [2023-02-16 00:42:50,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924264649] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:42:50,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474187485] [2023-02-16 00:42:50,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:50,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:42:50,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:42:50,212 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-16 00:42:50,213 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-16 00:42:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:50,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 00:42:50,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:42:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-02-16 00:42:50,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:42:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-02-16 00:42:50,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474187485] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:42:50,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:42:50,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-02-16 00:42:50,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296734572] [2023-02-16 00:42:50,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:42:50,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 00:42:50,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:50,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 00:42:50,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:42:50,512 INFO L87 Difference]: Start difference. First operand 989 states and 1288 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 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-16 00:42:50,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:50,990 INFO L93 Difference]: Finished difference Result 4290 states and 5915 transitions. [2023-02-16 00:42:50,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:42:50,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 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 253 [2023-02-16 00:42:50,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:50,999 INFO L225 Difference]: With dead ends: 4290 [2023-02-16 00:42:50,999 INFO L226 Difference]: Without dead ends: 3322 [2023-02-16 00:42:51,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-02-16 00:42:51,002 INFO L413 NwaCegarLoop]: 408 mSDtfsCounter, 338 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:51,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1013 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 00:42:51,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2023-02-16 00:42:51,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 2444. [2023-02-16 00:42:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 2443 states have (on average 1.3074089234547688) internal successors, (3194), 2443 states have internal predecessors, (3194), 0 states have call successors, (0), 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-16 00:42:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 3194 transitions. [2023-02-16 00:42:51,058 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 3194 transitions. Word has length 253 [2023-02-16 00:42:51,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:51,058 INFO L495 AbstractCegarLoop]: Abstraction has 2444 states and 3194 transitions. [2023-02-16 00:42:51,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 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-16 00:42:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 3194 transitions. [2023-02-16 00:42:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-02-16 00:42:51,062 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:51,062 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:42:51,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 00:42:51,268 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,SelfDestructingSolverStorable10 [2023-02-16 00:42:51,268 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:51,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash -193734653, now seen corresponding path program 1 times [2023-02-16 00:42:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:51,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574710264] [2023-02-16 00:42:51,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:51,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:51,342 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2023-02-16 00:42:51,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:51,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574710264] [2023-02-16 00:42:51,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574710264] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:51,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:51,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:51,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078555292] [2023-02-16 00:42:51,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:51,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:51,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:51,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:51,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:51,344 INFO L87 Difference]: Start difference. First operand 2444 states and 3194 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:51,409 INFO L93 Difference]: Finished difference Result 6784 states and 8940 transitions. [2023-02-16 00:42:51,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:51,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2023-02-16 00:42:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:51,417 INFO L225 Difference]: With dead ends: 6784 [2023-02-16 00:42:51,418 INFO L226 Difference]: Without dead ends: 3133 [2023-02-16 00:42:51,421 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-16 00:42:51,421 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 109 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:51,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 492 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:42:51,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2023-02-16 00:42:51,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 3031. [2023-02-16 00:42:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3031 states, 3030 states have (on average 1.328052805280528) internal successors, (4024), 3030 states have internal predecessors, (4024), 0 states have call successors, (0), 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-16 00:42:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 4024 transitions. [2023-02-16 00:42:51,505 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 4024 transitions. Word has length 253 [2023-02-16 00:42:51,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:51,505 INFO L495 AbstractCegarLoop]: Abstraction has 3031 states and 4024 transitions. [2023-02-16 00:42:51,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:51,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 4024 transitions. [2023-02-16 00:42:51,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2023-02-16 00:42:51,510 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:51,511 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:42:51,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-16 00:42:51,511 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:51,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:51,511 INFO L85 PathProgramCache]: Analyzing trace with hash -257796221, now seen corresponding path program 1 times [2023-02-16 00:42:51,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:51,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315881774] [2023-02-16 00:42:51,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:51,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 493 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2023-02-16 00:42:51,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:51,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315881774] [2023-02-16 00:42:51,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315881774] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:51,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:51,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:51,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132479943] [2023-02-16 00:42:51,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:51,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:51,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:51,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:51,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:51,569 INFO L87 Difference]: Start difference. First operand 3031 states and 4024 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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-16 00:42:51,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:51,691 INFO L93 Difference]: Finished difference Result 6437 states and 8611 transitions. [2023-02-16 00:42:51,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:51,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 299 [2023-02-16 00:42:51,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:51,700 INFO L225 Difference]: With dead ends: 6437 [2023-02-16 00:42:51,700 INFO L226 Difference]: Without dead ends: 3427 [2023-02-16 00:42:51,703 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-16 00:42:51,705 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:51,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 272 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:42:51,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3427 states. [2023-02-16 00:42:51,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3427 to 3355. [2023-02-16 00:42:51,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3355 states, 3354 states have (on average 1.3142516398330353) internal successors, (4408), 3354 states have internal predecessors, (4408), 0 states have call successors, (0), 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-16 00:42:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 4408 transitions. [2023-02-16 00:42:51,808 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 4408 transitions. Word has length 299 [2023-02-16 00:42:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:51,808 INFO L495 AbstractCegarLoop]: Abstraction has 3355 states and 4408 transitions. [2023-02-16 00:42:51,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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-16 00:42:51,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 4408 transitions. [2023-02-16 00:42:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2023-02-16 00:42:51,815 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:51,815 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:42:51,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-16 00:42:51,815 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:51,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:51,816 INFO L85 PathProgramCache]: Analyzing trace with hash 212293102, now seen corresponding path program 1 times [2023-02-16 00:42:51,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:51,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389513048] [2023-02-16 00:42:51,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:51,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2023-02-16 00:42:51,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:51,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389513048] [2023-02-16 00:42:51,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389513048] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:51,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:51,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:51,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18996615] [2023-02-16 00:42:51,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:51,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:51,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:51,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:51,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:51,891 INFO L87 Difference]: Start difference. First operand 3355 states and 4408 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-16 00:42:52,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:52,028 INFO L93 Difference]: Finished difference Result 7049 states and 9307 transitions. [2023-02-16 00:42:52,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:52,028 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 322 [2023-02-16 00:42:52,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:52,038 INFO L225 Difference]: With dead ends: 7049 [2023-02-16 00:42:52,038 INFO L226 Difference]: Without dead ends: 3715 [2023-02-16 00:42:52,041 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-16 00:42:52,041 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:52,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 272 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:42:52,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3715 states. [2023-02-16 00:42:52,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3715 to 3034. [2023-02-16 00:42:52,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 3033 states have (on average 1.3056379821958457) internal successors, (3960), 3033 states have internal predecessors, (3960), 0 states have call successors, (0), 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-16 00:42:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 3960 transitions. [2023-02-16 00:42:52,119 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 3960 transitions. Word has length 322 [2023-02-16 00:42:52,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:52,120 INFO L495 AbstractCegarLoop]: Abstraction has 3034 states and 3960 transitions. [2023-02-16 00:42:52,120 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-16 00:42:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 3960 transitions. [2023-02-16 00:42:52,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2023-02-16 00:42:52,124 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:52,124 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-02-16 00:42:52,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-16 00:42:52,125 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:52,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:52,125 INFO L85 PathProgramCache]: Analyzing trace with hash -812160295, now seen corresponding path program 1 times [2023-02-16 00:42:52,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:52,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199731572] [2023-02-16 00:42:52,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:52,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2023-02-16 00:42:52,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:52,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199731572] [2023-02-16 00:42:52,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199731572] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:52,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:52,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:52,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263528072] [2023-02-16 00:42:52,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:52,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:52,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:52,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:52,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:52,193 INFO L87 Difference]: Start difference. First operand 3034 states and 3960 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:52,404 INFO L93 Difference]: Finished difference Result 9048 states and 11812 transitions. [2023-02-16 00:42:52,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:52,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 354 [2023-02-16 00:42:52,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:52,424 INFO L225 Difference]: With dead ends: 9048 [2023-02-16 00:42:52,424 INFO L226 Difference]: Without dead ends: 6035 [2023-02-16 00:42:52,429 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-16 00:42:52,430 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 125 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:52,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 484 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:42:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6035 states. [2023-02-16 00:42:52,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6035 to 5852. [2023-02-16 00:42:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5852 states, 5851 states have (on average 1.3083233635276021) internal successors, (7655), 5851 states have internal predecessors, (7655), 0 states have call successors, (0), 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-16 00:42:52,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5852 states to 5852 states and 7655 transitions. [2023-02-16 00:42:52,642 INFO L78 Accepts]: Start accepts. Automaton has 5852 states and 7655 transitions. Word has length 354 [2023-02-16 00:42:52,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:52,642 INFO L495 AbstractCegarLoop]: Abstraction has 5852 states and 7655 transitions. [2023-02-16 00:42:52,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 5852 states and 7655 transitions. [2023-02-16 00:42:52,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2023-02-16 00:42:52,654 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:52,654 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-02-16 00:42:52,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-16 00:42:52,655 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:52,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:52,655 INFO L85 PathProgramCache]: Analyzing trace with hash 209922624, now seen corresponding path program 1 times [2023-02-16 00:42:52,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:52,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902179703] [2023-02-16 00:42:52,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:52,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 871 proven. 26 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2023-02-16 00:42:52,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:52,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902179703] [2023-02-16 00:42:52,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902179703] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:42:52,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886196995] [2023-02-16 00:42:52,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:52,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:42:52,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:42:52,779 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-16 00:42:52,781 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-16 00:42:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:52,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 00:42:52,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:42:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2023-02-16 00:42:53,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:42:53,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886196995] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:53,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 00:42:53,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-02-16 00:42:53,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934789558] [2023-02-16 00:42:53,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:53,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:53,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:53,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:53,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:42:53,154 INFO L87 Difference]: Start difference. First operand 5852 states and 7655 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:53,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:53,233 INFO L93 Difference]: Finished difference Result 6714 states and 8793 transitions. [2023-02-16 00:42:53,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:53,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355 [2023-02-16 00:42:53,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:53,257 INFO L225 Difference]: With dead ends: 6714 [2023-02-16 00:42:53,258 INFO L226 Difference]: Without dead ends: 4851 [2023-02-16 00:42:53,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:42:53,262 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 83 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:53,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 476 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:42:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4851 states. [2023-02-16 00:42:53,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4851 to 3807. [2023-02-16 00:42:53,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3807 states, 3806 states have (on average 1.3084603258013663) internal successors, (4980), 3806 states have internal predecessors, (4980), 0 states have call successors, (0), 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-16 00:42:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3807 states to 3807 states and 4980 transitions. [2023-02-16 00:42:53,372 INFO L78 Accepts]: Start accepts. Automaton has 3807 states and 4980 transitions. Word has length 355 [2023-02-16 00:42:53,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:53,373 INFO L495 AbstractCegarLoop]: Abstraction has 3807 states and 4980 transitions. [2023-02-16 00:42:53,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3807 states and 4980 transitions. [2023-02-16 00:42:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2023-02-16 00:42:53,381 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:53,381 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-02-16 00:42:53,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-16 00:42:53,586 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,SelfDestructingSolverStorable15 [2023-02-16 00:42:53,587 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:53,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:53,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1965226690, now seen corresponding path program 1 times [2023-02-16 00:42:53,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:53,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812580512] [2023-02-16 00:42:53,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:53,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2023-02-16 00:42:53,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:53,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812580512] [2023-02-16 00:42:53,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812580512] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:42:53,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558707568] [2023-02-16 00:42:53,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:53,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:42:53,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:42:53,694 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-16 00:42:53,697 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-16 00:42:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:53,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 00:42:53,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:42:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2023-02-16 00:42:53,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:42:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2023-02-16 00:42:53,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558707568] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:42:53,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:42:53,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-02-16 00:42:53,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260741214] [2023-02-16 00:42:53,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:42:53,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 00:42:53,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:53,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 00:42:53,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:42:53,933 INFO L87 Difference]: Start difference. First operand 3807 states and 4980 transitions. Second operand has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 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-16 00:42:54,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:54,354 INFO L93 Difference]: Finished difference Result 9411 states and 12702 transitions. [2023-02-16 00:42:54,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 00:42:54,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 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 417 [2023-02-16 00:42:54,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:54,362 INFO L225 Difference]: With dead ends: 9411 [2023-02-16 00:42:54,362 INFO L226 Difference]: Without dead ends: 5466 [2023-02-16 00:42:54,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 834 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-02-16 00:42:54,366 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 355 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:54,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 650 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 00:42:54,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5466 states. [2023-02-16 00:42:54,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5466 to 4809. [2023-02-16 00:42:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.3741680532445923) internal successors, (6607), 4808 states have internal predecessors, (6607), 0 states have call successors, (0), 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-16 00:42:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 6607 transitions. [2023-02-16 00:42:54,457 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 6607 transitions. Word has length 417 [2023-02-16 00:42:54,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:54,457 INFO L495 AbstractCegarLoop]: Abstraction has 4809 states and 6607 transitions. [2023-02-16 00:42:54,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 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-16 00:42:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 6607 transitions. [2023-02-16 00:42:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2023-02-16 00:42:54,467 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:54,468 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-02-16 00:42:54,476 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-16 00:42:54,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:42:54,677 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:54,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:54,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1529804208, now seen corresponding path program 1 times [2023-02-16 00:42:54,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:54,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902892231] [2023-02-16 00:42:54,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:54,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:54,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3138 backedges. 1671 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2023-02-16 00:42:54,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:54,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902892231] [2023-02-16 00:42:54,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902892231] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:54,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:54,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:54,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686691011] [2023-02-16 00:42:54,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:54,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:54,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:54,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:54,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:54,807 INFO L87 Difference]: Start difference. First operand 4809 states and 6607 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:54,933 INFO L93 Difference]: Finished difference Result 9708 states and 13293 transitions. [2023-02-16 00:42:54,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:54,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 509 [2023-02-16 00:42:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:54,940 INFO L225 Difference]: With dead ends: 9708 [2023-02-16 00:42:54,940 INFO L226 Difference]: Without dead ends: 4920 [2023-02-16 00:42:54,945 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-16 00:42:54,945 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 14 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:54,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 272 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:42:54,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4920 states. [2023-02-16 00:42:55,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4920 to 4869. [2023-02-16 00:42:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4868 states have (on average 1.346343467543139) internal successors, (6554), 4868 states have internal predecessors, (6554), 0 states have call successors, (0), 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-16 00:42:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 6554 transitions. [2023-02-16 00:42:55,054 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 6554 transitions. Word has length 509 [2023-02-16 00:42:55,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:55,055 INFO L495 AbstractCegarLoop]: Abstraction has 4869 states and 6554 transitions. [2023-02-16 00:42:55,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 6554 transitions. [2023-02-16 00:42:55,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2023-02-16 00:42:55,066 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:55,066 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-02-16 00:42:55,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-16 00:42:55,067 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:55,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:55,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1911316890, now seen corresponding path program 1 times [2023-02-16 00:42:55,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:55,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076939638] [2023-02-16 00:42:55,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:55,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1744 proven. 206 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2023-02-16 00:42:55,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:55,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076939638] [2023-02-16 00:42:55,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076939638] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:42:55,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311632575] [2023-02-16 00:42:55,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:55,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:42:55,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:42:55,367 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-16 00:42:55,369 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-16 00:42:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:55,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 00:42:55,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:42:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1792 proven. 239 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2023-02-16 00:42:56,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:42:56,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1887 proven. 144 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2023-02-16 00:42:56,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311632575] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:42:56,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:42:56,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-02-16 00:42:56,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981481964] [2023-02-16 00:42:56,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:42:56,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 00:42:56,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:56,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 00:42:56,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-02-16 00:42:56,665 INFO L87 Difference]: Start difference. First operand 4869 states and 6554 transitions. Second operand has 11 states, 11 states have (on average 38.0) internal successors, (418), 11 states have internal predecessors, (418), 0 states have call successors, (0), 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-16 00:42:58,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:58,570 INFO L93 Difference]: Finished difference Result 22900 states and 30682 transitions. [2023-02-16 00:42:58,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-16 00:42:58,570 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 38.0) internal successors, (418), 11 states have internal predecessors, (418), 0 states have call successors, (0), 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 513 [2023-02-16 00:42:58,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:58,593 INFO L225 Difference]: With dead ends: 22900 [2023-02-16 00:42:58,594 INFO L226 Difference]: Without dead ends: 17872 [2023-02-16 00:42:58,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1057 GetRequests, 1033 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2023-02-16 00:42:58,601 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 1242 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 2020 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 2020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:58,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 1594 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 2020 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-16 00:42:58,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17872 states. [2023-02-16 00:42:59,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17872 to 16675. [2023-02-16 00:42:59,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16675 states, 16674 states have (on average 1.3002878733357324) internal successors, (21681), 16674 states have internal predecessors, (21681), 0 states have call successors, (0), 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-16 00:42:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16675 states to 16675 states and 21681 transitions. [2023-02-16 00:42:59,139 INFO L78 Accepts]: Start accepts. Automaton has 16675 states and 21681 transitions. Word has length 513 [2023-02-16 00:42:59,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:59,140 INFO L495 AbstractCegarLoop]: Abstraction has 16675 states and 21681 transitions. [2023-02-16 00:42:59,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 38.0) internal successors, (418), 11 states have internal predecessors, (418), 0 states have call successors, (0), 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-16 00:42:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 16675 states and 21681 transitions. [2023-02-16 00:42:59,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2023-02-16 00:42:59,163 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:59,163 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 18, 16, 16, 14, 14, 12, 12, 10, 10, 10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-02-16 00:42:59,180 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-16 00:42:59,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:42:59,369 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:59,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:59,370 INFO L85 PathProgramCache]: Analyzing trace with hash 944376353, now seen corresponding path program 2 times [2023-02-16 00:42:59,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:59,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915522227] [2023-02-16 00:42:59,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:59,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:59,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2023-02-16 00:42:59,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:59,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915522227] [2023-02-16 00:42:59,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915522227] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:42:59,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180470739] [2023-02-16 00:42:59,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:42:59,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:42:59,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:42:59,528 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-16 00:42:59,530 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-16 00:42:59,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:42:59,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:42:59,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 00:42:59,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:42:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2023-02-16 00:42:59,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:42:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2023-02-16 00:42:59,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180470739] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:42:59,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:42:59,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-02-16 00:42:59,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176699122] [2023-02-16 00:42:59,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:42:59,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 00:42:59,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:59,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 00:42:59,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-16 00:42:59,783 INFO L87 Difference]: Start difference. First operand 16675 states and 21681 transitions. Second operand has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 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-16 00:43:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:43:00,320 INFO L93 Difference]: Finished difference Result 22819 states and 29528 transitions. [2023-02-16 00:43:00,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:43:00,320 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 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 583 [2023-02-16 00:43:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:43:00,321 INFO L225 Difference]: With dead ends: 22819 [2023-02-16 00:43:00,321 INFO L226 Difference]: Without dead ends: 0 [2023-02-16 00:43:00,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1176 GetRequests, 1166 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-02-16 00:43:00,335 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 213 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:43:00,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 891 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 00:43:00,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-16 00:43:00,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-16 00:43:00,336 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-16 00:43:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-16 00:43:00,336 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 583 [2023-02-16 00:43:00,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:43:00,336 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-16 00:43:00,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 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-16 00:43:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-16 00:43:00,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-16 00:43:00,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-16 00:43:00,346 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-16 00:43:00,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:43:00,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-16 00:43:09,329 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2023-02-16 00:43:09,329 INFO L899 garLoopResultBuilder]: For program point L201(lines 201 608) no Hoare annotation was computed. [2023-02-16 00:43:09,330 INFO L899 garLoopResultBuilder]: For program point L168(lines 168 619) no Hoare annotation was computed. [2023-02-16 00:43:09,330 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 630) no Hoare annotation was computed. [2023-02-16 00:43:09,330 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8593#1(lines 186 613) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse3 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse4 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse4 .cse2 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (and .cse5 .cse1 .cse2) (and .cse3 .cse5 .cse4 .cse2))) [2023-02-16 00:43:09,330 INFO L899 garLoopResultBuilder]: For program point L367(lines 367 398) no Hoare annotation was computed. [2023-02-16 00:43:09,330 INFO L899 garLoopResultBuilder]: For program point L334(lines 334 338) no Hoare annotation was computed. [2023-02-16 00:43:09,330 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8529#1(lines 159 622) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2))) [2023-02-16 00:43:09,330 INFO L899 garLoopResultBuilder]: For program point L334-2(lines 334 338) no Hoare annotation was computed. [2023-02-16 00:43:09,331 INFO L899 garLoopResultBuilder]: For program point L533(lines 533 538) no Hoare annotation was computed. [2023-02-16 00:43:09,331 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8497#1(lines 147 626) the Hoare annotation is: (let ((.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse2 (let ((.cse5 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse5 2147483647)) (< .cse5 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1))) (or (and .cse0 .cse1) (and .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse2 .cse3) (and .cse4 .cse2 .cse3) (and .cse0 .cse4))) [2023-02-16 00:43:09,331 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 571) no Hoare annotation was computed. [2023-02-16 00:43:09,331 INFO L899 garLoopResultBuilder]: For program point L303(lines 303 307) no Hoare annotation was computed. [2023-02-16 00:43:09,331 INFO L899 garLoopResultBuilder]: For program point L303-2(lines 221 599) no Hoare annotation was computed. [2023-02-16 00:43:09,331 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 607) no Hoare annotation was computed. [2023-02-16 00:43:09,331 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 618) no Hoare annotation was computed. [2023-02-16 00:43:09,331 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 629) no Hoare annotation was computed. [2023-02-16 00:43:09,332 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8482#1(lines 135 630) the Hoare annotation is: (let ((.cse7 (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|))) (let ((.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse2 (let ((.cse8 (* 2 (mod .cse7 2147483648)))) (or (<= .cse8 8496) (not (<= .cse8 2147483647))))) (.cse0 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|))) (or (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496) .cse1 .cse2) (and .cse3 .cse4) (and .cse1 .cse4) (and .cse0 .cse3 .cse2) (and .cse0 .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) (let ((.cse6 (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|))) (.cse5 (* 4294967296 (div .cse7 2147483648)))) (or (= (+ .cse5 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse6) (and (= (+ .cse5 |ULTIMATE.start_ssl3_accept_~s__state~0#1| 4294967296) .cse6) (not (<= .cse6 (+ .cse5 2147483647)))))) (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|))))) [2023-02-16 00:43:09,332 INFO L899 garLoopResultBuilder]: For program point L370(lines 370 397) no Hoare annotation was computed. [2023-02-16 00:43:09,332 INFO L899 garLoopResultBuilder]: For program point L370-1(lines 370 397) no Hoare annotation was computed. [2023-02-16 00:43:09,332 INFO L899 garLoopResultBuilder]: For program point L371(lines 371 394) no Hoare annotation was computed. [2023-02-16 00:43:09,332 INFO L902 garLoopResultBuilder]: At program point L669(lines 76 686) the Hoare annotation is: true [2023-02-16 00:43:09,332 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 606) no Hoare annotation was computed. [2023-02-16 00:43:09,332 INFO L899 garLoopResultBuilder]: For program point L174(lines 174 617) no Hoare annotation was computed. [2023-02-16 00:43:09,332 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 628) no Hoare annotation was computed. [2023-02-16 00:43:09,332 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 437) no Hoare annotation was computed. [2023-02-16 00:43:09,333 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 258) no Hoare annotation was computed. [2023-02-16 00:43:09,333 INFO L899 garLoopResultBuilder]: For program point L241-2(lines 221 599) no Hoare annotation was computed. [2023-02-16 00:43:09,333 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 666) no Hoare annotation was computed. [2023-02-16 00:43:09,333 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 413) no Hoare annotation was computed. [2023-02-16 00:43:09,333 INFO L899 garLoopResultBuilder]: For program point L374(lines 374 393) no Hoare annotation was computed. [2023-02-16 00:43:09,333 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 688 699) the Hoare annotation is: true [2023-02-16 00:43:09,333 INFO L899 garLoopResultBuilder]: For program point L639(lines 639 663) no Hoare annotation was computed. [2023-02-16 00:43:09,333 INFO L899 garLoopResultBuilder]: For program point L573(lines 573 577) no Hoare annotation was computed. [2023-02-16 00:43:09,333 INFO L899 garLoopResultBuilder]: For program point L540(lines 540 544) no Hoare annotation was computed. [2023-02-16 00:43:09,333 INFO L899 garLoopResultBuilder]: For program point L507(lines 507 511) no Hoare annotation was computed. [2023-02-16 00:43:09,334 INFO L899 garLoopResultBuilder]: For program point L573-2(lines 573 577) no Hoare annotation was computed. [2023-02-16 00:43:09,334 INFO L899 garLoopResultBuilder]: For program point L540-2(lines 221 599) no Hoare annotation was computed. [2023-02-16 00:43:09,334 INFO L899 garLoopResultBuilder]: For program point L375(lines 375 379) no Hoare annotation was computed. [2023-02-16 00:43:09,334 INFO L899 garLoopResultBuilder]: For program point L375-2(lines 374 391) no Hoare annotation was computed. [2023-02-16 00:43:09,334 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 248) no Hoare annotation was computed. [2023-02-16 00:43:09,334 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 605) no Hoare annotation was computed. [2023-02-16 00:43:09,334 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 616) no Hoare annotation was computed. [2023-02-16 00:43:09,334 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 627) no Hoare annotation was computed. [2023-02-16 00:43:09,335 INFO L895 garLoopResultBuilder]: At program point L111-2(lines 111 668) the Hoare annotation is: (let ((.cse26 (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|))) (let ((.cse21 (* 2 (mod .cse26 2147483648))) (.cse22 (* 4294967296 (div .cse26 2147483648))) (.cse23 (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse16 (= (+ .cse22 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse23)) (.cse17 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)) (.cse25 (not (<= .cse21 2147483647)))) (let ((.cse18 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3)) (.cse15 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496)) (.cse10 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse7 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (= 8466 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse19 (or (<= .cse21 8496) .cse25)) (.cse4 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse13 (not .cse17)) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (.cse5 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse12 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse3 (or .cse25 (< .cse21 8656))) (.cse20 (let ((.cse24 (<= .cse23 (+ .cse22 2147483647)))) (or (and (= (+ .cse22 |ULTIMATE.start_ssl3_accept_~s__state~0#1| 4294967296) .cse23) (not .cse24)) (and .cse16 .cse24)))) (.cse14 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3 .cse5) (and .cse6 .cse7) (and .cse6 .cse8 .cse3) (and .cse9 .cse10 .cse11 .cse12) (and .cse4 .cse0 .cse2 .cse3 .cse13 .cse14) (and .cse0 .cse9) (and .cse15 .cse0 .cse16 .cse17) (and .cse6 .cse9) (and .cse3 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse10 .cse18 .cse11) (and .cse6 .cse2 .cse3 .cse10 .cse14) (and .cse6 .cse10 .cse18) (and (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse15 .cse0 .cse19) (and .cse0 .cse2 .cse3 .cse10 .cse14) (and .cse9 .cse7 .cse11) (and .cse6 .cse20) (and .cse7 .cse2 .cse3 .cse11) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8560) .cse3) (and (= 0 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8464)) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8544) .cse0 .cse3) (and .cse0 .cse8 .cse2 .cse3 .cse14) (and (<= .cse21 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse6 .cse1) (and .cse0 .cse3 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (and .cse6 .cse19) (and .cse0 .cse3 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (and .cse4 .cse6 .cse3 .cse13) (and .cse9 .cse11 .cse5 .cse12) (and .cse0 .cse2 .cse3 .cse20 .cse14)))))) [2023-02-16 00:43:09,335 INFO L899 garLoopResultBuilder]: For program point L673(lines 673 677) no Hoare annotation was computed. [2023-02-16 00:43:09,335 INFO L899 garLoopResultBuilder]: For program point L640(lines 640 649) no Hoare annotation was computed. [2023-02-16 00:43:09,335 INFO L899 garLoopResultBuilder]: For program point L673-2(lines 673 677) no Hoare annotation was computed. [2023-02-16 00:43:09,335 INFO L899 garLoopResultBuilder]: For program point L640-2(lines 639 661) no Hoare annotation was computed. [2023-02-16 00:43:09,335 INFO L899 garLoopResultBuilder]: For program point L475(lines 475 479) no Hoare annotation was computed. [2023-02-16 00:43:09,335 INFO L899 garLoopResultBuilder]: For program point L343-1(lines 343 352) no Hoare annotation was computed. [2023-02-16 00:43:09,335 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8481#1(lines 129 632) the Hoare annotation is: (let ((.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (let ((.cse5 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (<= .cse5 8496) (not (<= .cse5 2147483647))))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse2) (and .cse3 .cse1) (and .cse0 .cse4 .cse2) (and .cse3 .cse4))) [2023-02-16 00:43:09,336 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2023-02-16 00:43:09,336 INFO L899 garLoopResultBuilder]: For program point L642(lines 642 646) no Hoare annotation was computed. [2023-02-16 00:43:09,336 INFO L899 garLoopResultBuilder]: For program point L213(lines 213 604) no Hoare annotation was computed. [2023-02-16 00:43:09,336 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 615) no Hoare annotation was computed. [2023-02-16 00:43:09,336 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 626) no Hoare annotation was computed. [2023-02-16 00:43:09,336 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 637) no Hoare annotation was computed. [2023-02-16 00:43:09,336 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2023-02-16 00:43:09,336 INFO L899 garLoopResultBuilder]: For program point L480(lines 480 491) no Hoare annotation was computed. [2023-02-16 00:43:09,337 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 451) no Hoare annotation was computed. [2023-02-16 00:43:09,337 INFO L895 garLoopResultBuilder]: At program point L381(lines 364 399) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2))) [2023-02-16 00:43:09,337 INFO L899 garLoopResultBuilder]: For program point L249(lines 249 254) no Hoare annotation was computed. [2023-02-16 00:43:09,337 INFO L899 garLoopResultBuilder]: For program point L216(lines 216 603) no Hoare annotation was computed. [2023-02-16 00:43:09,337 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 614) no Hoare annotation was computed. [2023-02-16 00:43:09,337 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8657#1(lines 204 607) the Hoare annotation is: (let ((.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse0) (let ((.cse3 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (let ((.cse2 (not (<= .cse3 2147483647)))) (and .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) (or .cse2 (< .cse3 8656)) (or (<= .cse3 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse2) .cse0))) (and .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3) .cse0) (and .cse4 .cse1 .cse0))) [2023-02-16 00:43:09,337 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 625) no Hoare annotation was computed. [2023-02-16 00:43:09,337 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 636) no Hoare annotation was computed. [2023-02-16 00:43:09,337 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 93) no Hoare annotation was computed. [2023-02-16 00:43:09,338 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 387) no Hoare annotation was computed. [2023-02-16 00:43:09,338 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 423) no Hoare annotation was computed. [2023-02-16 00:43:09,338 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 613) no Hoare annotation was computed. [2023-02-16 00:43:09,338 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 624) no Hoare annotation was computed. [2023-02-16 00:43:09,338 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 635) no Hoare annotation was computed. [2023-02-16 00:43:09,338 INFO L899 garLoopResultBuilder]: For program point L583(lines 583 593) no Hoare annotation was computed. [2023-02-16 00:43:09,338 INFO L899 garLoopResultBuilder]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2023-02-16 00:43:09,338 INFO L899 garLoopResultBuilder]: For program point L484(lines 484 488) no Hoare annotation was computed. [2023-02-16 00:43:09,339 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 290) no Hoare annotation was computed. [2023-02-16 00:43:09,339 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 92) no Hoare annotation was computed. [2023-02-16 00:43:09,339 INFO L899 garLoopResultBuilder]: For program point L88-2(lines 85 93) no Hoare annotation was computed. [2023-02-16 00:43:09,339 INFO L902 garLoopResultBuilder]: At program point ssl3_accept_switch_1_3#1(lines 216 603) the Hoare annotation is: true [2023-02-16 00:43:09,339 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 522) no Hoare annotation was computed. [2023-02-16 00:43:09,339 INFO L899 garLoopResultBuilder]: For program point L320(lines 320 328) no Hoare annotation was computed. [2023-02-16 00:43:09,339 INFO L902 garLoopResultBuilder]: At program point L684(lines 76 686) the Hoare annotation is: true [2023-02-16 00:43:09,339 INFO L899 garLoopResultBuilder]: For program point L651(lines 651 657) no Hoare annotation was computed. [2023-02-16 00:43:09,340 INFO L902 garLoopResultBuilder]: At program point ssl3_accept_switch_1_default#1(lines 219 602) the Hoare annotation is: true [2023-02-16 00:43:09,340 INFO L895 garLoopResultBuilder]: At program point $Ultimate##176(lines 457 469) the Hoare annotation is: (let ((.cse10 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (let ((.cse11 (not (<= .cse10 2147483647)))) (let ((.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse4 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3)) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse6 (or .cse11 (< .cse10 8656))) (.cse7 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse9 (or (<= .cse10 8496) .cse11)) (.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse0 .cse5 .cse6 .cse2 .cse7) (and .cse1 .cse2 .cse8 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (and .cse3 .cse1 .cse2) (and .cse6 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse2 .cse4 .cse8) (and .cse3 .cse5 .cse6 .cse2 .cse7) (and (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496) .cse0 .cse9 .cse2) (and .cse3 .cse9 .cse2))))) [2023-02-16 00:43:09,340 INFO L899 garLoopResultBuilder]: For program point L552(lines 552 557) no Hoare annotation was computed. [2023-02-16 00:43:09,340 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8577#1(lines 180 615) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse3 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse4 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse4 .cse2 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (and .cse5 .cse1 .cse2) (and .cse3 .cse5 .cse4 .cse2))) [2023-02-16 00:43:09,340 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 612) no Hoare annotation was computed. [2023-02-16 00:43:09,340 INFO L899 garLoopResultBuilder]: For program point L156(lines 156 623) no Hoare annotation was computed. [2023-02-16 00:43:09,341 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 634) no Hoare annotation was computed. [2023-02-16 00:43:09,341 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 590) no Hoare annotation was computed. [2023-02-16 00:43:09,341 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-16 00:43:09,341 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8641#1(lines 198 609) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse4 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse2 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (and .cse4 .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse5 .cse2) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3) .cse2 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (and .cse4 .cse3 .cse5 .cse2))) [2023-02-16 00:43:09,341 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2023-02-16 00:43:09,341 INFO L899 garLoopResultBuilder]: For program point L323-2(lines 221 599) no Hoare annotation was computed. [2023-02-16 00:43:09,341 INFO L902 garLoopResultBuilder]: At program point L224(lines 117 636) the Hoare annotation is: true [2023-02-16 00:43:09,342 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_ERROR#1(lines 76 686) the Hoare annotation is: false [2023-02-16 00:43:09,342 INFO L902 garLoopResultBuilder]: At program point ssl3_accept_returnLabel#1(lines 19 687) the Hoare annotation is: true [2023-02-16 00:43:09,342 INFO L899 garLoopResultBuilder]: For program point L192(lines 192 611) no Hoare annotation was computed. [2023-02-16 00:43:09,342 INFO L899 garLoopResultBuilder]: For program point L159(lines 159 622) no Hoare annotation was computed. [2023-02-16 00:43:09,342 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 633) no Hoare annotation was computed. [2023-02-16 00:43:09,342 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2023-02-16 00:43:09,342 INFO L899 garLoopResultBuilder]: For program point L523-2(lines 523 527) no Hoare annotation was computed. [2023-02-16 00:43:09,342 INFO L899 garLoopResultBuilder]: For program point L457-1(lines 457 469) no Hoare annotation was computed. [2023-02-16 00:43:09,343 INFO L895 garLoopResultBuilder]: At program point $Ultimate##130(lines 343 352) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2))) [2023-02-16 00:43:09,343 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-16 00:43:09,343 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8673#1(lines 210 605) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (.cse1 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1) (and .cse0 .cse1 .cse2) (and .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) (let ((.cse3 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse3 2147483647)) (< .cse3 8656))) .cse2) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse1))) [2023-02-16 00:43:09,343 INFO L895 garLoopResultBuilder]: At program point L425(lines 416 436) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2))) [2023-02-16 00:43:09,343 INFO L899 garLoopResultBuilder]: For program point L359(lines 359 363) no Hoare annotation was computed. [2023-02-16 00:43:09,343 INFO L899 garLoopResultBuilder]: For program point L359-2(lines 221 599) no Hoare annotation was computed. [2023-02-16 00:43:09,343 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 103) no Hoare annotation was computed. [2023-02-16 00:43:09,344 INFO L899 garLoopResultBuilder]: For program point L95-1(lines 76 686) no Hoare annotation was computed. [2023-02-16 00:43:09,344 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8609#1(lines 192 611) the Hoare annotation is: (let ((.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse4 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (and .cse4 .cse3 .cse5 .cse2) (and .cse4 .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse5 .cse2))) [2023-02-16 00:43:09,344 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-16 00:43:09,344 INFO L895 garLoopResultBuilder]: At program point $Ultimate##158(lines 405 442) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse5 .cse4 .cse2))) [2023-02-16 00:43:09,344 INFO L899 garLoopResultBuilder]: For program point L195(lines 195 610) no Hoare annotation was computed. [2023-02-16 00:43:09,344 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 621) no Hoare annotation was computed. [2023-02-16 00:43:09,345 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 632) no Hoare annotation was computed. [2023-02-16 00:43:09,345 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 100) no Hoare annotation was computed. [2023-02-16 00:43:09,345 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8466#1(lines 138 629) the Hoare annotation is: (let ((.cse3 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (let ((.cse4 (not (<= .cse3 2147483647)))) (let ((.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse0 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse2 (or .cse4 (< .cse3 8656)))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse2 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496) .cse1 (or (<= .cse3 8496) .cse4)) (and .cse0 (= 0 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (and .cse1 .cse5) (and .cse6 .cse5) (and .cse0 .cse6 .cse2))))) [2023-02-16 00:43:09,345 INFO L899 garLoopResultBuilder]: For program point L460(lines 460 465) no Hoare annotation was computed. [2023-02-16 00:43:09,345 INFO L895 garLoopResultBuilder]: At program point $Ultimate##166(lines 416 436) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse5 .cse4 .cse2))) [2023-02-16 00:43:09,345 INFO L902 garLoopResultBuilder]: At program point ssl3_accept_switch_1_12292#1(lines 114 637) the Hoare annotation is: true [2023-02-16 00:43:09,345 INFO L899 garLoopResultBuilder]: For program point L229(lines 229 233) no Hoare annotation was computed. [2023-02-16 00:43:09,346 INFO L899 garLoopResultBuilder]: For program point L229-2(lines 221 599) no Hoare annotation was computed. [2023-02-16 00:43:09,346 INFO L899 garLoopResultBuilder]: For program point L428(lines 428 432) no Hoare annotation was computed. [2023-02-16 00:43:09,346 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-16 00:43:09,346 INFO L895 garLoopResultBuilder]: At program point $Ultimate##219(lines 638 666) the Hoare annotation is: (let ((.cse26 (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|))) (let ((.cse21 (* 2 (mod .cse26 2147483648))) (.cse22 (* 4294967296 (div .cse26 2147483648))) (.cse23 (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse16 (= (+ .cse22 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse23)) (.cse17 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)) (.cse25 (not (<= .cse21 2147483647)))) (let ((.cse18 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3)) (.cse15 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496)) (.cse10 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse7 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (= 8466 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse19 (or (<= .cse21 8496) .cse25)) (.cse4 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse13 (not .cse17)) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (.cse5 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse12 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse3 (or .cse25 (< .cse21 8656))) (.cse20 (let ((.cse24 (<= .cse23 (+ .cse22 2147483647)))) (or (and (= (+ .cse22 |ULTIMATE.start_ssl3_accept_~s__state~0#1| 4294967296) .cse23) (not .cse24)) (and .cse16 .cse24)))) (.cse14 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3 .cse5) (and .cse6 .cse7) (and .cse6 .cse8 .cse3) (and .cse9 .cse10 .cse11 .cse12) (and .cse4 .cse0 .cse2 .cse3 .cse13 .cse14) (and .cse0 .cse9) (and .cse15 .cse0 .cse16 .cse17) (and .cse6 .cse9) (and .cse3 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse10 .cse18 .cse11) (and .cse6 .cse2 .cse3 .cse10 .cse14) (and .cse6 .cse10 .cse18) (and (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse15 .cse0 .cse19) (and .cse0 .cse2 .cse3 .cse10 .cse14) (and .cse9 .cse7 .cse11) (and .cse6 .cse20) (and .cse7 .cse2 .cse3 .cse11) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8560) .cse3) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8544) .cse0 .cse3) (and .cse0 .cse8 .cse2 .cse3 .cse14) (and (<= .cse21 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse6 .cse1) (and .cse0 .cse3 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (and .cse6 .cse19) (and .cse0 .cse3 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (and .cse4 .cse6 .cse3 .cse13) (and .cse9 .cse11 .cse5 .cse12) (and .cse0 .cse2 .cse3 .cse20 .cse14)))))) [2023-02-16 00:43:09,346 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 680) no Hoare annotation was computed. [2023-02-16 00:43:09,346 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 609) no Hoare annotation was computed. [2023-02-16 00:43:09,347 INFO L899 garLoopResultBuilder]: For program point L165(lines 165 620) no Hoare annotation was computed. [2023-02-16 00:43:09,347 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 631) no Hoare annotation was computed. [2023-02-16 00:43:09,347 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8561#1(lines 171 618) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2))) [2023-02-16 00:43:09,347 INFO L899 garLoopResultBuilder]: For program point L562(lines 562 566) no Hoare annotation was computed. [2023-02-16 00:43:09,347 INFO L899 garLoopResultBuilder]: For program point L496(lines 496 500) no Hoare annotation was computed. [2023-02-16 00:43:09,347 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 280) no Hoare annotation was computed. [2023-02-16 00:43:09,351 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:43:09,352 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 00:43:09,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 12:43:09 BoogieIcfgContainer [2023-02-16 00:43:09,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 00:43:09,386 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 00:43:09,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 00:43:09,386 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 00:43:09,387 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:42:48" (3/4) ... [2023-02-16 00:43:09,389 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-16 00:43:09,408 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-02-16 00:43:09,409 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-16 00:43:09,410 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-16 00:43:09,410 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-16 00:43:09,477 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 00:43:09,478 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 00:43:09,478 INFO L158 Benchmark]: Toolchain (without parser) took 22289.50ms. Allocated memory was 104.9MB in the beginning and 618.7MB in the end (delta: 513.8MB). Free memory was 63.5MB in the beginning and 388.9MB in the end (delta: -325.5MB). Peak memory consumption was 191.4MB. Max. memory is 16.1GB. [2023-02-16 00:43:09,478 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory was 73.6MB in the beginning and 73.5MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 00:43:09,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.19ms. Allocated memory is still 104.9MB. Free memory was 63.3MB in the beginning and 47.8MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-16 00:43:09,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.21ms. Allocated memory is still 104.9MB. Free memory was 47.6MB in the beginning and 44.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 00:43:09,479 INFO L158 Benchmark]: Boogie Preprocessor took 50.60ms. Allocated memory is still 104.9MB. Free memory was 44.8MB in the beginning and 77.7MB in the end (delta: -33.0MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2023-02-16 00:43:09,479 INFO L158 Benchmark]: RCFGBuilder took 576.14ms. Allocated memory was 104.9MB in the beginning and 134.2MB in the end (delta: 29.4MB). Free memory was 77.7MB in the beginning and 105.0MB in the end (delta: -27.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-02-16 00:43:09,480 INFO L158 Benchmark]: TraceAbstraction took 21286.55ms. Allocated memory was 134.2MB in the beginning and 618.7MB in the end (delta: 484.4MB). Free memory was 104.4MB in the beginning and 397.4MB in the end (delta: -293.0MB). Peak memory consumption was 416.2MB. Max. memory is 16.1GB. [2023-02-16 00:43:09,480 INFO L158 Benchmark]: Witness Printer took 91.41ms. Allocated memory is still 618.7MB. Free memory was 397.4MB in the beginning and 388.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-16 00:43:09,486 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.14ms. Allocated memory is still 104.9MB. Free memory was 73.6MB in the beginning and 73.5MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.19ms. Allocated memory is still 104.9MB. Free memory was 63.3MB in the beginning and 47.8MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.21ms. Allocated memory is still 104.9MB. Free memory was 47.6MB in the beginning and 44.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.60ms. Allocated memory is still 104.9MB. Free memory was 44.8MB in the beginning and 77.7MB in the end (delta: -33.0MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * RCFGBuilder took 576.14ms. Allocated memory was 104.9MB in the beginning and 134.2MB in the end (delta: 29.4MB). Free memory was 77.7MB in the beginning and 105.0MB in the end (delta: -27.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 21286.55ms. Allocated memory was 134.2MB in the beginning and 618.7MB in the end (delta: 484.4MB). Free memory was 104.4MB in the beginning and 397.4MB in the end (delta: -293.0MB). Peak memory consumption was 416.2MB. Max. memory is 16.1GB. * Witness Printer took 91.41ms. Allocated memory is still 618.7MB. Free memory was 397.4MB in the beginning and 388.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 680]: 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: 21.2s, OverallIterations: 20, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2992 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2992 mSDsluCounter, 9727 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4808 mSDsCounter, 618 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4822 IncrementalHoareTripleChecker+Invalid, 5440 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 618 mSolverCounterUnsat, 4919 mSDtfsCounter, 4822 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3990 GetRequests, 3925 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16675occurred in iteration=19, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 4912 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 748 NumberOfFragments, 3329 HoareAnnotationTreeSize, 29 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 71525 FormulaSimplificationTreeSizeReductionInter, 8.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 7056 NumberOfCodeBlocks, 7056 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 8793 ConstructedInterpolants, 0 QuantifiedInterpolants, 22429 SizeOfPredicates, 12 NumberOfNonLiveVariables, 3407 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 29 InterpolantComputations, 16 PerfectInterpolantSequences, 39472/40261 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: 114]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576) || ((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496))) || (((blastFlag == 1 && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576)) || ((!(s__hit == 0) && blastFlag == 1) && !(s__state <= 8496)) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576) || ((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496))) || (((blastFlag == 1 && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576)) || ((!(s__hit == 0) && blastFlag == 1) && !(s__state <= 8496)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((!(s__hit == 0) && 2 == blastFlag) || (((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8576)) || ((blastFlag == 1 && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8576)) || (!(s__hit == 0) && blastFlag == 1) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496)) || ((blastFlag == 1 && !(s__hit == 0)) && !(s__state <= 8496))) || (((!(8656 <= s__state) && blastFlag == 1) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496))) || ((((!(8656 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496)) || (((((!(8656 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0)) || ((blastFlag == 1 && !(s__hit == 0)) && !(s__state <= 8496))) || (((!(8656 <= s__state) && blastFlag == 1) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((!(8496 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 8496 < s__s3__tmp__next_state___0) || (((!(8496 <= s__state) && s__s3__tmp__next_state___0 < 8496) && 2 == blastFlag) && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647)))) || (!(8496 <= s__state) && 0 == blastFlag)) || (2 == blastFlag && !(s__hit == 0))) || (blastFlag == 1 && !(s__hit == 0))) || ((!(8496 <= s__state) && blastFlag == 1) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496)) || (((((!(8656 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0)) || ((blastFlag == 1 && !(s__hit == 0)) && !(s__state <= 8496))) || (((!(8656 <= s__state) && blastFlag == 1) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((!(s__hit == 0) && 2 == blastFlag) && 8672 <= s__state) || ((!(s__hit == 0) && 8672 <= s__state) && blastFlag == 3)) || (((8672 <= s__state && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && blastFlag == 3)) || (blastFlag == 1 && 8672 <= s__state) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((!(8496 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647))) || (!(s__hit == 0) && 2 == blastFlag)) || ((!(8496 <= s__state) && blastFlag == 1) && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647)))) || (!(s__hit == 0) && blastFlag == 1) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 == blastFlag && s__state == 8656) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) || ((((!(8656 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 8640 <= s__state)) || (blastFlag == 1 && 8672 <= s__state)) || ((blastFlag == 1 && 8466 == s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656))) || (((!(s__hit == 0) && s__state <= 8448) && blastFlag == 3) && 8640 <= s__s3__tmp__next_state___0)) || (((((!(8656 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0)) || (2 == blastFlag && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 < 8496 && 2 == blastFlag) && 4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state == 2 * ag_X + 2 * ag_Y) && s__state <= 8496)) || (blastFlag == 1 && !(s__hit == 0))) || (((((!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656) && 0 == s__hit) && s__state <= 8448) && s__s3__tmp__next_state___0 == 3) && blastFlag == 3)) || ((((blastFlag == 1 && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0)) || ((blastFlag == 1 && s__state <= 8448) && s__s3__tmp__next_state___0 == 3)) || (((!(8496 <= s__state) && s__s3__tmp__next_state___0 < 8496) && 2 == blastFlag) && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647)))) || ((((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0)) || ((!(s__hit == 0) && 8672 <= s__state) && blastFlag == 3)) || (blastFlag == 1 && ((4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state + 4294967296 == 2 * ag_X + 2 * ag_Y && !(2 * ag_X + 2 * ag_Y <= 4294967296 * ((ag_X + ag_Y) / 2147483648) + 2147483647)) || (4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state == 2 * ag_X + 2 * ag_Y && 2 * ag_X + 2 * ag_Y <= 4294967296 * ((ag_X + ag_Y) / 2147483648) + 2147483647)))) || (((8672 <= s__state && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && blastFlag == 3)) || ((2 == blastFlag && s__state == 8560) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656))) || ((s__state == 8544 && 2 == blastFlag) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656))) || ((((2 == blastFlag && 8466 == s__state) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 8496 < s__s3__tmp__next_state___0)) || ((2 * ((ag_X + ag_Y) % 2147483648) <= s__state && blastFlag == 1) && s__state == 8656)) || ((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state == 8512)) || (blastFlag == 1 && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647)))) || ((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state == 8528)) || (((!(8656 <= s__state) && blastFlag == 1) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496))) || (((!(s__hit == 0) && blastFlag == 3) && 8640 <= s__state) && 8640 <= s__s3__tmp__next_state___0)) || ((((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && ((4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state + 4294967296 == 2 * ag_X + 2 * ag_Y && !(2 * ag_X + 2 * ag_Y <= 4294967296 * ((ag_X + ag_Y) / 2147483648) + 2147483647)) || (4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state == 2 * ag_X + 2 * ag_Y && 2 * ag_X + 2 * ag_Y <= 4294967296 * ((ag_X + ag_Y) / 2147483648) + 2147483647))) && 8496 < s__s3__tmp__next_state___0) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((((((2 == blastFlag && !(s__hit == 0)) && s__state <= 8448) || ((blastFlag == 1 && s__state <= 8448) && s__s3__tmp__next_state___0 == 3)) || ((((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0)) || (((!(s__hit == 0) && s__state <= 8448) && blastFlag == 3) && 8640 <= s__s3__tmp__next_state___0)) || ((blastFlag == 1 && !(s__hit == 0)) && s__state <= 8448)) || (((((!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656) && 0 == s__hit) && s__state <= 8448) && s__s3__tmp__next_state___0 == 3) && blastFlag == 3)) || ((((blastFlag == 1 && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0)) || (((s__s3__tmp__next_state___0 < 8496 && 2 == blastFlag) && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647))) && s__state <= 8448)) || ((blastFlag == 1 && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647))) && s__state <= 8448) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((2 == blastFlag && !(s__hit == 0)) && 8640 <= s__state) || ((blastFlag == 1 && !(s__hit == 0)) && 8640 <= s__state)) || ((((!(8656 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 8640 <= s__state)) || (((!(s__hit == 0) && blastFlag == 3) && 8640 <= s__state) && 8640 <= s__s3__tmp__next_state___0)) || (((!(8656 <= s__state) && blastFlag == 1) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 8640 <= s__state) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((!(8496 <= s__state) && s__s3__tmp__next_state___0 < 8496) && 2 == blastFlag) && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647))) || (blastFlag == 1 && !(s__hit == 0))) || (2 == blastFlag && !(s__hit == 0))) || ((!(8496 <= s__state) && blastFlag == 1) && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647)))) || ((((!(8496 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state == 2 * ag_X + 2 * ag_Y || (4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state + 4294967296 == 2 * ag_X + 2 * ag_Y && !(2 * ag_X + 2 * ag_Y <= 4294967296 * ((ag_X + ag_Y) / 2147483648) + 2147483647)))) && 8496 < s__s3__tmp__next_state___0) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576) || ((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496))) || (((blastFlag == 1 && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576)) || ((!(s__hit == 0) && blastFlag == 1) && !(s__state <= 8496)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (((blastFlag == 1 && 8640 <= s__state) || ((((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && (2 * ((ag_X + ag_Y) % 2147483648) <= s__state || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647))) && 8640 <= s__state)) || ((!(s__hit == 0) && blastFlag == 3) && 8640 <= s__state)) || ((!(s__hit == 0) && 2 == blastFlag) && 8640 <= s__state) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 688]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 343]: Loop Invariant Derived loop invariant: (((((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576) || ((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496))) || (((blastFlag == 1 && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576)) || ((!(s__hit == 0) && blastFlag == 1) && !(s__state <= 8496)) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((2 == blastFlag && s__state == 8656) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) || ((((!(8656 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 8640 <= s__state)) || (blastFlag == 1 && 8672 <= s__state)) || ((blastFlag == 1 && 8466 == s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656))) || (((!(s__hit == 0) && s__state <= 8448) && blastFlag == 3) && 8640 <= s__s3__tmp__next_state___0)) || (((((!(8656 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0)) || (2 == blastFlag && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 < 8496 && 2 == blastFlag) && 4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state == 2 * ag_X + 2 * ag_Y) && s__state <= 8496)) || (blastFlag == 1 && !(s__hit == 0))) || (((((!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656) && 0 == s__hit) && s__state <= 8448) && s__s3__tmp__next_state___0 == 3) && blastFlag == 3)) || ((((blastFlag == 1 && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0)) || ((blastFlag == 1 && s__state <= 8448) && s__s3__tmp__next_state___0 == 3)) || (((!(8496 <= s__state) && s__s3__tmp__next_state___0 < 8496) && 2 == blastFlag) && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647)))) || ((((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0)) || ((!(s__hit == 0) && 8672 <= s__state) && blastFlag == 3)) || (blastFlag == 1 && ((4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state + 4294967296 == 2 * ag_X + 2 * ag_Y && !(2 * ag_X + 2 * ag_Y <= 4294967296 * ((ag_X + ag_Y) / 2147483648) + 2147483647)) || (4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state == 2 * ag_X + 2 * ag_Y && 2 * ag_X + 2 * ag_Y <= 4294967296 * ((ag_X + ag_Y) / 2147483648) + 2147483647)))) || (((8672 <= s__state && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && blastFlag == 3)) || ((2 == blastFlag && s__state == 8560) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656))) || (0 == blastFlag && s__state == 8464)) || ((s__state == 8544 && 2 == blastFlag) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656))) || ((((2 == blastFlag && 8466 == s__state) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 8496 < s__s3__tmp__next_state___0)) || ((2 * ((ag_X + ag_Y) % 2147483648) <= s__state && blastFlag == 1) && s__state == 8656)) || ((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state == 8512)) || (blastFlag == 1 && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647)))) || ((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state == 8528)) || (((!(8656 <= s__state) && blastFlag == 1) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496))) || (((!(s__hit == 0) && blastFlag == 3) && 8640 <= s__state) && 8640 <= s__s3__tmp__next_state___0)) || ((((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && ((4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state + 4294967296 == 2 * ag_X + 2 * ag_Y && !(2 * ag_X + 2 * ag_Y <= 4294967296 * ((ag_X + ag_Y) / 2147483648) + 2147483647)) || (4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state == 2 * ag_X + 2 * ag_Y && 2 * ag_X + 2 * ag_Y <= 4294967296 * ((ag_X + ag_Y) / 2147483648) + 2147483647))) && 8496 < s__s3__tmp__next_state___0) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576) || ((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496))) || (((blastFlag == 1 && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576)) || ((blastFlag == 1 && !(s__hit == 0)) && !(s__state <= 8496)) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: (((((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576) || ((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496))) || (((blastFlag == 1 && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576)) || ((blastFlag == 1 && !(s__hit == 0)) && !(s__state <= 8496)) - InvariantResult [Line: 364]: Loop Invariant Derived loop invariant: (((((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576) || ((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496))) || (((blastFlag == 1 && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576)) || ((!(s__hit == 0) && blastFlag == 1) && !(s__state <= 8496)) RESULT: Ultimate proved your program to be correct! [2023-02-16 00:43:09,518 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