./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 7e44eca549ad63e100ff6b29db4a1cf439ea9f40f98c1b07aaed555a9a1c91f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:49:27,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:49:28,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:49:28,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:49:28,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:49:28,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:49:28,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:49:28,057 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:49:28,057 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:49:28,058 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:49:28,058 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:49:28,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:49:28,058 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:49:28,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:49:28,059 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:49:28,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:49:28,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:49:28,059 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:49:28,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:49:28,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:49:28,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:49:28,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:49:28,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:49:28,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:49:28,060 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:49:28,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:49:28,060 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:49:28,060 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:49:28,060 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:49:28,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:49:28,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:49:28,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:49:28,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:49:28,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:49:28,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:49:28,061 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:49:28,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:49:28,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:49:28,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:49:28,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:49:28,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:49:28,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:49:28,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:49:28,062 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 7e44eca549ad63e100ff6b29db4a1cf439ea9f40f98c1b07aaed555a9a1c91f0 [2025-02-06 03:49:28,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:49:28,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:49:28,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:49:28,325 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:49:28,325 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:49:28,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i [2025-02-06 03:49:29,521 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/afa65e12e/53cbeb1fb8f74a4485bf2481b948f3bb/FLAG5a8309826 [2025-02-06 03:49:29,761 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:49:29,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i [2025-02-06 03:49:29,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/afa65e12e/53cbeb1fb8f74a4485bf2481b948f3bb/FLAG5a8309826 [2025-02-06 03:49:30,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/afa65e12e/53cbeb1fb8f74a4485bf2481b948f3bb [2025-02-06 03:49:30,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:49:30,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:49:30,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:49:30,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:49:30,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:49:30,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:49:30" (1/1) ... [2025-02-06 03:49:30,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@689ed7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:30, skipping insertion in model container [2025-02-06 03:49:30,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:49:30" (1/1) ... [2025-02-06 03:49:30,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:49:30,202 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i[916,929] [2025-02-06 03:49:30,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:49:30,257 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:49:30,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i[916,929] [2025-02-06 03:49:30,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:49:30,317 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:49:30,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:30 WrapperNode [2025-02-06 03:49:30,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:49:30,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:49:30,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:49:30,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:49:30,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:30" (1/1) ... [2025-02-06 03:49:30,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:30" (1/1) ... [2025-02-06 03:49:30,375 INFO L138 Inliner]: procedures = 30, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 551 [2025-02-06 03:49:30,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:49:30,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:49:30,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:49:30,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:49:30,385 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:30" (1/1) ... [2025-02-06 03:49:30,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:30" (1/1) ... [2025-02-06 03:49:30,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:30" (1/1) ... [2025-02-06 03:49:30,401 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 03:49:30,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:30" (1/1) ... [2025-02-06 03:49:30,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:30" (1/1) ... [2025-02-06 03:49:30,425 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:30" (1/1) ... [2025-02-06 03:49:30,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:30" (1/1) ... [2025-02-06 03:49:30,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:30" (1/1) ... [2025-02-06 03:49:30,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:30" (1/1) ... [2025-02-06 03:49:30,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:49:30,439 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:49:30,439 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:49:30,439 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:49:30,440 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:30" (1/1) ... [2025-02-06 03:49:30,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:49:30,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:49:30,471 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:49:30,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:49:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:49:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 03:49:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 03:49:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 03:49:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 03:49:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 03:49:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 03:49:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:49:30,490 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:49:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 03:49:30,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:49:30,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:49:30,584 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:49:30,586 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:49:31,026 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L122: havoc property_#t~mem91#1;havoc property_#t~ite107#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem103#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite120#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem119#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short121#1;havoc property_#t~mem131#1;havoc property_#t~mem122#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem125#1;havoc property_#t~ite130#1;havoc property_#t~mem126#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite139#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite138#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short140#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite155#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~short145#1;havoc property_#t~ite152#1;havoc property_#t~mem149#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~short148#1;havoc property_#t~mem151#1;havoc property_#t~mem150#1;havoc property_#t~mem154#1;havoc property_#t~mem153#1;havoc property_#t~short156#1; [2025-02-06 03:49:31,075 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2025-02-06 03:49:31,076 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:49:31,089 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:49:31,090 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:49:31,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:49:31 BoogieIcfgContainer [2025-02-06 03:49:31,091 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:49:31,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:49:31,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:49:31,096 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:49:31,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:49:30" (1/3) ... [2025-02-06 03:49:31,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7d9f47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:49:31, skipping insertion in model container [2025-02-06 03:49:31,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:30" (2/3) ... [2025-02-06 03:49:31,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7d9f47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:49:31, skipping insertion in model container [2025-02-06 03:49:31,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:49:31" (3/3) ... [2025-02-06 03:49:31,099 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-25.i [2025-02-06 03:49:31,110 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:49:31,111 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-25.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:49:31,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:49:31,157 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@3a1d5293, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:49:31,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:49:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:49:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:49:31,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:31,170 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:31,170 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:31,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:31,174 INFO L85 PathProgramCache]: Analyzing trace with hash 582456791, now seen corresponding path program 1 times [2025-02-06 03:49:31,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:31,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084050428] [2025-02-06 03:49:31,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:31,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:31,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:49:31,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:49:31,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:31,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:31,532 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:49:31,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:31,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084050428] [2025-02-06 03:49:31,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084050428] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:49:31,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023272389] [2025-02-06 03:49:31,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:31,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:49:31,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:49:31,541 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:49:31,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:49:31,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:49:31,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:49:31,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:31,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:31,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:49:31,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:49:31,784 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:49:31,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:49:31,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023272389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:31,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:49:31,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:49:31,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465058032] [2025-02-06 03:49:31,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:31,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:49:31,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:31,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:49:31,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:49:31,811 INFO L87 Difference]: Start difference. First operand has 123 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:49:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:31,830 INFO L93 Difference]: Finished difference Result 240 states and 375 transitions. [2025-02-06 03:49:31,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:49:31,832 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2025-02-06 03:49:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:31,836 INFO L225 Difference]: With dead ends: 240 [2025-02-06 03:49:31,836 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 03:49:31,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:49:31,843 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:31,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:49:31,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 03:49:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-02-06 03:49:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:49:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-02-06 03:49:31,872 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 144 [2025-02-06 03:49:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:31,873 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-02-06 03:49:31,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:49:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-02-06 03:49:31,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:49:31,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:31,875 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:31,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:49:32,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:49:32,077 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:32,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:32,078 INFO L85 PathProgramCache]: Analyzing trace with hash -159892985, now seen corresponding path program 1 times [2025-02-06 03:49:32,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:32,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633754288] [2025-02-06 03:49:32,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:32,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:32,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:49:32,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:49:32,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:32,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:49:34,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:34,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633754288] [2025-02-06 03:49:34,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633754288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:34,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:34,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:49:34,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13373197] [2025-02-06 03:49:34,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:34,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:49:34,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:34,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:49:34,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:49:34,139 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:49:34,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:34,884 INFO L93 Difference]: Finished difference Result 319 states and 467 transitions. [2025-02-06 03:49:34,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:49:34,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2025-02-06 03:49:34,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:34,887 INFO L225 Difference]: With dead ends: 319 [2025-02-06 03:49:34,887 INFO L226 Difference]: Without dead ends: 202 [2025-02-06 03:49:34,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:49:34,888 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 99 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:34,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 757 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:49:34,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-06 03:49:34,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2025-02-06 03:49:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 168 states have (on average 1.3988095238095237) internal successors, (235), 169 states have internal predecessors, (235), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:49:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 291 transitions. [2025-02-06 03:49:34,910 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 291 transitions. Word has length 144 [2025-02-06 03:49:34,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:34,913 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 291 transitions. [2025-02-06 03:49:34,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:49:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 291 transitions. [2025-02-06 03:49:34,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:49:34,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:34,917 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:34,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:49:34,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:34,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1249211203, now seen corresponding path program 1 times [2025-02-06 03:49:34,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:34,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859483168] [2025-02-06 03:49:34,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:34,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:34,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:49:35,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:49:35,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:35,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:35,684 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:49:35,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:35,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859483168] [2025-02-06 03:49:35,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859483168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:35,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:35,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:49:35,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913851728] [2025-02-06 03:49:35,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:35,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:49:35,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:35,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:49:35,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:49:35,687 INFO L87 Difference]: Start difference. First operand 199 states and 291 transitions. Second operand has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:49:36,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:36,381 INFO L93 Difference]: Finished difference Result 434 states and 634 transitions. [2025-02-06 03:49:36,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:49:36,382 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-02-06 03:49:36,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:36,384 INFO L225 Difference]: With dead ends: 434 [2025-02-06 03:49:36,384 INFO L226 Difference]: Without dead ends: 238 [2025-02-06 03:49:36,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:49:36,385 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 143 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:36,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 674 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:49:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-06 03:49:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 229. [2025-02-06 03:49:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 189 states have (on average 1.380952380952381) internal successors, (261), 190 states have internal predecessors, (261), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:49:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 333 transitions. [2025-02-06 03:49:36,420 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 333 transitions. Word has length 145 [2025-02-06 03:49:36,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:36,421 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 333 transitions. [2025-02-06 03:49:36,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:49:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 333 transitions. [2025-02-06 03:49:36,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 03:49:36,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:36,425 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:36,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:49:36,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:36,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:36,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1955716639, now seen corresponding path program 1 times [2025-02-06 03:49:36,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:36,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503470568] [2025-02-06 03:49:36,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:36,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:36,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 03:49:36,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 03:49:36,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:36,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:49:36,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:36,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503470568] [2025-02-06 03:49:36,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503470568] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:49:36,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126118620] [2025-02-06 03:49:36,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:36,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:49:36,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:49:36,611 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:49:36,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:49:36,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 03:49:36,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 03:49:36,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:36,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:36,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:49:36,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:49:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:49:36,825 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:49:36,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126118620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:36,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:49:36,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-02-06 03:49:36,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150412977] [2025-02-06 03:49:36,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:36,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:49:36,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:36,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:49:36,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:49:36,827 INFO L87 Difference]: Start difference. First operand 229 states and 333 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:49:36,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:36,867 INFO L93 Difference]: Finished difference Result 461 states and 671 transitions. [2025-02-06 03:49:36,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:49:36,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2025-02-06 03:49:36,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:36,871 INFO L225 Difference]: With dead ends: 461 [2025-02-06 03:49:36,871 INFO L226 Difference]: Without dead ends: 235 [2025-02-06 03:49:36,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:49:36,873 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:36,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 682 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:49:36,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-06 03:49:36,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2025-02-06 03:49:36,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 193 states have (on average 1.3730569948186528) internal successors, (265), 194 states have internal predecessors, (265), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:49:36,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 337 transitions. [2025-02-06 03:49:36,887 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 337 transitions. Word has length 146 [2025-02-06 03:49:36,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:36,887 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 337 transitions. [2025-02-06 03:49:36,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:49:36,888 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 337 transitions. [2025-02-06 03:49:36,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:49:36,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:36,889 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:36,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:49:37,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:49:37,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:37,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:37,090 INFO L85 PathProgramCache]: Analyzing trace with hash -2056376413, now seen corresponding path program 1 times [2025-02-06 03:49:37,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:37,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065278326] [2025-02-06 03:49:37,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:37,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:37,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:49:37,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:49:37,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:37,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:49:37,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:37,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065278326] [2025-02-06 03:49:37,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065278326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:37,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:37,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:49:37,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828875777] [2025-02-06 03:49:37,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:37,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:49:37,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:37,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:49:37,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:49:37,702 INFO L87 Difference]: Start difference. First operand 233 states and 337 transitions. Second operand has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:49:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:38,379 INFO L93 Difference]: Finished difference Result 465 states and 673 transitions. [2025-02-06 03:49:38,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:49:38,382 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 148 [2025-02-06 03:49:38,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:38,384 INFO L225 Difference]: With dead ends: 465 [2025-02-06 03:49:38,384 INFO L226 Difference]: Without dead ends: 235 [2025-02-06 03:49:38,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:49:38,385 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 131 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:38,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 739 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:49:38,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-06 03:49:38,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 226. [2025-02-06 03:49:38,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 186 states have (on average 1.3655913978494623) internal successors, (254), 187 states have internal predecessors, (254), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:49:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 326 transitions. [2025-02-06 03:49:38,408 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 326 transitions. Word has length 148 [2025-02-06 03:49:38,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:38,409 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 326 transitions. [2025-02-06 03:49:38,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:49:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 326 transitions. [2025-02-06 03:49:38,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:49:38,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:38,410 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:38,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:49:38,410 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:38,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:38,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1638726691, now seen corresponding path program 1 times [2025-02-06 03:49:38,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:38,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368895146] [2025-02-06 03:49:38,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:38,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:38,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:49:38,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:49:38,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:38,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:49:38,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:38,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368895146] [2025-02-06 03:49:38,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368895146] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:49:38,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052709536] [2025-02-06 03:49:38,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:38,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:49:38,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:49:38,751 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:49:38,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:49:38,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:49:38,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:49:38,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:38,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:38,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:49:38,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:49:39,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2025-02-06 03:49:39,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:39,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 14 [2025-02-06 03:49:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 113 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:49:39,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:49:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:49:39,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052709536] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:49:39,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:49:39,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2025-02-06 03:49:39,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39274903] [2025-02-06 03:49:39,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:49:39,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:49:39,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:39,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:49:39,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:49:39,230 INFO L87 Difference]: Start difference. First operand 226 states and 326 transitions. Second operand has 13 states, 10 states have (on average 7.4) internal successors, (74), 13 states have internal predecessors, (74), 5 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 5 states have call successors, (21) [2025-02-06 03:49:40,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:40,250 INFO L93 Difference]: Finished difference Result 593 states and 844 transitions. [2025-02-06 03:49:40,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 03:49:40,251 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 7.4) internal successors, (74), 13 states have internal predecessors, (74), 5 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 5 states have call successors, (21) Word has length 148 [2025-02-06 03:49:40,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:40,254 INFO L225 Difference]: With dead ends: 593 [2025-02-06 03:49:40,255 INFO L226 Difference]: Without dead ends: 370 [2025-02-06 03:49:40,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 289 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2025-02-06 03:49:40,256 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 726 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:40,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 453 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:49:40,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-02-06 03:49:40,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 353. [2025-02-06 03:49:40,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 290 states have (on average 1.3517241379310345) internal successors, (392), 292 states have internal predecessors, (392), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-06 03:49:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 500 transitions. [2025-02-06 03:49:40,293 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 500 transitions. Word has length 148 [2025-02-06 03:49:40,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:40,294 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 500 transitions. [2025-02-06 03:49:40,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 7.4) internal successors, (74), 13 states have internal predecessors, (74), 5 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 5 states have call successors, (21) [2025-02-06 03:49:40,294 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 500 transitions. [2025-02-06 03:49:40,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 03:49:40,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:40,295 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:40,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 03:49:40,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:49:40,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:40,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:40,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1183552801, now seen corresponding path program 1 times [2025-02-06 03:49:40,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:40,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801733328] [2025-02-06 03:49:40,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:40,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:40,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:49:40,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:49:40,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:40,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:49:41,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:41,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801733328] [2025-02-06 03:49:41,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801733328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:41,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:41,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:49:41,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908280114] [2025-02-06 03:49:41,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:41,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:49:41,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:41,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:49:41,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:49:41,137 INFO L87 Difference]: Start difference. First operand 353 states and 500 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:49:41,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:41,962 INFO L93 Difference]: Finished difference Result 825 states and 1168 transitions. [2025-02-06 03:49:41,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:49:41,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-02-06 03:49:41,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:41,965 INFO L225 Difference]: With dead ends: 825 [2025-02-06 03:49:41,965 INFO L226 Difference]: Without dead ends: 475 [2025-02-06 03:49:41,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:49:41,968 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 89 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:41,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 619 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:49:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-02-06 03:49:41,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 471. [2025-02-06 03:49:41,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 402 states have (on average 1.3681592039800996) internal successors, (550), 406 states have internal predecessors, (550), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:49:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 666 transitions. [2025-02-06 03:49:41,993 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 666 transitions. Word has length 149 [2025-02-06 03:49:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:41,997 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 666 transitions. [2025-02-06 03:49:41,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:49:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 666 transitions. [2025-02-06 03:49:41,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:49:41,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:41,999 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:41,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:49:41,999 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:41,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:41,999 INFO L85 PathProgramCache]: Analyzing trace with hash -678263455, now seen corresponding path program 1 times [2025-02-06 03:49:41,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:41,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937173576] [2025-02-06 03:49:41,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:42,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:42,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:49:42,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:49:42,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:42,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:49:43,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:43,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937173576] [2025-02-06 03:49:43,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937173576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:43,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:43,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:49:43,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910861768] [2025-02-06 03:49:43,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:43,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:49:43,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:43,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:49:43,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:49:43,619 INFO L87 Difference]: Start difference. First operand 471 states and 666 transitions. Second operand has 14 states, 12 states have (on average 5.333333333333333) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:49:44,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:44,910 INFO L93 Difference]: Finished difference Result 1081 states and 1526 transitions. [2025-02-06 03:49:44,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 03:49:44,911 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.333333333333333) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 151 [2025-02-06 03:49:44,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:44,913 INFO L225 Difference]: With dead ends: 1081 [2025-02-06 03:49:44,913 INFO L226 Difference]: Without dead ends: 613 [2025-02-06 03:49:44,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:49:44,916 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 97 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:44,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1468 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 03:49:44,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-02-06 03:49:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 519. [2025-02-06 03:49:44,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 450 states have (on average 1.3777777777777778) internal successors, (620), 454 states have internal predecessors, (620), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:49:44,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 736 transitions. [2025-02-06 03:49:44,958 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 736 transitions. Word has length 151 [2025-02-06 03:49:44,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:44,959 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 736 transitions. [2025-02-06 03:49:44,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.333333333333333) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:49:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 736 transitions. [2025-02-06 03:49:44,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:49:44,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:44,961 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:44,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:49:44,961 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:44,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:44,965 INFO L85 PathProgramCache]: Analyzing trace with hash -971666462, now seen corresponding path program 1 times [2025-02-06 03:49:44,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:44,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069018216] [2025-02-06 03:49:44,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:44,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:44,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:49:45,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:49:45,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:45,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:49:46,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:46,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069018216] [2025-02-06 03:49:46,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069018216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:46,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:46,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:49:46,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957875612] [2025-02-06 03:49:46,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:46,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:49:46,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:46,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:49:46,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:49:46,016 INFO L87 Difference]: Start difference. First operand 519 states and 736 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:49:46,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:46,821 INFO L93 Difference]: Finished difference Result 1115 states and 1578 transitions. [2025-02-06 03:49:46,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:49:46,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2025-02-06 03:49:46,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:46,825 INFO L225 Difference]: With dead ends: 1115 [2025-02-06 03:49:46,826 INFO L226 Difference]: Without dead ends: 599 [2025-02-06 03:49:46,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:49:46,828 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 91 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:46,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 924 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:49:46,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-02-06 03:49:46,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 511. [2025-02-06 03:49:46,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 442 states have (on average 1.3755656108597285) internal successors, (608), 446 states have internal predecessors, (608), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:49:46,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 724 transitions. [2025-02-06 03:49:46,866 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 724 transitions. Word has length 151 [2025-02-06 03:49:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:46,868 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 724 transitions. [2025-02-06 03:49:46,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:49:46,869 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 724 transitions. [2025-02-06 03:49:46,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:49:46,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:46,871 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:46,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:49:46,871 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:46,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:46,872 INFO L85 PathProgramCache]: Analyzing trace with hash 283350562, now seen corresponding path program 1 times [2025-02-06 03:49:46,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:46,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127557810] [2025-02-06 03:49:46,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:46,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:46,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:49:46,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:49:46,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:46,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:49:48,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:48,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127557810] [2025-02-06 03:49:48,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127557810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:48,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:48,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:49:48,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596202995] [2025-02-06 03:49:48,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:48,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:49:48,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:48,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:49:48,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:49:48,234 INFO L87 Difference]: Start difference. First operand 511 states and 724 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:49:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:49,657 INFO L93 Difference]: Finished difference Result 1031 states and 1454 transitions. [2025-02-06 03:49:49,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:49:49,658 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2025-02-06 03:49:49,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:49,661 INFO L225 Difference]: With dead ends: 1031 [2025-02-06 03:49:49,663 INFO L226 Difference]: Without dead ends: 523 [2025-02-06 03:49:49,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:49:49,665 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 94 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:49,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 807 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 03:49:49,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-02-06 03:49:49,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 435. [2025-02-06 03:49:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 370 states have (on average 1.3621621621621622) internal successors, (504), 372 states have internal predecessors, (504), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-06 03:49:49,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 612 transitions. [2025-02-06 03:49:49,691 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 612 transitions. Word has length 151 [2025-02-06 03:49:49,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:49,691 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 612 transitions. [2025-02-06 03:49:49,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:49:49,692 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 612 transitions. [2025-02-06 03:49:49,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:49:49,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:49,693 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:49,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:49:49,693 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:49,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:49,694 INFO L85 PathProgramCache]: Analyzing trace with hash -10052445, now seen corresponding path program 1 times [2025-02-06 03:49:49,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:49,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455296508] [2025-02-06 03:49:49,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:49,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:49,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:49:49,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:49:49,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:49,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:49:51,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:51,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455296508] [2025-02-06 03:49:51,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455296508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:51,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:51,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 03:49:51,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257002099] [2025-02-06 03:49:51,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:51,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 03:49:51,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:51,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 03:49:51,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:49:51,617 INFO L87 Difference]: Start difference. First operand 435 states and 612 transitions. Second operand has 17 states, 14 states have (on average 4.571428571428571) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:49:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:53,404 INFO L93 Difference]: Finished difference Result 977 states and 1364 transitions. [2025-02-06 03:49:53,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 03:49:53,405 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 4.571428571428571) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 151 [2025-02-06 03:49:53,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:53,408 INFO L225 Difference]: With dead ends: 977 [2025-02-06 03:49:53,408 INFO L226 Difference]: Without dead ends: 545 [2025-02-06 03:49:53,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:49:53,410 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 96 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 2126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:53,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 2023 Invalid, 2126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2116 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-06 03:49:53,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-06 03:49:53,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 529. [2025-02-06 03:49:53,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 452 states have (on average 1.3584070796460177) internal successors, (614), 456 states have internal predecessors, (614), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:49:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 738 transitions. [2025-02-06 03:49:53,445 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 738 transitions. Word has length 151 [2025-02-06 03:49:53,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:53,445 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 738 transitions. [2025-02-06 03:49:53,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 4.571428571428571) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:49:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 738 transitions. [2025-02-06 03:49:53,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:49:53,448 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:53,448 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:53,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:49:53,448 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:53,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:53,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2101624007, now seen corresponding path program 1 times [2025-02-06 03:49:53,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:53,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235043682] [2025-02-06 03:49:53,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:53,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:53,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:49:53,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:49:53,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:53,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:49:53,520 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:49:53,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:49:53,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:49:53,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:53,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:49:53,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:49:53,599 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:49:53,600 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:49:53,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:49:53,603 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:53,658 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:49:53,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:49:53 BoogieIcfgContainer [2025-02-06 03:49:53,667 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:49:53,667 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:49:53,667 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:49:53,667 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:49:53,668 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:49:31" (3/4) ... [2025-02-06 03:49:53,669 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:49:53,670 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:49:53,671 INFO L158 Benchmark]: Toolchain (without parser) took 23575.71ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 109.1MB in the beginning and 716.4MB in the end (delta: -607.4MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2025-02-06 03:49:53,671 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:49:53,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.70ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 90.6MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:49:53,671 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.66ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 86.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:49:53,671 INFO L158 Benchmark]: Boogie Preprocessor took 60.53ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 82.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:49:53,671 INFO L158 Benchmark]: IcfgBuilder took 651.90ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 47.6MB in the end (delta: 35.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 03:49:53,671 INFO L158 Benchmark]: TraceAbstraction took 22573.84ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 47.6MB in the beginning and 716.7MB in the end (delta: -669.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:49:53,671 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 788.5MB. Free memory was 716.7MB in the beginning and 716.4MB in the end (delta: 253.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:49:53,672 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.70ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 90.6MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.66ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 86.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.53ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 82.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 651.90ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 47.6MB in the end (delta: 35.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 22573.84ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 47.6MB in the beginning and 716.7MB in the end (delta: -669.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 788.5MB. Free memory was 716.7MB in the beginning and 716.4MB in the end (delta: 253.9kB). 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 58, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 111. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 256, 0, 10, 500, 0, 1509114200, 10, 128.9, 63.363, 4.575, 25.5, 1, 0, 1 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] FCALL updateLastVariables() [L130] CALL updateVariables() [L90] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L94] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L97] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ulong() [L100] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ulong() [L103] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ulong() [L106] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L111] EXPR WrapperStruct00.var_1_10 [L111] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_10 [L111] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L111] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L116] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L130] RET updateVariables() [L131] CALL step() [L58] EXPR WrapperStruct00.var_1_9 [L58] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L58] COND FALSE !(WrapperStruct00.var_1_9 != WrapperStruct00.var_1_10) [L65] EXPR WrapperStruct00.var_1_14 [L65] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_14 [L67] EXPR WrapperStruct00.var_1_3 [L67] unsigned short int stepLocal_0 = WrapperStruct00.var_1_3; [L68] WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=65538] [L68] COND TRUE WrapperStruct00.var_1_12 [L69] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=65538] [L69] COND FALSE !(stepLocal_0 <= WrapperStruct00.var_1_4) [L75] EXPR WrapperStruct00.var_1_1 [L75] unsigned long int stepLocal_1 = WrapperStruct00.var_1_1; [L76] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=256] [L76] COND TRUE WrapperStruct00.var_1_7 >= stepLocal_1 [L77] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L77] EXPR ((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9) [L77] EXPR WrapperStruct00.var_1_9 [L77] EXPR ((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1] [L77] WrapperStruct00.var_1_8 = ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))) [L81] EXPR WrapperStruct00.var_1_10 [L81] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L81] EXPR ((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1] [L81] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L81] EXPR ((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8) [L81] EXPR WrapperStruct00.var_1_8 [L81] EXPR ((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1] [L81] COND TRUE WrapperStruct00.var_1_10 >= ((((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8))) [L82] EXPR WrapperStruct00.var_1_10 [L82] WrapperStruct00.var_1_11 = WrapperStruct00.var_1_10 [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7)) [L122] EXPR WrapperStruct00.var_1_3 [L122] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))) [L122] EXPR WrapperStruct00.var_1_7 [L122] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) [L122] EXPR WrapperStruct00.var_1_8 [L122] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))) && ((WrapperStruct00.var_1_10 >= ((((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_10)) : ((! (WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_9)) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (((WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))) && ((WrapperStruct00.var_1_10 >= ((((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_10)) : ((! (WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_9)) : 1))) && ((WrapperStruct00.var_1_9 != WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1] [L122-L123] return (((WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))) && ((WrapperStruct00.var_1_10 >= ((((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_10)) : ((! (WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_9)) : 1))) && ((WrapperStruct00.var_1_9 != WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14))) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.5s, OverallIterations: 12, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1612 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1566 mSDsluCounter, 9322 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7427 mSDsCounter, 336 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8456 IncrementalHoareTripleChecker+Invalid, 8792 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 336 mSolverCounterUnsat, 1895 mSDtfsCounter, 8456 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 796 GetRequests, 677 SyntacticMatches, 5 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=529occurred in iteration=11, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 330 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 2217 NumberOfCodeBlocks, 2217 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2199 ConstructedInterpolants, 0 QuantifiedInterpolants, 10983 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1544 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 9086/9180 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 03:49:53,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 7e44eca549ad63e100ff6b29db4a1cf439ea9f40f98c1b07aaed555a9a1c91f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:49:55,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:49:55,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:49:55,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:49:55,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:49:55,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:49:55,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:49:55,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:49:55,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:49:55,734 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:49:55,734 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:49:55,734 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:49:55,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:49:55,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:49:55,735 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:49:55,735 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:49:55,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:49:55,735 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:49:55,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:49:55,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:49:55,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:49:55,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:49:55,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:49:55,735 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:49:55,735 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:49:55,735 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:49:55,736 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:49:55,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:49:55,736 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:49:55,736 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:49:55,736 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:49:55,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:49:55,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:49:55,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:49:55,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:49:55,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:49:55,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:49:55,736 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:49:55,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:49:55,736 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:49:55,736 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:49:55,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:49:55,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:49:55,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:49:55,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:49:55,737 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 7e44eca549ad63e100ff6b29db4a1cf439ea9f40f98c1b07aaed555a9a1c91f0 [2025-02-06 03:49:55,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:49:55,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:49:55,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:49:55,981 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:49:55,981 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:49:55,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i [2025-02-06 03:49:57,191 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fab5a3873/1d1d023b06df4650be4a22343cfb8bb9/FLAG164045050 [2025-02-06 03:49:57,365 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:49:57,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i [2025-02-06 03:49:57,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fab5a3873/1d1d023b06df4650be4a22343cfb8bb9/FLAG164045050 [2025-02-06 03:49:57,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fab5a3873/1d1d023b06df4650be4a22343cfb8bb9 [2025-02-06 03:49:57,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:49:57,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:49:57,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:49:57,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:49:57,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:49:57,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:49:57" (1/1) ... [2025-02-06 03:49:57,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7684a2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:57, skipping insertion in model container [2025-02-06 03:49:57,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:49:57" (1/1) ... [2025-02-06 03:49:57,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:49:57,519 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i[916,929] [2025-02-06 03:49:57,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:49:57,592 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:49:57,602 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i[916,929] [2025-02-06 03:49:57,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:49:57,680 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:49:57,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:57 WrapperNode [2025-02-06 03:49:57,681 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:49:57,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:49:57,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:49:57,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:49:57,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:57" (1/1) ... [2025-02-06 03:49:57,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:57" (1/1) ... [2025-02-06 03:49:57,735 INFO L138 Inliner]: procedures = 37, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 550 [2025-02-06 03:49:57,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:49:57,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:49:57,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:49:57,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:49:57,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:57" (1/1) ... [2025-02-06 03:49:57,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:57" (1/1) ... [2025-02-06 03:49:57,752 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:57" (1/1) ... [2025-02-06 03:49:57,773 INFO L175 MemorySlicer]: Split 147 memory accesses to 2 slices as follows [2, 145]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2025-02-06 03:49:57,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:57" (1/1) ... [2025-02-06 03:49:57,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:57" (1/1) ... [2025-02-06 03:49:57,790 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:57" (1/1) ... [2025-02-06 03:49:57,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:57" (1/1) ... [2025-02-06 03:49:57,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:57" (1/1) ... [2025-02-06 03:49:57,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:57" (1/1) ... [2025-02-06 03:49:57,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:49:57,801 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:49:57,801 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:49:57,801 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:49:57,802 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:57" (1/1) ... [2025-02-06 03:49:57,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:49:57,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:49:57,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:49:57,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:49:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:49:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:49:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:49:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:49:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:49:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:49:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:49:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:49:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:49:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:49:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:49:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-02-06 03:49:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-02-06 03:49:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:49:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:49:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-02-06 03:49:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-02-06 03:49:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 03:49:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 03:49:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:49:57,858 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:49:57,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-02-06 03:49:57,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-02-06 03:49:57,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:49:57,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:49:57,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:49:57,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:49:57,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:49:57,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:49:57,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:49:57,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:49:57,995 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:49:57,996 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:49:58,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L122: havoc property_#t~mem91#1;havoc property_#t~ite107#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem103#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite120#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem119#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short121#1;havoc property_#t~mem131#1;havoc property_#t~mem122#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem125#1;havoc property_#t~ite130#1;havoc property_#t~mem126#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite139#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite138#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short140#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite155#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~short145#1;havoc property_#t~ite152#1;havoc property_#t~mem149#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~short148#1;havoc property_#t~mem151#1;havoc property_#t~mem150#1;havoc property_#t~mem154#1;havoc property_#t~mem153#1;havoc property_#t~short156#1; [2025-02-06 03:49:58,629 INFO L? ?]: Removed 150 outVars from TransFormulas that were not future-live. [2025-02-06 03:49:58,629 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:49:58,643 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:49:58,644 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:49:58,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:49:58 BoogieIcfgContainer [2025-02-06 03:49:58,644 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:49:58,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:49:58,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:49:58,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:49:58,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:49:57" (1/3) ... [2025-02-06 03:49:58,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195f47dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:49:58, skipping insertion in model container [2025-02-06 03:49:58,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:57" (2/3) ... [2025-02-06 03:49:58,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195f47dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:49:58, skipping insertion in model container [2025-02-06 03:49:58,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:49:58" (3/3) ... [2025-02-06 03:49:58,656 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-25.i [2025-02-06 03:49:58,666 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:49:58,667 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-25.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:49:58,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:49:58,712 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@247b7af9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:49:58,712 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:49:58,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:49:58,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:49:58,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:58,726 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:58,726 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:58,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:58,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1169756219, now seen corresponding path program 1 times [2025-02-06 03:49:58,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:49:58,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451061972] [2025-02-06 03:49:58,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:58,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:49:58,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:49:58,750 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:49:58,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 03:49:58,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:49:59,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:49:59,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:59,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:59,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:49:59,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:49:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-02-06 03:49:59,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:49:59,096 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:49:59,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451061972] [2025-02-06 03:49:59,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451061972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:59,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:59,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:49:59,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438654357] [2025-02-06 03:49:59,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:59,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:49:59,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:49:59,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:49:59,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:49:59,114 INFO L87 Difference]: Start difference. First operand has 123 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:49:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:59,145 INFO L93 Difference]: Finished difference Result 240 states and 375 transitions. [2025-02-06 03:49:59,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:49:59,147 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2025-02-06 03:49:59,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:59,151 INFO L225 Difference]: With dead ends: 240 [2025-02-06 03:49:59,151 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 03:49:59,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:49:59,155 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:59,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:49:59,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 03:49:59,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-02-06 03:49:59,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:49:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-02-06 03:49:59,187 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 144 [2025-02-06 03:49:59,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:59,187 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-02-06 03:49:59,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:49:59,188 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-02-06 03:49:59,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:49:59,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:59,190 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:59,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:49:59,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:49:59,390 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:59,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:59,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1912105995, now seen corresponding path program 1 times [2025-02-06 03:49:59,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:49:59,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182566330] [2025-02-06 03:49:59,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:59,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:49:59,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:49:59,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:49:59,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 03:49:59,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:49:59,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:49:59,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:59,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:59,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 03:49:59,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:49:59,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2025-02-06 03:49:59,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:59,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 20 [2025-02-06 03:50:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:50:00,003 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:50:00,003 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:50:00,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182566330] [2025-02-06 03:50:00,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182566330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:00,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:00,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:50:00,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178770041] [2025-02-06 03:50:00,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:00,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:50:00,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:50:00,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:50:00,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:50:00,006 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 12 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:50:02,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:02,096 INFO L93 Difference]: Finished difference Result 356 states and 516 transitions. [2025-02-06 03:50:02,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 03:50:02,096 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2025-02-06 03:50:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:02,098 INFO L225 Difference]: With dead ends: 356 [2025-02-06 03:50:02,098 INFO L226 Difference]: Without dead ends: 239 [2025-02-06 03:50:02,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:50:02,100 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 266 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:02,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 462 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 03:50:02,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-02-06 03:50:02,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 130. [2025-02-06 03:50:02,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 108 states have internal predecessors, (148), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:50:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 184 transitions. [2025-02-06 03:50:02,129 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 184 transitions. Word has length 144 [2025-02-06 03:50:02,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:02,130 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 184 transitions. [2025-02-06 03:50:02,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:50:02,130 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 184 transitions. [2025-02-06 03:50:02,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:50:02,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:02,131 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:02,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:50:02,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:02,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:02,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:02,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1336986517, now seen corresponding path program 1 times [2025-02-06 03:50:02,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:50:02,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584309233] [2025-02-06 03:50:02,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:02,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:02,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:50:02,341 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:50:02,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 03:50:02,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:50:02,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:50:02,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:02,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:02,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 03:50:02,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:02,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2025-02-06 03:50:02,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:02,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 34 [2025-02-06 03:50:03,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:03,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 34 [2025-02-06 03:50:03,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:03,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 20 [2025-02-06 03:50:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:50:03,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:50:03,050 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:50:03,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584309233] [2025-02-06 03:50:03,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584309233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:03,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:03,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:50:03,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072830944] [2025-02-06 03:50:03,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:03,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:50:03,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:50:03,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:50:03,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:50:03,053 INFO L87 Difference]: Start difference. First operand 130 states and 184 transitions. Second operand has 12 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:50:05,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:05,009 INFO L93 Difference]: Finished difference Result 366 states and 523 transitions. [2025-02-06 03:50:05,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 03:50:05,010 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-02-06 03:50:05,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:05,012 INFO L225 Difference]: With dead ends: 366 [2025-02-06 03:50:05,012 INFO L226 Difference]: Without dead ends: 239 [2025-02-06 03:50:05,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:50:05,013 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 462 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:05,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 456 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 03:50:05,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-02-06 03:50:05,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 149. [2025-02-06 03:50:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 127 states have (on average 1.3937007874015748) internal successors, (177), 127 states have internal predecessors, (177), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:50:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 213 transitions. [2025-02-06 03:50:05,033 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 213 transitions. Word has length 145 [2025-02-06 03:50:05,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:05,033 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 213 transitions. [2025-02-06 03:50:05,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:50:05,033 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 213 transitions. [2025-02-06 03:50:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:50:05,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:05,035 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:05,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:50:05,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:05,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:05,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:05,239 INFO L85 PathProgramCache]: Analyzing trace with hash 2026408047, now seen corresponding path program 1 times [2025-02-06 03:50:05,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:50:05,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111825790] [2025-02-06 03:50:05,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:05,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:05,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:50:05,243 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:50:05,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 03:50:05,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:50:05,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:50:05,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:05,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:05,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:50:05,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:05,546 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:50:05,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:50:05,546 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:50:05,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111825790] [2025-02-06 03:50:05,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111825790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:05,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:05,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:50:05,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904858190] [2025-02-06 03:50:05,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:05,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:50:05,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:50:05,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:50:05,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:50:05,548 INFO L87 Difference]: Start difference. First operand 149 states and 213 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:50:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:05,577 INFO L93 Difference]: Finished difference Result 298 states and 427 transitions. [2025-02-06 03:50:05,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:50:05,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-02-06 03:50:05,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:05,579 INFO L225 Difference]: With dead ends: 298 [2025-02-06 03:50:05,579 INFO L226 Difference]: Without dead ends: 152 [2025-02-06 03:50:05,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:50:05,580 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:05,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 677 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:50:05,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-06 03:50:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-02-06 03:50:05,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:50:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 216 transitions. [2025-02-06 03:50:05,600 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 216 transitions. Word has length 147 [2025-02-06 03:50:05,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:05,602 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 216 transitions. [2025-02-06 03:50:05,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:50:05,602 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2025-02-06 03:50:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:50:05,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:05,603 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:05,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 03:50:05,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:05,804 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:05,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:05,804 INFO L85 PathProgramCache]: Analyzing trace with hash -141476231, now seen corresponding path program 1 times [2025-02-06 03:50:05,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:50:05,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294408718] [2025-02-06 03:50:05,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:05,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:05,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:50:05,807 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:50:05,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 03:50:05,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:50:06,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:50:06,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:06,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:06,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:50:06,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:50:06,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:50:06,082 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:50:06,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294408718] [2025-02-06 03:50:06,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294408718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:06,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:06,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:50:06,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186908012] [2025-02-06 03:50:06,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:06,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:50:06,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:50:06,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:50:06,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:50:06,083 INFO L87 Difference]: Start difference. First operand 152 states and 216 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:50:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:06,484 INFO L93 Difference]: Finished difference Result 304 states and 434 transitions. [2025-02-06 03:50:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:50:06,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2025-02-06 03:50:06,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:06,487 INFO L225 Difference]: With dead ends: 304 [2025-02-06 03:50:06,487 INFO L226 Difference]: Without dead ends: 155 [2025-02-06 03:50:06,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:50:06,488 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 1 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:06,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 429 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:50:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-06 03:50:06,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2025-02-06 03:50:06,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 states have internal predecessors, (183), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:50:06,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 219 transitions. [2025-02-06 03:50:06,496 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 219 transitions. Word has length 148 [2025-02-06 03:50:06,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:06,497 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 219 transitions. [2025-02-06 03:50:06,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:50:06,497 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 219 transitions. [2025-02-06 03:50:06,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:50:06,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:06,498 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:06,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-02-06 03:50:06,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:06,699 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:06,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:06,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2076281722, now seen corresponding path program 1 times [2025-02-06 03:50:06,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:50:06,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555360606] [2025-02-06 03:50:06,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:06,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:06,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:50:06,702 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:50:06,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 03:50:06,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:50:06,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:50:06,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:06,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:06,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:50:06,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:06,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-02-06 03:50:06,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:06,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 14 [2025-02-06 03:50:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:50:07,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:50:07,001 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:50:07,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555360606] [2025-02-06 03:50:07,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1555360606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:07,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:07,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:50:07,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044353806] [2025-02-06 03:50:07,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:07,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:50:07,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:50:07,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:50:07,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:50:07,003 INFO L87 Difference]: Start difference. First operand 154 states and 219 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:50:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:08,253 INFO L93 Difference]: Finished difference Result 412 states and 590 transitions. [2025-02-06 03:50:08,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:50:08,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2025-02-06 03:50:08,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:08,255 INFO L225 Difference]: With dead ends: 412 [2025-02-06 03:50:08,255 INFO L226 Difference]: Without dead ends: 261 [2025-02-06 03:50:08,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:50:08,256 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 136 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:08,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 857 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 03:50:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-02-06 03:50:08,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2025-02-06 03:50:08,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 221 states have (on average 1.3891402714932126) internal successors, (307), 222 states have internal predecessors, (307), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 03:50:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 371 transitions. [2025-02-06 03:50:08,269 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 371 transitions. Word has length 148 [2025-02-06 03:50:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:08,269 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 371 transitions. [2025-02-06 03:50:08,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:50:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 371 transitions. [2025-02-06 03:50:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:50:08,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:08,271 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:08,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-06 03:50:08,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:08,472 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:08,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:08,472 INFO L85 PathProgramCache]: Analyzing trace with hash 820137786, now seen corresponding path program 1 times [2025-02-06 03:50:08,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:50:08,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658911146] [2025-02-06 03:50:08,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:08,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:08,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:50:08,477 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:50:08,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-02-06 03:50:08,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:50:08,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:50:08,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:08,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:08,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 03:50:08,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:08,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2025-02-06 03:50:08,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:08,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 19 [2025-02-06 03:50:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:50:08,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:50:08,936 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:50:08,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658911146] [2025-02-06 03:50:08,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658911146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:08,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:08,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:50:08,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500511521] [2025-02-06 03:50:08,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:08,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:50:08,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:50:08,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:50:08,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:50:08,937 INFO L87 Difference]: Start difference. First operand 258 states and 371 transitions. Second operand has 13 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:50:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:10,555 INFO L93 Difference]: Finished difference Result 517 states and 743 transitions. [2025-02-06 03:50:10,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 03:50:10,555 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 148 [2025-02-06 03:50:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:10,558 INFO L225 Difference]: With dead ends: 517 [2025-02-06 03:50:10,558 INFO L226 Difference]: Without dead ends: 262 [2025-02-06 03:50:10,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:50:10,559 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 240 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:10,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 462 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 03:50:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-06 03:50:10,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 258. [2025-02-06 03:50:10,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 221 states have (on average 1.3846153846153846) internal successors, (306), 222 states have internal predecessors, (306), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 03:50:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 370 transitions. [2025-02-06 03:50:10,575 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 370 transitions. Word has length 148 [2025-02-06 03:50:10,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:10,575 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 370 transitions. [2025-02-06 03:50:10,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:50:10,576 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 370 transitions. [2025-02-06 03:50:10,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 03:50:10,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:10,577 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:10,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-02-06 03:50:10,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:10,781 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:10,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash 422954160, now seen corresponding path program 1 times [2025-02-06 03:50:10,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:50:10,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268187750] [2025-02-06 03:50:10,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:10,782 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:10,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:50:10,784 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:50:10,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-06 03:50:10,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:50:11,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:50:11,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:11,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:11,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 03:50:11,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:11,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:50:11,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-06 03:50:11,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2025-02-06 03:50:11,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:11,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-02-06 03:50:11,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:11,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-02-06 03:50:11,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:11,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 19 [2025-02-06 03:50:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 167 proven. 6 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2025-02-06 03:50:11,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:50:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:50:11,612 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:50:11,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268187750] [2025-02-06 03:50:11,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268187750] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:50:11,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:50:11,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2025-02-06 03:50:11,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126881920] [2025-02-06 03:50:11,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:11,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:50:11,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:50:11,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:50:11,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:50:11,614 INFO L87 Difference]: Start difference. First operand 258 states and 370 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:50:12,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:12,484 INFO L93 Difference]: Finished difference Result 646 states and 924 transitions. [2025-02-06 03:50:12,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:50:12,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-02-06 03:50:12,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:12,487 INFO L225 Difference]: With dead ends: 646 [2025-02-06 03:50:12,487 INFO L226 Difference]: Without dead ends: 391 [2025-02-06 03:50:12,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:50:12,488 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 188 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:12,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 698 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:50:12,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-02-06 03:50:12,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 259. [2025-02-06 03:50:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 222 states have (on average 1.3783783783783783) internal successors, (306), 223 states have internal predecessors, (306), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 03:50:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 370 transitions. [2025-02-06 03:50:12,507 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 370 transitions. Word has length 149 [2025-02-06 03:50:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:12,507 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 370 transitions. [2025-02-06 03:50:12,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:50:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 370 transitions. [2025-02-06 03:50:12,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 03:50:12,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:12,508 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:12,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-06 03:50:12,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:12,709 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:12,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:12,710 INFO L85 PathProgramCache]: Analyzing trace with hash 137197808, now seen corresponding path program 1 times [2025-02-06 03:50:12,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:50:12,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693685182] [2025-02-06 03:50:12,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:12,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:12,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:50:12,712 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:50:12,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-02-06 03:50:12,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:50:13,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:50:13,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:13,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:13,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 03:50:13,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:13,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2025-02-06 03:50:13,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:13,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-02-06 03:50:13,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:13,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-02-06 03:50:13,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:13,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 19 [2025-02-06 03:50:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:50:13,345 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:50:13,345 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:50:13,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693685182] [2025-02-06 03:50:13,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693685182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:13,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:13,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:50:13,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204914682] [2025-02-06 03:50:13,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:13,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:50:13,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:50:13,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:50:13,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:50:13,346 INFO L87 Difference]: Start difference. First operand 259 states and 370 transitions. Second operand has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:50:14,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:14,727 INFO L93 Difference]: Finished difference Result 519 states and 741 transitions. [2025-02-06 03:50:14,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 03:50:14,727 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 149 [2025-02-06 03:50:14,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:14,729 INFO L225 Difference]: With dead ends: 519 [2025-02-06 03:50:14,729 INFO L226 Difference]: Without dead ends: 263 [2025-02-06 03:50:14,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:50:14,730 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 224 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:14,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 461 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 03:50:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-06 03:50:14,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 237. [2025-02-06 03:50:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 200 states have (on average 1.365) internal successors, (273), 201 states have internal predecessors, (273), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 03:50:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 337 transitions. [2025-02-06 03:50:14,746 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 337 transitions. Word has length 149 [2025-02-06 03:50:14,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:14,746 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 337 transitions. [2025-02-06 03:50:14,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:50:14,746 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 337 transitions. [2025-02-06 03:50:14,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 03:50:14,747 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:14,747 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:14,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-02-06 03:50:14,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:14,948 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:14,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:14,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2050413775, now seen corresponding path program 1 times [2025-02-06 03:50:14,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:50:14,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076351595] [2025-02-06 03:50:14,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:14,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:14,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:50:14,950 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:50:14,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-02-06 03:50:15,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:50:15,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:50:15,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:15,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:15,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 03:50:15,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:15,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:50:15,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2025-02-06 03:50:15,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2025-02-06 03:50:15,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2025-02-06 03:50:16,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:16,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 47 [2025-02-06 03:50:16,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:16,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 38 [2025-02-06 03:50:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-02-06 03:50:16,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:50:16,114 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:50:16,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076351595] [2025-02-06 03:50:16,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076351595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:16,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:16,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:50:16,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091593567] [2025-02-06 03:50:16,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:16,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:50:16,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:50:16,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:50:16,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:50:16,115 INFO L87 Difference]: Start difference. First operand 237 states and 337 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:50:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:18,664 INFO L93 Difference]: Finished difference Result 707 states and 1001 transitions. [2025-02-06 03:50:18,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:50:18,665 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 149 [2025-02-06 03:50:18,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:18,667 INFO L225 Difference]: With dead ends: 707 [2025-02-06 03:50:18,667 INFO L226 Difference]: Without dead ends: 473 [2025-02-06 03:50:18,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:50:18,668 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 254 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:18,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 437 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1007 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2025-02-06 03:50:18,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-02-06 03:50:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 469. [2025-02-06 03:50:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 394 states have (on average 1.3553299492385786) internal successors, (534), 398 states have internal predecessors, (534), 64 states have call successors, (64), 10 states have call predecessors, (64), 10 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 03:50:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 662 transitions. [2025-02-06 03:50:18,703 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 662 transitions. Word has length 149 [2025-02-06 03:50:18,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:18,704 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 662 transitions. [2025-02-06 03:50:18,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:50:18,706 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 662 transitions. [2025-02-06 03:50:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 03:50:18,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:18,708 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:18,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-02-06 03:50:18,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:18,908 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:18,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:18,909 INFO L85 PathProgramCache]: Analyzing trace with hash -805649294, now seen corresponding path program 1 times [2025-02-06 03:50:18,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:50:18,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884860024] [2025-02-06 03:50:18,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:18,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:18,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:50:18,911 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:50:18,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-02-06 03:50:18,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:50:19,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:50:19,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:19,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:19,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 03:50:19,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:19,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:50:19,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2025-02-06 03:50:19,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2025-02-06 03:50:19,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:19,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 57 [2025-02-06 03:50:20,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:20,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 60 [2025-02-06 03:50:20,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:20,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 60 [2025-02-06 03:50:20,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:20,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 42 [2025-02-06 03:50:20,242 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-06 03:50:20,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:50:20,242 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:50:20,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884860024] [2025-02-06 03:50:20,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884860024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:20,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:20,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:50:20,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701468359] [2025-02-06 03:50:20,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:20,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:50:20,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:50:20,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:50:20,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:50:20,243 INFO L87 Difference]: Start difference. First operand 469 states and 662 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:50:23,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:23,024 INFO L93 Difference]: Finished difference Result 943 states and 1327 transitions. [2025-02-06 03:50:23,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:50:23,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 149 [2025-02-06 03:50:23,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:23,028 INFO L225 Difference]: With dead ends: 943 [2025-02-06 03:50:23,028 INFO L226 Difference]: Without dead ends: 477 [2025-02-06 03:50:23,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:50:23,029 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 332 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:23,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 455 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-06 03:50:23,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-02-06 03:50:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 461. [2025-02-06 03:50:23,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 388 states have (on average 1.347938144329897) internal successors, (523), 391 states have internal predecessors, (523), 62 states have call successors, (62), 10 states have call predecessors, (62), 10 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:50:23,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 647 transitions. [2025-02-06 03:50:23,064 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 647 transitions. Word has length 149 [2025-02-06 03:50:23,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:23,065 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 647 transitions. [2025-02-06 03:50:23,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:50:23,065 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 647 transitions. [2025-02-06 03:50:23,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 03:50:23,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:23,067 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:23,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-02-06 03:50:23,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:23,268 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:23,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:23,268 INFO L85 PathProgramCache]: Analyzing trace with hash -396825069, now seen corresponding path program 1 times [2025-02-06 03:50:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:50:23,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043035127] [2025-02-06 03:50:23,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:23,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:23,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:50:23,270 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:50:23,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-02-06 03:50:23,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:50:23,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:50:23,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:23,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:23,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 03:50:23,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:23,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:50:23,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 03:50:23,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-02-06 03:50:23,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-02-06 03:50:23,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-02-06 03:50:23,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-02-06 03:50:23,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-02-06 03:50:23,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-02-06 03:50:23,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:23,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-02-06 03:50:23,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:23,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-02-06 03:50:24,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:24,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 44 [2025-02-06 03:50:24,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:24,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 44 [2025-02-06 03:50:24,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:24,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 25 [2025-02-06 03:50:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-02-06 03:50:24,182 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:50:24,182 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:50:24,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043035127] [2025-02-06 03:50:24,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043035127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:24,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:24,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:50:24,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475677847] [2025-02-06 03:50:24,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:24,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:50:24,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:50:24,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:50:24,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:50:24,183 INFO L87 Difference]: Start difference. First operand 461 states and 647 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:50:25,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:25,922 INFO L93 Difference]: Finished difference Result 1161 states and 1628 transitions. [2025-02-06 03:50:25,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:50:25,924 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 149 [2025-02-06 03:50:25,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:25,926 INFO L225 Difference]: With dead ends: 1161 [2025-02-06 03:50:25,926 INFO L226 Difference]: Without dead ends: 703 [2025-02-06 03:50:25,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 140 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:50:25,929 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 208 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:25,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 362 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 03:50:25,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2025-02-06 03:50:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 697. [2025-02-06 03:50:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 612 states have (on average 1.3643790849673203) internal successors, (835), 619 states have internal predecessors, (835), 70 states have call successors, (70), 14 states have call predecessors, (70), 14 states have return successors, (70), 63 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 03:50:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 975 transitions. [2025-02-06 03:50:25,967 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 975 transitions. Word has length 149 [2025-02-06 03:50:25,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:25,967 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 975 transitions. [2025-02-06 03:50:25,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:50:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 975 transitions. [2025-02-06 03:50:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:50:25,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:25,969 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:25,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-02-06 03:50:26,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:26,169 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:26,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:26,170 INFO L85 PathProgramCache]: Analyzing trace with hash -547156971, now seen corresponding path program 1 times [2025-02-06 03:50:26,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:50:26,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39331282] [2025-02-06 03:50:26,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:26,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:26,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:50:26,172 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:50:26,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-02-06 03:50:26,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:50:26,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:50:26,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:26,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:26,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 03:50:26,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:26,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:50:26,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 03:50:26,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 03:50:26,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 03:50:26,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 03:50:26,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2025-02-06 03:50:26,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:26,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2025-02-06 03:50:26,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:26,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2025-02-06 03:50:26,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:26,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 30 [2025-02-06 03:50:26,913 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 423 proven. 30 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-02-06 03:50:26,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:50:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:50:27,469 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:50:27,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39331282] [2025-02-06 03:50:27,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39331282] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:50:27,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:50:27,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2025-02-06 03:50:27,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195912663] [2025-02-06 03:50:27,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:50:27,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 03:50:27,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:50:27,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 03:50:27,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:50:27,471 INFO L87 Difference]: Start difference. First operand 697 states and 975 transitions. Second operand has 18 states, 16 states have (on average 6.4375) internal successors, (103), 18 states have internal predecessors, (103), 7 states have call successors, (29), 4 states have call predecessors, (29), 6 states have return successors, (29), 5 states have call predecessors, (29), 7 states have call successors, (29) [2025-02-06 03:50:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:31,194 INFO L93 Difference]: Finished difference Result 1469 states and 2018 transitions. [2025-02-06 03:50:31,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 03:50:31,196 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.4375) internal successors, (103), 18 states have internal predecessors, (103), 7 states have call successors, (29), 4 states have call predecessors, (29), 6 states have return successors, (29), 5 states have call predecessors, (29), 7 states have call successors, (29) Word has length 151 [2025-02-06 03:50:31,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:31,198 INFO L225 Difference]: With dead ends: 1469 [2025-02-06 03:50:31,199 INFO L226 Difference]: Without dead ends: 775 [2025-02-06 03:50:31,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=223, Invalid=707, Unknown=0, NotChecked=0, Total=930 [2025-02-06 03:50:31,200 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 341 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:31,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 571 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-06 03:50:31,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-02-06 03:50:31,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 403. [2025-02-06 03:50:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 347 states have (on average 1.3342939481268012) internal successors, (463), 350 states have internal predecessors, (463), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:50:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 543 transitions. [2025-02-06 03:50:31,246 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 543 transitions. Word has length 151 [2025-02-06 03:50:31,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:31,246 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 543 transitions. [2025-02-06 03:50:31,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.4375) internal successors, (103), 18 states have internal predecessors, (103), 7 states have call successors, (29), 4 states have call predecessors, (29), 6 states have return successors, (29), 5 states have call predecessors, (29), 7 states have call successors, (29) [2025-02-06 03:50:31,246 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 543 transitions. [2025-02-06 03:50:31,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:50:31,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:31,247 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:31,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-02-06 03:50:31,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:31,448 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:31,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:31,448 INFO L85 PathProgramCache]: Analyzing trace with hash 414457046, now seen corresponding path program 1 times [2025-02-06 03:50:31,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:50:31,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144676395] [2025-02-06 03:50:31,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:31,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:31,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:50:31,451 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:50:31,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-02-06 03:50:31,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:50:31,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:50:31,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:31,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:31,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 03:50:31,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:31,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:50:31,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 03:50:31,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-02-06 03:50:31,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:31,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-02-06 03:50:31,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:31,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-02-06 03:50:31,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:31,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-02-06 03:50:32,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:32,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-02-06 03:50:32,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:32,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-02-06 03:50:32,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:32,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2025-02-06 03:50:32,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:32,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2025-02-06 03:50:32,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:32,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 58 [2025-02-06 03:50:32,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:32,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 58 [2025-02-06 03:50:32,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:32,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 58 [2025-02-06 03:50:32,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:32,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 33 [2025-02-06 03:50:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 427 proven. 30 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-02-06 03:50:32,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:50:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:50:32,691 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:50:32,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144676395] [2025-02-06 03:50:32,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1144676395] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:50:32,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:50:32,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2025-02-06 03:50:32,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198745490] [2025-02-06 03:50:32,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:32,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:50:32,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:50:32,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:50:32,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:50:32,692 INFO L87 Difference]: Start difference. First operand 403 states and 543 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:50:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:33,319 INFO L93 Difference]: Finished difference Result 815 states and 1092 transitions. [2025-02-06 03:50:33,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:50:33,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2025-02-06 03:50:33,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:33,323 INFO L225 Difference]: With dead ends: 815 [2025-02-06 03:50:33,323 INFO L226 Difference]: Without dead ends: 415 [2025-02-06 03:50:33,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:50:33,324 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 148 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:33,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 404 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:50:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-02-06 03:50:33,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 327. [2025-02-06 03:50:33,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 275 states have (on average 1.3054545454545454) internal successors, (359), 276 states have internal predecessors, (359), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:50:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 431 transitions. [2025-02-06 03:50:33,351 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 431 transitions. Word has length 151 [2025-02-06 03:50:33,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:33,352 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 431 transitions. [2025-02-06 03:50:33,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:50:33,352 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 431 transitions. [2025-02-06 03:50:33,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:50:33,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:33,354 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:50:33,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-02-06 03:50:33,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:33,555 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:33,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:33,555 INFO L85 PathProgramCache]: Analyzing trace with hash 121054039, now seen corresponding path program 1 times [2025-02-06 03:50:33,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:50:33,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122364016] [2025-02-06 03:50:33,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:33,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:50:33,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:50:33,557 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:50:33,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-02-06 03:50:33,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:50:34,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:50:34,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:34,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:34,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-02-06 03:50:34,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:34,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:50:34,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:50:34,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 03:50:34,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:34,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 28 [2025-02-06 03:50:34,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:34,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 40 [2025-02-06 03:50:34,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:34,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 40 [2025-02-06 03:50:34,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:34,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 40 [2025-02-06 03:50:34,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:34,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 40 [2025-02-06 03:50:34,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:34,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 40 [2025-02-06 03:50:35,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:35,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 63