./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.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-p_file-88.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 59352034a8e7fb7bc8ebfc4ca4573abd72388675e4ed8d10658bda7976c62170 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:45:58,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:45:58,157 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:45:58,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:45:58,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:45:58,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:45:58,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:45:58,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:45:58,187 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:45:58,187 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:45:58,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:45:58,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:45:58,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:45:58,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:45:58,188 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:45:58,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:45:58,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:45:58,188 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:45:58,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:45:58,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:45:58,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:45:58,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:45:58,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:45:58,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:45:58,189 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:45:58,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:45:58,189 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:45:58,189 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:45:58,189 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:45:58,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:45:58,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:45:58,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:45:58,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:45:58,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:45:58,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:45:58,190 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:45:58,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:45:58,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:45:58,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:45:58,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:45:58,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:45:58,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:45:58,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:45:58,191 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 -> 59352034a8e7fb7bc8ebfc4ca4573abd72388675e4ed8d10658bda7976c62170 [2025-02-06 03:45:58,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:45:58,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:45:58,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:45:58,433 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:45:58,434 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:45:58,434 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-p_file-88.i [2025-02-06 03:45:59,643 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e602afe5/a87aa27444b0452c9bc243e8a9010700/FLAG1175352ce [2025-02-06 03:45:59,920 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:45:59,921 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i [2025-02-06 03:45:59,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e602afe5/a87aa27444b0452c9bc243e8a9010700/FLAG1175352ce [2025-02-06 03:46:00,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e602afe5/a87aa27444b0452c9bc243e8a9010700 [2025-02-06 03:46:00,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:46:00,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:46:00,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:46:00,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:46:00,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:46:00,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:46:00" (1/1) ... [2025-02-06 03:46:00,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:00, skipping insertion in model container [2025-02-06 03:46:00,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:46:00" (1/1) ... [2025-02-06 03:46:00,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:46:00,333 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-p_file-88.i[916,929] [2025-02-06 03:46:00,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:46:00,394 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:46:00,402 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-p_file-88.i[916,929] [2025-02-06 03:46:00,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:46:00,451 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:46:00,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:00 WrapperNode [2025-02-06 03:46:00,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:46:00,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:46:00,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:46:00,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:46:00,456 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:46:00" (1/1) ... [2025-02-06 03:46:00,468 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:46:00" (1/1) ... [2025-02-06 03:46:00,494 INFO L138 Inliner]: procedures = 29, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 562 [2025-02-06 03:46:00,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:46:00,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:46:00,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:46:00,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:46:00,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:00" (1/1) ... [2025-02-06 03:46:00,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:00" (1/1) ... [2025-02-06 03:46:00,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:00" (1/1) ... [2025-02-06 03:46:00,517 INFO L175 MemorySlicer]: Split 134 memory accesses to 17 slices as follows [2, 9, 10, 6, 16, 17, 12, 6, 8, 10, 10, 3, 4, 3, 8, 4, 6]. 13 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-02-06 03:46:00,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:00" (1/1) ... [2025-02-06 03:46:00,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:00" (1/1) ... [2025-02-06 03:46:00,528 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:00" (1/1) ... [2025-02-06 03:46:00,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:00" (1/1) ... [2025-02-06 03:46:00,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:00" (1/1) ... [2025-02-06 03:46:00,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:00" (1/1) ... [2025-02-06 03:46:00,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:46:00,536 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:46:00,536 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:46:00,536 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:46:00,537 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:00" (1/1) ... [2025-02-06 03:46:00,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:46:00,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:46:00,569 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:46:00,572 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:46:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:46:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:46:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:46:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:46:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:46:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:46:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:46:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-02-06 03:46:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-02-06 03:46:00,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#16 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:46:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#16 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:46:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#16 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:46:00,597 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 03:46:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 03:46:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-06 03:46:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-06 03:46:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:46:00,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:46:00,742 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:46:00,744 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:46:01,043 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~bitwise79#1;havoc property_#t~mem80#1;havoc property_#t~short81#1;havoc property_#t~ite92#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~short84#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem93#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;havoc property_#t~ite121#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~ite115#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite130#1;havoc property_#t~mem129#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~short131#1;havoc property_#t~mem132#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2025-02-06 03:46:01,079 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2025-02-06 03:46:01,079 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:46:01,091 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:46:01,091 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:46:01,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:46:01 BoogieIcfgContainer [2025-02-06 03:46:01,092 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:46:01,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:46:01,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:46:01,096 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:46:01,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:46:00" (1/3) ... [2025-02-06 03:46:01,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea55e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:46:01, skipping insertion in model container [2025-02-06 03:46:01,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:00" (2/3) ... [2025-02-06 03:46:01,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea55e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:46:01, skipping insertion in model container [2025-02-06 03:46:01,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:46:01" (3/3) ... [2025-02-06 03:46:01,098 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-88.i [2025-02-06 03:46:01,108 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:46:01,110 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-88.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:46:01,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:46:01,172 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;@3d5a7c91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:46:01,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:46:01,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 99 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:46:01,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:46:01,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:01,184 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:01,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:01,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:01,189 INFO L85 PathProgramCache]: Analyzing trace with hash -296604342, now seen corresponding path program 1 times [2025-02-06 03:46:01,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:01,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313887334] [2025-02-06 03:46:01,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:01,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:01,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:46:01,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:46:01,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:01,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:01,455 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 03:46:01,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:01,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313887334] [2025-02-06 03:46:01,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313887334] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:01,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920051098] [2025-02-06 03:46:01,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:01,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:46:01,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:46:01,461 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:46:01,462 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:46:01,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:46:01,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:46:01,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:01,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:01,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:46:01,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:01,749 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 03:46:01,749 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:01,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920051098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:01,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:46:01,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:46:01,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110373995] [2025-02-06 03:46:01,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:01,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:46:01,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:01,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:46:01,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:46:01,773 INFO L87 Difference]: Start difference. First operand has 118 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 99 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:46:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:01,793 INFO L93 Difference]: Finished difference Result 230 states and 358 transitions. [2025-02-06 03:46:01,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:46:01,795 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2025-02-06 03:46:01,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:01,799 INFO L225 Difference]: With dead ends: 230 [2025-02-06 03:46:01,799 INFO L226 Difference]: Without dead ends: 115 [2025-02-06 03:46:01,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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:46:01,802 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:01,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-06 03:46:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-02-06 03:46:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:46:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2025-02-06 03:46:01,841 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 143 [2025-02-06 03:46:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:01,842 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2025-02-06 03:46:01,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:46:01,843 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2025-02-06 03:46:01,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:46:01,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:01,847 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:01,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:46:02,048 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:46:02,048 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:02,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:02,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2017413761, now seen corresponding path program 1 times [2025-02-06 03:46:02,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:02,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301433329] [2025-02-06 03:46:02,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:02,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:02,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:46:02,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:46:02,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:02,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:02,384 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:02,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:02,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301433329] [2025-02-06 03:46:02,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301433329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:02,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:02,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:46:02,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314206407] [2025-02-06 03:46:02,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:02,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:46:02,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:02,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:46:02,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:46:02,386 INFO L87 Difference]: Start difference. First operand 115 states and 168 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:02,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:02,437 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2025-02-06 03:46:02,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:46:02,439 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-02-06 03:46:02,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:02,441 INFO L225 Difference]: With dead ends: 230 [2025-02-06 03:46:02,441 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 03:46:02,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:46:02,442 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:02,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 478 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 03:46:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-02-06 03:46:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:46:02,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2025-02-06 03:46:02,457 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 143 [2025-02-06 03:46:02,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:02,459 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2025-02-06 03:46:02,459 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2025-02-06 03:46:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:46:02,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:02,464 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:02,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:46:02,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:02,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:02,464 INFO L85 PathProgramCache]: Analyzing trace with hash 470099072, now seen corresponding path program 1 times [2025-02-06 03:46:02,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:02,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685156778] [2025-02-06 03:46:02,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:02,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:02,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:46:02,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:46:02,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:02,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:02,622 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:02,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:02,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685156778] [2025-02-06 03:46:02,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685156778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:02,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:02,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:46:02,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045524103] [2025-02-06 03:46:02,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:02,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:46:02,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:02,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:46:02,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:46:02,624 INFO L87 Difference]: Start difference. First operand 117 states and 170 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:02,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:02,656 INFO L93 Difference]: Finished difference Result 234 states and 341 transitions. [2025-02-06 03:46:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:46:02,658 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-02-06 03:46:02,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:02,659 INFO L225 Difference]: With dead ends: 234 [2025-02-06 03:46:02,659 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 03:46:02,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:46:02,660 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:02,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 479 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:02,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 03:46:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-02-06 03:46:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:46:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2025-02-06 03:46:02,668 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 143 [2025-02-06 03:46:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:02,669 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2025-02-06 03:46:02,669 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2025-02-06 03:46:02,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:46:02,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:02,670 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:02,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:46:02,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:02,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:02,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1357602753, now seen corresponding path program 1 times [2025-02-06 03:46:02,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:02,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122700749] [2025-02-06 03:46:02,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:02,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:02,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:46:02,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:46:02,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:02,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:02,815 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:02,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:02,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122700749] [2025-02-06 03:46:02,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122700749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:02,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:02,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:46:02,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847966180] [2025-02-06 03:46:02,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:02,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:46:02,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:02,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:46:02,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:46:02,818 INFO L87 Difference]: Start difference. First operand 119 states and 172 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:02,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:02,849 INFO L93 Difference]: Finished difference Result 238 states and 345 transitions. [2025-02-06 03:46:02,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:46:02,849 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-02-06 03:46:02,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:02,851 INFO L225 Difference]: With dead ends: 238 [2025-02-06 03:46:02,851 INFO L226 Difference]: Without dead ends: 122 [2025-02-06 03:46:02,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:46:02,853 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:02,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 481 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:02,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-06 03:46:02,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-02-06 03:46:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:46:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions. [2025-02-06 03:46:02,864 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 143 [2025-02-06 03:46:02,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:02,865 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions. [2025-02-06 03:46:02,865 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2025-02-06 03:46:02,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:46:02,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:02,867 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:02,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:46:02,867 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:02,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:02,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1358526274, now seen corresponding path program 1 times [2025-02-06 03:46:02,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:02,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557117735] [2025-02-06 03:46:02,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:02,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:02,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:46:02,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:46:02,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:02,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:03,230 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:03,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:03,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557117735] [2025-02-06 03:46:03,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557117735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:03,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:03,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:03,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539839101] [2025-02-06 03:46:03,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:03,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:03,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:03,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:03,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:03,232 INFO L87 Difference]: Start difference. First operand 121 states and 174 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:03,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:03,311 INFO L93 Difference]: Finished difference Result 255 states and 365 transitions. [2025-02-06 03:46:03,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:03,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-02-06 03:46:03,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:03,312 INFO L225 Difference]: With dead ends: 255 [2025-02-06 03:46:03,312 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 03:46:03,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:46:03,313 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 93 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:03,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 572 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:03,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 03:46:03,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2025-02-06 03:46:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 113 states have internal predecessors, (150), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:46:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 192 transitions. [2025-02-06 03:46:03,320 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 192 transitions. Word has length 143 [2025-02-06 03:46:03,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:03,320 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 192 transitions. [2025-02-06 03:46:03,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:03,320 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 192 transitions. [2025-02-06 03:46:03,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:46:03,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:03,321 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:03,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:46:03,321 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:03,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:03,321 INFO L85 PathProgramCache]: Analyzing trace with hash 15498748, now seen corresponding path program 1 times [2025-02-06 03:46:03,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:03,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477449475] [2025-02-06 03:46:03,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:03,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:03,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:46:03,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:46:03,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:03,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:03,506 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:46:03,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:03,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477449475] [2025-02-06 03:46:03,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477449475] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:03,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439759183] [2025-02-06 03:46:03,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:03,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:46:03,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:46:03,511 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:46:03,513 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:46:03,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:46:03,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:46:03,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:03,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:03,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:46:03,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:03,803 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:03,803 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:03,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439759183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:03,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:46:03,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:46:03,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240109693] [2025-02-06 03:46:03,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:03,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:03,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:03,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:03,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:03,806 INFO L87 Difference]: Start difference. First operand 136 states and 192 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:03,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:03,846 INFO L93 Difference]: Finished difference Result 263 states and 372 transitions. [2025-02-06 03:46:03,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:03,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2025-02-06 03:46:03,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:03,849 INFO L225 Difference]: With dead ends: 263 [2025-02-06 03:46:03,852 INFO L226 Difference]: Without dead ends: 139 [2025-02-06 03:46:03,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:03,853 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:03,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 635 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-06 03:46:03,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-02-06 03:46:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 116 states have internal predecessors, (153), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:46:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 195 transitions. [2025-02-06 03:46:03,865 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 195 transitions. Word has length 145 [2025-02-06 03:46:03,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:03,866 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 195 transitions. [2025-02-06 03:46:03,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 195 transitions. [2025-02-06 03:46:03,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 03:46:03,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:03,867 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:03,876 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:46:04,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:46:04,072 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:04,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:04,073 INFO L85 PathProgramCache]: Analyzing trace with hash 968027175, now seen corresponding path program 1 times [2025-02-06 03:46:04,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:04,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401617832] [2025-02-06 03:46:04,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:04,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:04,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 03:46:04,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 03:46:04,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:04,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:04,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:04,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401617832] [2025-02-06 03:46:04,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401617832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:04,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:04,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:46:04,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13396576] [2025-02-06 03:46:04,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:04,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:46:04,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:04,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:46:04,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:04,384 INFO L87 Difference]: Start difference. First operand 139 states and 195 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:04,456 INFO L93 Difference]: Finished difference Result 267 states and 375 transitions. [2025-02-06 03:46:04,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:04,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-02-06 03:46:04,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:04,458 INFO L225 Difference]: With dead ends: 267 [2025-02-06 03:46:04,458 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 03:46:04,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:46:04,459 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 88 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:04,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 732 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:04,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 03:46:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2025-02-06 03:46:04,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 114 states have internal predecessors, (150), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:46:04,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 192 transitions. [2025-02-06 03:46:04,465 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 192 transitions. Word has length 146 [2025-02-06 03:46:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:04,465 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 192 transitions. [2025-02-06 03:46:04,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:04,466 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 192 transitions. [2025-02-06 03:46:04,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:46:04,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:04,467 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:04,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:46:04,467 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:04,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:04,467 INFO L85 PathProgramCache]: Analyzing trace with hash 660405918, now seen corresponding path program 1 times [2025-02-06 03:46:04,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:04,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541777626] [2025-02-06 03:46:04,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:04,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:04,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:46:04,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:46:04,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:04,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:04,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:04,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541777626] [2025-02-06 03:46:04,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541777626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:04,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:04,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:46:04,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323303223] [2025-02-06 03:46:04,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:04,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:46:04,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:04,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:46:04,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:46:04,812 INFO L87 Difference]: Start difference. First operand 137 states and 192 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:04,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:04,943 INFO L93 Difference]: Finished difference Result 375 states and 529 transitions. [2025-02-06 03:46:04,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:46:04,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2025-02-06 03:46:04,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:04,945 INFO L225 Difference]: With dead ends: 375 [2025-02-06 03:46:04,945 INFO L226 Difference]: Without dead ends: 250 [2025-02-06 03:46:04,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:04,946 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 160 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:04,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 465 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:04,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-06 03:46:04,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 200. [2025-02-06 03:46:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 162 states have (on average 1.3209876543209877) internal successors, (214), 162 states have internal predecessors, (214), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:46:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 282 transitions. [2025-02-06 03:46:04,972 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 282 transitions. Word has length 147 [2025-02-06 03:46:04,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:04,972 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 282 transitions. [2025-02-06 03:46:04,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:04,972 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 282 transitions. [2025-02-06 03:46:04,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:46:04,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:04,973 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:04,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:46:04,975 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:04,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:04,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1492748706, now seen corresponding path program 1 times [2025-02-06 03:46:04,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:04,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898627855] [2025-02-06 03:46:04,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:04,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:04,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:46:05,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:46:05,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:05,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:05,315 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:05,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:05,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898627855] [2025-02-06 03:46:05,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898627855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:05,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:05,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:05,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60509733] [2025-02-06 03:46:05,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:05,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:05,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:05,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:05,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:05,318 INFO L87 Difference]: Start difference. First operand 200 states and 282 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:05,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:05,390 INFO L93 Difference]: Finished difference Result 409 states and 577 transitions. [2025-02-06 03:46:05,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:05,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2025-02-06 03:46:05,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:05,392 INFO L225 Difference]: With dead ends: 409 [2025-02-06 03:46:05,392 INFO L226 Difference]: Without dead ends: 284 [2025-02-06 03:46:05,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:05,393 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 136 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:05,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 505 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:05,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-02-06 03:46:05,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 248. [2025-02-06 03:46:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 210 states have (on average 1.361904761904762) internal successors, (286), 210 states have internal predecessors, (286), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:46:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 354 transitions. [2025-02-06 03:46:05,410 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 354 transitions. Word has length 151 [2025-02-06 03:46:05,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:05,411 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 354 transitions. [2025-02-06 03:46:05,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 354 transitions. [2025-02-06 03:46:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:46:05,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:05,412 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:05,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:46:05,412 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:05,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:05,413 INFO L85 PathProgramCache]: Analyzing trace with hash -851918335, now seen corresponding path program 1 times [2025-02-06 03:46:05,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:05,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346600055] [2025-02-06 03:46:05,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:05,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:05,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:46:05,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:46:05,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:05,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:05,678 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:05,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:05,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346600055] [2025-02-06 03:46:05,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346600055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:05,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:05,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:46:05,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194124822] [2025-02-06 03:46:05,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:05,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:46:05,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:05,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:46:05,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:05,680 INFO L87 Difference]: Start difference. First operand 248 states and 354 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:05,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:05,894 INFO L93 Difference]: Finished difference Result 482 states and 685 transitions. [2025-02-06 03:46:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:05,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2025-02-06 03:46:05,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:05,896 INFO L225 Difference]: With dead ends: 482 [2025-02-06 03:46:05,898 INFO L226 Difference]: Without dead ends: 307 [2025-02-06 03:46:05,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:46:05,899 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 156 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:05,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 742 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:46:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-02-06 03:46:05,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 247. [2025-02-06 03:46:05,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 209 states have (on average 1.354066985645933) internal successors, (283), 209 states have internal predecessors, (283), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:46:05,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 351 transitions. [2025-02-06 03:46:05,915 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 351 transitions. Word has length 151 [2025-02-06 03:46:05,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:05,915 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 351 transitions. [2025-02-06 03:46:05,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:05,915 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 351 transitions. [2025-02-06 03:46:05,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:46:05,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:05,918 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:05,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:46:05,919 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:05,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:05,919 INFO L85 PathProgramCache]: Analyzing trace with hash 398381369, now seen corresponding path program 1 times [2025-02-06 03:46:05,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:05,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118317593] [2025-02-06 03:46:05,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:05,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:05,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:46:06,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:46:06,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:06,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:07,007 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:07,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:07,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118317593] [2025-02-06 03:46:07,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118317593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:07,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:07,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:46:07,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648274449] [2025-02-06 03:46:07,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:07,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:46:07,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:07,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:46:07,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:46:07,009 INFO L87 Difference]: Start difference. First operand 247 states and 351 transitions. Second operand has 11 states, 9 states have (on average 7.777777777777778) internal successors, (70), 10 states have internal predecessors, (70), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2025-02-06 03:46:07,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:07,320 INFO L93 Difference]: Finished difference Result 501 states and 703 transitions. [2025-02-06 03:46:07,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:46:07,321 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.777777777777778) internal successors, (70), 10 states have internal predecessors, (70), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 152 [2025-02-06 03:46:07,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:07,323 INFO L225 Difference]: With dead ends: 501 [2025-02-06 03:46:07,323 INFO L226 Difference]: Without dead ends: 347 [2025-02-06 03:46:07,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:46:07,324 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 453 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:07,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1060 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:46:07,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-02-06 03:46:07,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344. [2025-02-06 03:46:07,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 296 states have (on average 1.337837837837838) internal successors, (396), 297 states have internal predecessors, (396), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 03:46:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 480 transitions. [2025-02-06 03:46:07,347 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 480 transitions. Word has length 152 [2025-02-06 03:46:07,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:07,348 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 480 transitions. [2025-02-06 03:46:07,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.777777777777778) internal successors, (70), 10 states have internal predecessors, (70), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2025-02-06 03:46:07,348 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 480 transitions. [2025-02-06 03:46:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 03:46:07,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:07,349 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:07,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:46:07,349 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:07,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:07,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1672866785, now seen corresponding path program 1 times [2025-02-06 03:46:07,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:07,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973846286] [2025-02-06 03:46:07,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:07,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:07,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 03:46:07,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 03:46:07,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:07,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:07,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:07,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973846286] [2025-02-06 03:46:07,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973846286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:07,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:07,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:07,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748086761] [2025-02-06 03:46:07,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:07,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:07,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:07,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:07,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:07,588 INFO L87 Difference]: Start difference. First operand 344 states and 480 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:07,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:07,648 INFO L93 Difference]: Finished difference Result 730 states and 1017 transitions. [2025-02-06 03:46:07,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:07,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 153 [2025-02-06 03:46:07,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:07,650 INFO L225 Difference]: With dead ends: 730 [2025-02-06 03:46:07,650 INFO L226 Difference]: Without dead ends: 468 [2025-02-06 03:46:07,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:07,651 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 174 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:07,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 616 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:07,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-02-06 03:46:07,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 346. [2025-02-06 03:46:07,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 298 states have (on average 1.332214765100671) internal successors, (397), 299 states have internal predecessors, (397), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 03:46:07,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 481 transitions. [2025-02-06 03:46:07,681 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 481 transitions. Word has length 153 [2025-02-06 03:46:07,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:07,681 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 481 transitions. [2025-02-06 03:46:07,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 481 transitions. [2025-02-06 03:46:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 03:46:07,682 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:07,683 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:07,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:46:07,683 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:07,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1129767031, now seen corresponding path program 1 times [2025-02-06 03:46:07,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:07,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462713125] [2025-02-06 03:46:07,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:07,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:07,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 03:46:07,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 03:46:07,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:07,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:07,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:07,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462713125] [2025-02-06 03:46:07,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462713125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:07,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:07,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:46:07,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043401083] [2025-02-06 03:46:07,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:07,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:46:07,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:07,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:46:07,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:46:07,812 INFO L87 Difference]: Start difference. First operand 346 states and 481 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:07,854 INFO L93 Difference]: Finished difference Result 607 states and 846 transitions. [2025-02-06 03:46:07,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:46:07,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2025-02-06 03:46:07,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:07,856 INFO L225 Difference]: With dead ends: 607 [2025-02-06 03:46:07,856 INFO L226 Difference]: Without dead ends: 350 [2025-02-06 03:46:07,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:46:07,861 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:07,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:07,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-02-06 03:46:07,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2025-02-06 03:46:07,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 302 states have (on average 1.3278145695364238) internal successors, (401), 303 states have internal predecessors, (401), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 03:46:07,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 485 transitions. [2025-02-06 03:46:07,899 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 485 transitions. Word has length 154 [2025-02-06 03:46:07,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:07,899 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 485 transitions. [2025-02-06 03:46:07,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 485 transitions. [2025-02-06 03:46:07,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 03:46:07,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:07,901 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:07,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:46:07,904 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:07,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:07,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1931066981, now seen corresponding path program 1 times [2025-02-06 03:46:07,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:07,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795564356] [2025-02-06 03:46:07,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:07,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:07,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 03:46:07,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 03:46:07,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:07,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:08,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:08,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795564356] [2025-02-06 03:46:08,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795564356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:08,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:08,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:46:08,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658753514] [2025-02-06 03:46:08,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:08,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:46:08,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:08,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:46:08,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:46:08,019 INFO L87 Difference]: Start difference. First operand 350 states and 485 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:08,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:08,056 INFO L93 Difference]: Finished difference Result 601 states and 836 transitions. [2025-02-06 03:46:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:46:08,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2025-02-06 03:46:08,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:08,059 INFO L225 Difference]: With dead ends: 601 [2025-02-06 03:46:08,059 INFO L226 Difference]: Without dead ends: 352 [2025-02-06 03:46:08,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:46:08,060 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:08,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 320 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:08,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-02-06 03:46:08,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2025-02-06 03:46:08,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 304 states have (on average 1.325657894736842) internal successors, (403), 305 states have internal predecessors, (403), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 03:46:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 487 transitions. [2025-02-06 03:46:08,082 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 487 transitions. Word has length 154 [2025-02-06 03:46:08,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:08,082 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 487 transitions. [2025-02-06 03:46:08,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 487 transitions. [2025-02-06 03:46:08,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 03:46:08,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:08,085 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:08,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:46:08,085 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:08,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:08,085 INFO L85 PathProgramCache]: Analyzing trace with hash 955125520, now seen corresponding path program 1 times [2025-02-06 03:46:08,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:08,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869945409] [2025-02-06 03:46:08,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:08,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:08,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 03:46:08,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 03:46:08,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:08,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:08,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:08,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869945409] [2025-02-06 03:46:08,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869945409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:08,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:08,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:46:08,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595293176] [2025-02-06 03:46:08,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:08,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:46:08,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:08,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:46:08,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:08,546 INFO L87 Difference]: Start difference. First operand 352 states and 487 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:08,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:08,611 INFO L93 Difference]: Finished difference Result 364 states and 499 transitions. [2025-02-06 03:46:08,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:08,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2025-02-06 03:46:08,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:08,613 INFO L225 Difference]: With dead ends: 364 [2025-02-06 03:46:08,613 INFO L226 Difference]: Without dead ends: 362 [2025-02-06 03:46:08,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:46:08,614 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 105 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:08,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 951 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:08,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-02-06 03:46:08,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2025-02-06 03:46:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 313 states have (on average 1.31629392971246) internal successors, (412), 314 states have internal predecessors, (412), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 03:46:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 496 transitions. [2025-02-06 03:46:08,633 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 496 transitions. Word has length 154 [2025-02-06 03:46:08,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:08,634 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 496 transitions. [2025-02-06 03:46:08,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 496 transitions. [2025-02-06 03:46:08,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 03:46:08,635 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:08,635 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:08,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:46:08,635 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:08,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:08,636 INFO L85 PathProgramCache]: Analyzing trace with hash 956049041, now seen corresponding path program 1 times [2025-02-06 03:46:08,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:08,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326505131] [2025-02-06 03:46:08,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:08,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:08,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 03:46:08,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 03:46:08,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:08,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:46:09,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:09,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326505131] [2025-02-06 03:46:09,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326505131] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:09,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930502369] [2025-02-06 03:46:09,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:09,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:46:09,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:46:09,174 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:46:09,178 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:46:09,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 03:46:09,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 03:46:09,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:09,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:09,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 03:46:09,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:10,218 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 15 treesize of output 1 [2025-02-06 03:46:10,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2025-02-06 03:46:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 5 proven. 279 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-02-06 03:46:10,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:46:11,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 48 treesize of output 44 [2025-02-06 03:46:11,406 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:46:11,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930502369] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:46:11,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:46:11,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 24 [2025-02-06 03:46:11,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523719890] [2025-02-06 03:46:11,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:46:11,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 03:46:11,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:11,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 03:46:11,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:46:11,408 INFO L87 Difference]: Start difference. First operand 362 states and 496 transitions. Second operand has 24 states, 20 states have (on average 7.95) internal successors, (159), 22 states have internal predecessors, (159), 11 states have call successors, (51), 4 states have call predecessors, (51), 6 states have return successors, (51), 8 states have call predecessors, (51), 11 states have call successors, (51) [2025-02-06 03:46:12,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:12,399 INFO L93 Difference]: Finished difference Result 942 states and 1278 transitions. [2025-02-06 03:46:12,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 03:46:12,400 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 7.95) internal successors, (159), 22 states have internal predecessors, (159), 11 states have call successors, (51), 4 states have call predecessors, (51), 6 states have return successors, (51), 8 states have call predecessors, (51), 11 states have call successors, (51) Word has length 154 [2025-02-06 03:46:12,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:12,403 INFO L225 Difference]: With dead ends: 942 [2025-02-06 03:46:12,403 INFO L226 Difference]: Without dead ends: 667 [2025-02-06 03:46:12,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=282, Invalid=1050, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 03:46:12,404 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 336 mSDsluCounter, 2044 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:12,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 2186 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:46:12,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-02-06 03:46:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 639. [2025-02-06 03:46:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 558 states have (on average 1.3154121863799284) internal successors, (734), 560 states have internal predecessors, (734), 67 states have call successors, (67), 13 states have call predecessors, (67), 13 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 03:46:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 868 transitions. [2025-02-06 03:46:12,442 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 868 transitions. Word has length 154 [2025-02-06 03:46:12,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:12,443 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 868 transitions. [2025-02-06 03:46:12,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 7.95) internal successors, (159), 22 states have internal predecessors, (159), 11 states have call successors, (51), 4 states have call predecessors, (51), 6 states have return successors, (51), 8 states have call predecessors, (51), 11 states have call successors, (51) [2025-02-06 03:46:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 868 transitions. [2025-02-06 03:46:12,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 03:46:12,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:12,445 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:12,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:46:12,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:46:12,646 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:12,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:12,646 INFO L85 PathProgramCache]: Analyzing trace with hash -467411459, now seen corresponding path program 1 times [2025-02-06 03:46:12,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:12,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631166934] [2025-02-06 03:46:12,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:12,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:12,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 03:46:12,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 03:46:12,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:12,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:12,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:12,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631166934] [2025-02-06 03:46:12,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631166934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:12,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:12,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:12,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339752722] [2025-02-06 03:46:12,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:12,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:12,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:12,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:12,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:12,924 INFO L87 Difference]: Start difference. First operand 639 states and 868 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:13,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:13,020 INFO L93 Difference]: Finished difference Result 1033 states and 1407 transitions. [2025-02-06 03:46:13,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:13,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 155 [2025-02-06 03:46:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:13,025 INFO L225 Difference]: With dead ends: 1033 [2025-02-06 03:46:13,025 INFO L226 Difference]: Without dead ends: 772 [2025-02-06 03:46:13,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:13,027 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 148 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:13,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 586 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:13,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-02-06 03:46:13,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 667. [2025-02-06 03:46:13,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 586 states have (on average 1.3225255972696246) internal successors, (775), 588 states have internal predecessors, (775), 67 states have call successors, (67), 13 states have call predecessors, (67), 13 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 03:46:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 909 transitions. [2025-02-06 03:46:13,073 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 909 transitions. Word has length 155 [2025-02-06 03:46:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:13,073 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 909 transitions. [2025-02-06 03:46:13,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:13,073 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 909 transitions. [2025-02-06 03:46:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 03:46:13,075 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:13,075 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:13,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:46:13,075 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:13,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:13,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1789499548, now seen corresponding path program 1 times [2025-02-06 03:46:13,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:13,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70350920] [2025-02-06 03:46:13,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:13,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:13,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 03:46:13,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 03:46:13,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:13,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:13,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:13,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70350920] [2025-02-06 03:46:13,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70350920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:13,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:13,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:46:13,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10868583] [2025-02-06 03:46:13,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:13,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:46:13,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:13,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:46:13,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:46:13,330 INFO L87 Difference]: Start difference. First operand 667 states and 909 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:13,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:13,516 INFO L93 Difference]: Finished difference Result 1437 states and 1951 transitions. [2025-02-06 03:46:13,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:13,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 155 [2025-02-06 03:46:13,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:13,521 INFO L225 Difference]: With dead ends: 1437 [2025-02-06 03:46:13,521 INFO L226 Difference]: Without dead ends: 893 [2025-02-06 03:46:13,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:46:13,523 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 154 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:13,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 928 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-02-06 03:46:13,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 685. [2025-02-06 03:46:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 604 states have (on average 1.3129139072847682) internal successors, (793), 606 states have internal predecessors, (793), 67 states have call successors, (67), 13 states have call predecessors, (67), 13 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 03:46:13,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 927 transitions. [2025-02-06 03:46:13,561 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 927 transitions. Word has length 155 [2025-02-06 03:46:13,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:13,561 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 927 transitions. [2025-02-06 03:46:13,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:13,562 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 927 transitions. [2025-02-06 03:46:13,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:46:13,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:13,564 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:13,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 03:46:13,564 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:13,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:13,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1198886477, now seen corresponding path program 1 times [2025-02-06 03:46:13,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:13,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651767882] [2025-02-06 03:46:13,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:13,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:13,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:46:13,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:46:13,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:13,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:13,964 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:13,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:13,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651767882] [2025-02-06 03:46:13,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651767882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:13,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:13,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:46:13,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083153213] [2025-02-06 03:46:13,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:13,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:46:13,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:13,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:46:13,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:46:13,965 INFO L87 Difference]: Start difference. First operand 685 states and 927 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:14,271 INFO L93 Difference]: Finished difference Result 1478 states and 2001 transitions. [2025-02-06 03:46:14,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:46:14,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2025-02-06 03:46:14,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:14,275 INFO L225 Difference]: With dead ends: 1478 [2025-02-06 03:46:14,276 INFO L226 Difference]: Without dead ends: 934 [2025-02-06 03:46:14,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:46:14,277 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 242 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:14,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 835 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:46:14,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-02-06 03:46:14,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 919. [2025-02-06 03:46:14,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 815 states have (on average 1.3079754601226994) internal successors, (1066), 819 states have internal predecessors, (1066), 85 states have call successors, (85), 18 states have call predecessors, (85), 18 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2025-02-06 03:46:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1236 transitions. [2025-02-06 03:46:14,324 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1236 transitions. Word has length 156 [2025-02-06 03:46:14,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:14,325 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1236 transitions. [2025-02-06 03:46:14,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1236 transitions. [2025-02-06 03:46:14,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:46:14,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:14,327 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:14,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:46:14,327 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:14,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:14,328 INFO L85 PathProgramCache]: Analyzing trace with hash 526594420, now seen corresponding path program 1 times [2025-02-06 03:46:14,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:14,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574646930] [2025-02-06 03:46:14,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:14,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:14,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:46:14,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:46:14,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:14,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:14,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:14,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574646930] [2025-02-06 03:46:14,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574646930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:14,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:14,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:46:14,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343334969] [2025-02-06 03:46:14,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:14,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:46:14,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:14,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:46:14,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:46:14,455 INFO L87 Difference]: Start difference. First operand 919 states and 1236 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:14,565 INFO L93 Difference]: Finished difference Result 1479 states and 1998 transitions. [2025-02-06 03:46:14,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:46:14,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2025-02-06 03:46:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:14,569 INFO L225 Difference]: With dead ends: 1479 [2025-02-06 03:46:14,569 INFO L226 Difference]: Without dead ends: 705 [2025-02-06 03:46:14,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:46:14,570 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 110 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:14,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 427 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:14,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-02-06 03:46:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 693. [2025-02-06 03:46:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 610 states have (on average 1.301639344262295) internal successors, (794), 612 states have internal predecessors, (794), 67 states have call successors, (67), 15 states have call predecessors, (67), 15 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 03:46:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 928 transitions. [2025-02-06 03:46:14,619 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 928 transitions. Word has length 156 [2025-02-06 03:46:14,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:14,619 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 928 transitions. [2025-02-06 03:46:14,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:14,620 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 928 transitions. [2025-02-06 03:46:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:46:14,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:14,621 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:14,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:46:14,621 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:14,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:14,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1797731507, now seen corresponding path program 1 times [2025-02-06 03:46:14,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:14,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879987935] [2025-02-06 03:46:14,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:14,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:14,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:46:14,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:46:14,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:14,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:14,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:14,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879987935] [2025-02-06 03:46:14,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879987935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:14,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:14,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:14,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384973736] [2025-02-06 03:46:14,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:14,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:14,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:14,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:14,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:14,788 INFO L87 Difference]: Start difference. First operand 693 states and 928 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:14,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:14,858 INFO L93 Difference]: Finished difference Result 1140 states and 1525 transitions. [2025-02-06 03:46:14,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:14,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2025-02-06 03:46:14,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:14,862 INFO L225 Difference]: With dead ends: 1140 [2025-02-06 03:46:14,862 INFO L226 Difference]: Without dead ends: 825 [2025-02-06 03:46:14,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:14,864 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 79 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:14,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 646 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:14,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2025-02-06 03:46:14,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 665. [2025-02-06 03:46:14,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 582 states have (on average 1.2972508591065293) internal successors, (755), 584 states have internal predecessors, (755), 67 states have call successors, (67), 15 states have call predecessors, (67), 15 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 03:46:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 889 transitions. [2025-02-06 03:46:14,897 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 889 transitions. Word has length 156 [2025-02-06 03:46:14,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:14,898 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 889 transitions. [2025-02-06 03:46:14,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:14,898 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 889 transitions. [2025-02-06 03:46:14,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:46:14,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:14,899 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:14,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:46:14,899 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:14,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:14,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1512347324, now seen corresponding path program 1 times [2025-02-06 03:46:14,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:14,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671618163] [2025-02-06 03:46:14,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:14,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:14,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:46:14,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:46:14,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:14,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:46:16,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:16,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671618163] [2025-02-06 03:46:16,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671618163] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:16,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492398655] [2025-02-06 03:46:16,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:16,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:46:16,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:46:16,636 INFO L229 MonitoredProcess]: Starting monitored process 5 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:46:16,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 03:46:16,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:46:16,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:46:16,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:16,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:16,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 03:46:16,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:17,025 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 15 treesize of output 1 [2025-02-06 03:46:17,059 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 64 treesize of output 51 [2025-02-06 03:46:17,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 [2025-02-06 03:46:17,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2025-02-06 03:46:17,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 57 treesize of output 45 [2025-02-06 03:46:17,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 49 treesize of output 29 [2025-02-06 03:46:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2025-02-06 03:46:17,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:46:17,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 33 [2025-02-06 03:46:17,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:46:17,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2025-02-06 03:46:17,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 55 treesize of output 42 [2025-02-06 03:46:17,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 20 [2025-02-06 03:46:17,720 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:17,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492398655] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:17,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:46:17,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [24, 12] total 32 [2025-02-06 03:46:17,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816929243] [2025-02-06 03:46:17,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:17,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:46:17,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:17,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:46:17,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=915, Unknown=0, NotChecked=0, Total=992 [2025-02-06 03:46:17,722 INFO L87 Difference]: Start difference. First operand 665 states and 889 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:18,153 INFO L93 Difference]: Finished difference Result 1166 states and 1569 transitions. [2025-02-06 03:46:18,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:46:18,153 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 158 [2025-02-06 03:46:18,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:18,156 INFO L225 Difference]: With dead ends: 1166 [2025-02-06 03:46:18,157 INFO L226 Difference]: Without dead ends: 879 [2025-02-06 03:46:18,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=1233, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 03:46:18,159 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 84 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:18,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1525 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:46:18,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-02-06 03:46:18,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 760. [2025-02-06 03:46:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 677 states have (on average 1.3146233382570163) internal successors, (890), 679 states have internal predecessors, (890), 67 states have call successors, (67), 15 states have call predecessors, (67), 15 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 03:46:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1024 transitions. [2025-02-06 03:46:18,190 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1024 transitions. Word has length 158 [2025-02-06 03:46:18,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:18,190 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1024 transitions. [2025-02-06 03:46:18,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1024 transitions. [2025-02-06 03:46:18,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:46:18,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:18,192 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:18,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 03:46:18,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-06 03:46:18,392 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:18,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:18,393 INFO L85 PathProgramCache]: Analyzing trace with hash -159037627, now seen corresponding path program 1 times [2025-02-06 03:46:18,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:18,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97292739] [2025-02-06 03:46:18,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:18,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:18,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:46:18,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:46:18,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:18,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:18,508 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:18,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:18,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97292739] [2025-02-06 03:46:18,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97292739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:18,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:18,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:18,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873836642] [2025-02-06 03:46:18,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:18,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:18,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:18,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:18,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:18,510 INFO L87 Difference]: Start difference. First operand 760 states and 1024 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:18,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:18,620 INFO L93 Difference]: Finished difference Result 1222 states and 1655 transitions. [2025-02-06 03:46:18,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:18,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 158 [2025-02-06 03:46:18,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:18,623 INFO L225 Difference]: With dead ends: 1222 [2025-02-06 03:46:18,623 INFO L226 Difference]: Without dead ends: 865 [2025-02-06 03:46:18,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:18,625 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 76 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:18,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 821 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-02-06 03:46:18,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 760. [2025-02-06 03:46:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 677 states have (on average 1.3116691285081241) internal successors, (888), 679 states have internal predecessors, (888), 67 states have call successors, (67), 15 states have call predecessors, (67), 15 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 03:46:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1022 transitions. [2025-02-06 03:46:18,654 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1022 transitions. Word has length 158 [2025-02-06 03:46:18,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:18,654 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1022 transitions. [2025-02-06 03:46:18,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1022 transitions. [2025-02-06 03:46:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:46:18,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:18,655 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:18,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 03:46:18,656 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:18,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:18,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1182581563, now seen corresponding path program 1 times [2025-02-06 03:46:18,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:18,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873610100] [2025-02-06 03:46:18,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:18,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:18,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:46:18,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:46:18,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:18,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:18,770 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:18,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:18,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873610100] [2025-02-06 03:46:18,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873610100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:18,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:18,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:18,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844331986] [2025-02-06 03:46:18,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:18,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:18,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:18,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:18,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:18,772 INFO L87 Difference]: Start difference. First operand 760 states and 1022 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:18,883 INFO L93 Difference]: Finished difference Result 1274 states and 1726 transitions. [2025-02-06 03:46:18,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:18,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 158 [2025-02-06 03:46:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:18,886 INFO L225 Difference]: With dead ends: 1274 [2025-02-06 03:46:18,886 INFO L226 Difference]: Without dead ends: 917 [2025-02-06 03:46:18,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:18,889 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 79 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:18,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 741 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2025-02-06 03:46:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 804. [2025-02-06 03:46:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 720 states have (on average 1.3208333333333333) internal successors, (951), 722 states have internal predecessors, (951), 67 states have call successors, (67), 16 states have call predecessors, (67), 16 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 03:46:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1085 transitions. [2025-02-06 03:46:18,918 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1085 transitions. Word has length 158 [2025-02-06 03:46:18,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:18,918 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1085 transitions. [2025-02-06 03:46:18,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:18,918 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1085 transitions. [2025-02-06 03:46:18,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:46:18,919 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:18,919 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:18,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 03:46:18,920 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:18,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:18,920 INFO L85 PathProgramCache]: Analyzing trace with hash 170728134, now seen corresponding path program 1 times [2025-02-06 03:46:18,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:18,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62108209] [2025-02-06 03:46:18,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:18,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:18,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:46:18,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:46:18,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:18,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 48 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-02-06 03:46:20,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:20,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62108209] [2025-02-06 03:46:20,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62108209] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:20,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912927775] [2025-02-06 03:46:20,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:20,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:46:20,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:46:20,656 INFO L229 MonitoredProcess]: Starting monitored process 6 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:46:20,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 03:46:20,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:46:20,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:46:20,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:20,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:20,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 03:46:20,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:21,184 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 15 treesize of output 1 [2025-02-06 03:46:21,230 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 64 treesize of output 51 [2025-02-06 03:46:21,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2025-02-06 03:46:21,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 [2025-02-06 03:46:21,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 57 treesize of output 45 [2025-02-06 03:46:21,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 49 treesize of output 29 [2025-02-06 03:46:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 298 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-02-06 03:46:21,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:46:21,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 33 [2025-02-06 03:46:21,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:46:21,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2025-02-06 03:46:21,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2025-02-06 03:46:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:21,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912927775] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:21,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:46:21,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [25, 12] total 34 [2025-02-06 03:46:21,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74080289] [2025-02-06 03:46:21,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:21,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:46:21,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:21,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:46:21,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1040, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 03:46:21,989 INFO L87 Difference]: Start difference. First operand 804 states and 1085 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:22,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:22,479 INFO L93 Difference]: Finished difference Result 1336 states and 1808 transitions. [2025-02-06 03:46:22,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:46:22,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 158 [2025-02-06 03:46:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:22,483 INFO L225 Difference]: With dead ends: 1336 [2025-02-06 03:46:22,484 INFO L226 Difference]: Without dead ends: 939 [2025-02-06 03:46:22,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=104, Invalid=1378, Unknown=0, NotChecked=0, Total=1482 [2025-02-06 03:46:22,486 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 83 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:22,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1710 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:46:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-02-06 03:46:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 923. [2025-02-06 03:46:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 823 states have (on average 1.307411907654921) internal successors, (1076), 827 states have internal predecessors, (1076), 79 states have call successors, (79), 20 states have call predecessors, (79), 20 states have return successors, (79), 75 states have call predecessors, (79), 79 states have call successors, (79) [2025-02-06 03:46:22,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1234 transitions. [2025-02-06 03:46:22,527 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1234 transitions. Word has length 158 [2025-02-06 03:46:22,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:22,527 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1234 transitions. [2025-02-06 03:46:22,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:22,527 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1234 transitions. [2025-02-06 03:46:22,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:46:22,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:22,529 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:22,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 03:46:22,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-06 03:46:22,730 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:22,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:22,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1864086331, now seen corresponding path program 1 times [2025-02-06 03:46:22,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:22,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842504435] [2025-02-06 03:46:22,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:22,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:22,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:46:22,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:46:22,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:22,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:22,958 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:22,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842504435] [2025-02-06 03:46:22,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842504435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:22,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:22,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:46:22,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011921971] [2025-02-06 03:46:22,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:22,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:46:22,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:22,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:46:22,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:22,960 INFO L87 Difference]: Start difference. First operand 923 states and 1234 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:23,358 INFO L93 Difference]: Finished difference Result 2096 states and 2809 transitions. [2025-02-06 03:46:23,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:46:23,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 158 [2025-02-06 03:46:23,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:23,364 INFO L225 Difference]: With dead ends: 2096 [2025-02-06 03:46:23,364 INFO L226 Difference]: Without dead ends: 1321 [2025-02-06 03:46:23,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:46:23,366 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 323 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:23,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 876 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:46:23,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2025-02-06 03:46:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1260. [2025-02-06 03:46:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 1121 states have (on average 1.296164139161463) internal successors, (1453), 1128 states have internal predecessors, (1453), 110 states have call successors, (110), 28 states have call predecessors, (110), 28 states have return successors, (110), 103 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-06 03:46:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1673 transitions. [2025-02-06 03:46:23,418 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1673 transitions. Word has length 158 [2025-02-06 03:46:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:23,419 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1673 transitions. [2025-02-06 03:46:23,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1673 transitions. [2025-02-06 03:46:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:46:23,420 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:23,420 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:23,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 03:46:23,421 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:23,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:23,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1947557947, now seen corresponding path program 1 times [2025-02-06 03:46:23,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:23,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292844773] [2025-02-06 03:46:23,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:23,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:23,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:46:23,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:46:23,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:23,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:23,591 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:23,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:23,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292844773] [2025-02-06 03:46:23,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292844773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:23,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:23,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:23,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237996605] [2025-02-06 03:46:23,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:23,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:23,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:23,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:23,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:23,593 INFO L87 Difference]: Start difference. First operand 1260 states and 1673 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:23,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:23,714 INFO L93 Difference]: Finished difference Result 2393 states and 3192 transitions. [2025-02-06 03:46:23,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:23,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 158 [2025-02-06 03:46:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:23,720 INFO L225 Difference]: With dead ends: 2393 [2025-02-06 03:46:23,720 INFO L226 Difference]: Without dead ends: 1299 [2025-02-06 03:46:23,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:23,721 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 119 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:23,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 719 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:23,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2025-02-06 03:46:23,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1238. [2025-02-06 03:46:23,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1099 states have (on average 1.2902638762511374) internal successors, (1418), 1106 states have internal predecessors, (1418), 110 states have call successors, (110), 28 states have call predecessors, (110), 28 states have return successors, (110), 103 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-06 03:46:23,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1638 transitions. [2025-02-06 03:46:23,772 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1638 transitions. Word has length 158 [2025-02-06 03:46:23,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:23,773 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1638 transitions. [2025-02-06 03:46:23,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:23,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1638 transitions. [2025-02-06 03:46:23,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:46:23,774 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:23,774 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:23,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 03:46:23,774 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:23,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:23,776 INFO L85 PathProgramCache]: Analyzing trace with hash -915446091, now seen corresponding path program 1 times [2025-02-06 03:46:23,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:23,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047080663] [2025-02-06 03:46:23,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:23,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:23,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:46:23,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:46:23,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:23,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:46:23,832 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:46:23,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:46:23,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:46:23,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:23,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:46:23,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:46:23,972 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:46:23,972 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:46:23,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 03:46:23,975 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:24,316 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:46:24,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:46:24 BoogieIcfgContainer [2025-02-06 03:46:24,319 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:46:24,319 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:46:24,324 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:46:24,324 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:46:24,325 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:46:01" (3/4) ... [2025-02-06 03:46:24,327 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:46:24,327 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:46:24,332 INFO L158 Benchmark]: Toolchain (without parser) took 24110.76ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 105.5MB in the beginning and 149.0MB in the end (delta: -43.4MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2025-02-06 03:46:24,332 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:46:24,332 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.34ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 90.8MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:46:24,332 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.68ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:46:24,332 INFO L158 Benchmark]: Boogie Preprocessor took 40.93ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 82.4MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:46:24,332 INFO L158 Benchmark]: IcfgBuilder took 555.71ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 39.5MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 03:46:24,332 INFO L158 Benchmark]: TraceAbstraction took 23225.46ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 38.6MB in the beginning and 149.1MB in the end (delta: -110.5MB). Peak memory consumption was 207.8MB. Max. memory is 16.1GB. [2025-02-06 03:46:24,332 INFO L158 Benchmark]: Witness Printer took 7.91ms. Allocated memory is still 226.5MB. Free memory was 149.1MB in the beginning and 149.0MB in the end (delta: 189.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:46:24,333 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.34ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 90.8MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.68ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.93ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 82.4MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 555.71ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 39.5MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 23225.46ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 38.6MB in the beginning and 149.1MB in the end (delta: -110.5MB). Peak memory consumption was 207.8MB. Max. memory is 16.1GB. * Witness Printer took 7.91ms. Allocated memory is still 226.5MB. Free memory was 149.1MB in the beginning and 149.0MB in the end (delta: 189.1kB). There was no memory consumed. 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 108, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of bitwiseOr at line 60, overapproximation of bitwiseOr at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -8; [L22] signed char var_1_1 = -8; [L23] signed char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_5 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char* var_1_5_Pointer = &(var_1_5); [L26] unsigned char var_1_6 = 1; [L26] unsigned char var_1_6 = 1; [L27] unsigned char* var_1_6_Pointer = &(var_1_6); [L28] signed char var_1_7 = -1; [L28] signed char var_1_7 = -1; [L29] signed char* var_1_7_Pointer = &(var_1_7); [L30] signed char var_1_8 = -50; [L30] signed char var_1_8 = -50; [L31] signed char* var_1_8_Pointer = &(var_1_8); [L32] signed char var_1_9 = 100; [L32] signed char var_1_9 = 100; [L33] signed char* var_1_9_Pointer = &(var_1_9); [L34] unsigned long int var_1_10 = 25; [L34] unsigned long int var_1_10 = 25; [L35] unsigned long int* var_1_10_Pointer = &(var_1_10); [L36] unsigned long int var_1_11 = 2568920345; [L36] unsigned long int var_1_11 = 2568920345; [L37] unsigned long int* var_1_11_Pointer = &(var_1_11); [L38] unsigned long int var_1_12 = 1191097264; [L38] unsigned long int var_1_12 = 1191097264; [L39] unsigned long int* var_1_12_Pointer = &(var_1_12); [L40] unsigned long int var_1_13 = 1801344522; [L40] unsigned long int var_1_13 = 1801344522; [L41] unsigned long int* var_1_13_Pointer = &(var_1_13); [L42] signed long int var_1_14 = 64; [L42] signed long int var_1_14 = 64; [L43] signed long int* var_1_14_Pointer = &(var_1_14); [L44] signed short int var_1_15 = -16; [L44] signed short int var_1_15 = -16; [L45] signed short int* var_1_15_Pointer = &(var_1_15); [L46] float var_1_16 = 1000000.5; [L46] float var_1_16 = 1000000.5; [L47] float* var_1_16_Pointer = &(var_1_16); [L48] float var_1_17 = 4.5; [L48] float var_1_17 = 4.5; [L49] float* var_1_17_Pointer = &(var_1_17); [L50] unsigned char var_1_18 = 0; [L50] unsigned char var_1_18 = 0; [L51] unsigned char* var_1_18_Pointer = &(var_1_18); [L52] unsigned char var_1_19 = 128; [L52] unsigned char var_1_19 = 128; [L53] unsigned char* var_1_19_Pointer = &(var_1_19); [L54] unsigned long int last_1_var_1_10 = 25; [L55] signed short int last_1_var_1_15 = -16; [L56] unsigned char last_1_var_1_18 = 0; VAL [isInitial=0, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L114] EXPR \read(var_1_10) [L114] last_1_var_1_10 = var_1_10 [L115] EXPR \read(var_1_15) [L115] last_1_var_1_15 = var_1_15 [L116] EXPR \read(var_1_18) [L116] last_1_var_1_18 = var_1_18 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L86] var_1_5 = __VERIFIER_nondet_uchar() [L87] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] var_1_6 = __VERIFIER_nondet_uchar() [L90] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] var_1_7 = __VERIFIER_nondet_char() [L93] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] var_1_9 = __VERIFIER_nondet_char() [L96] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] var_1_11 = __VERIFIER_nondet_ulong() [L99] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L100] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L100] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L100] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L101] var_1_12 = __VERIFIER_nondet_ulong() [L102] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L102] CALL assume_abort_if_not(var_1_12 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L102] RET assume_abort_if_not(var_1_12 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L104] var_1_13 = __VERIFIER_nondet_ulong() [L105] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L105] CALL assume_abort_if_not(var_1_13 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L105] RET assume_abort_if_not(var_1_13 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L106] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L106] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L106] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107] var_1_17 = __VERIFIER_nondet_float() [L108] EXPR \read(var_1_17) [L108] EXPR var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L108] EXPR var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F [L108] EXPR \read(var_1_17) [L108] EXPR var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L108] EXPR (var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L108] EXPR (var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L108] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L108] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L109] var_1_19 = __VERIFIER_nondet_uchar() [L110] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L110] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L110] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L127] RET updateVariables() [L128] CALL step() [L60] EXPR last_1_var_1_15 | last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L60] ((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L60] ((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer)) [L60] EXPR \read(*var_1_5_Pointer) [L60] ((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L60] COND FALSE !(((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) [L67] EXPR \read(*var_1_7_Pointer) [L67] (*(var_1_1_Pointer)) = (*(var_1_7_Pointer)) [L69] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L69] COND FALSE !((*(var_1_5_Pointer))) [L72] EXPR \read(*var_1_12_Pointer) [L72] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L72] COND TRUE (*(var_1_12_Pointer)) <= (*(var_1_8_Pointer)) [L73] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L73] EXPR (((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))) [L73] EXPR \read(*var_1_8_Pointer) [L73] EXPR (((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L73] (*(var_1_14_Pointer)) = (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) [L75] (*(var_1_15_Pointer)) = 2 [L76] EXPR \read(*var_1_17_Pointer) [L76] (*(var_1_16_Pointer)) = (*(var_1_17_Pointer)) [L77] EXPR \read(*var_1_19_Pointer) [L77] (*(var_1_18_Pointer)) = (*(var_1_19_Pointer)) [L78] EXPR \read(*var_1_8_Pointer) [L78] EXPR \read(*var_1_1_Pointer) [L78] unsigned char stepLocal_0 = (*(var_1_8_Pointer)) < (*(var_1_1_Pointer)); [L79] stepLocal_0 && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L79] stepLocal_0 && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L79] COND FALSE !(stepLocal_0 && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) [L82] EXPR \read(*var_1_11_Pointer) [L82] EXPR \read(*var_1_13_Pointer) [L82] (*(var_1_10_Pointer)) = ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))) [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR last_1_var_1_15 | last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer)) [L119] EXPR \read(*var_1_5_Pointer) [L119] EXPR ((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) [L119] EXPR \read(*var_1_1_Pointer) [L119] EXPR \read(*var_1_7_Pointer) [L119] EXPR (((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1) [L119] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1 [L119] EXPR (*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer)))))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer)))))) [L119] EXPR \read(*var_1_8_Pointer) [L119] EXPR \read(*var_1_1_Pointer) [L119] EXPR ((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))) [L119] EXPR \read(*var_1_10_Pointer) [L119] EXPR \read(*var_1_11_Pointer) [L119] EXPR \read(*var_1_13_Pointer) [L119] EXPR (((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer)))))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) [L119] EXPR \read(*var_1_12_Pointer) [L119] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1 [L119] EXPR \read(*var_1_14_Pointer) [L119] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))) [L119] EXPR \read(*var_1_8_Pointer) [L119] EXPR (((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2)) [L119] EXPR \read(*var_1_15_Pointer) [L119] EXPR (((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_17_Pointer)))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR ((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_17_Pointer)))) [L119] EXPR \read(*var_1_16_Pointer) [L119] EXPR \read(*var_1_17_Pointer) [L119] EXPR ((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_17_Pointer)))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] EXPR (((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119-L120] return (((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.8s, OverallIterations: 28, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3201 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3201 mSDsluCounter, 20523 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15520 mSDsCounter, 352 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3513 IncrementalHoareTripleChecker+Invalid, 3865 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 352 mSolverCounterUnsat, 5003 mSDtfsCounter, 3513 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1482 GetRequests, 1258 SyntacticMatches, 2 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1260occurred in iteration=26, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 27 MinimizatonAttempts, 1281 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 5018 NumberOfCodeBlocks, 5018 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 5295 ConstructedInterpolants, 0 QuantifiedInterpolants, 24438 SizeOfPredicates, 42 NumberOfNonLiveVariables, 3357 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 35 InterpolantComputations, 26 PerfectInterpolantSequences, 18073/19040 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:46:24,367 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-p_file-88.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 59352034a8e7fb7bc8ebfc4ca4573abd72388675e4ed8d10658bda7976c62170 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:46:26,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:46:26,514 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:46:26,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:46:26,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:46:26,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:46:26,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:46:26,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:46:26,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:46:26,546 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:46:26,546 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:46:26,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:46:26,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:46:26,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:46:26,547 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:46:26,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:46:26,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:46:26,547 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:46:26,547 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:46:26,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:46:26,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:46:26,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:46:26,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:46:26,547 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:46:26,547 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:46:26,547 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:46:26,547 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:46:26,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:46:26,547 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:46:26,548 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:46:26,548 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:46:26,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:46:26,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:46:26,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:46:26,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:46:26,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:46:26,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:46:26,548 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:46:26,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:46:26,548 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:46:26,548 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:46:26,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:46:26,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:46:26,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:46:26,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:46:26,548 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 -> 59352034a8e7fb7bc8ebfc4ca4573abd72388675e4ed8d10658bda7976c62170 [2025-02-06 03:46:26,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:46:26,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:46:26,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:46:26,768 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:46:26,768 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:46:26,769 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-p_file-88.i [2025-02-06 03:46:28,014 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4234a10a3/9b7b103cc02f4bbeb319ad94c43ccdb9/FLAG39e52b1ee [2025-02-06 03:46:28,210 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:46:28,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i [2025-02-06 03:46:28,219 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4234a10a3/9b7b103cc02f4bbeb319ad94c43ccdb9/FLAG39e52b1ee [2025-02-06 03:46:28,229 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4234a10a3/9b7b103cc02f4bbeb319ad94c43ccdb9 [2025-02-06 03:46:28,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:46:28,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:46:28,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:46:28,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:46:28,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:46:28,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:46:28" (1/1) ... [2025-02-06 03:46:28,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fddf4f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:28, skipping insertion in model container [2025-02-06 03:46:28,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:46:28" (1/1) ... [2025-02-06 03:46:28,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:46:28,363 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-p_file-88.i[916,929] [2025-02-06 03:46:28,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:46:28,471 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:46:28,479 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-p_file-88.i[916,929] [2025-02-06 03:46:28,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:46:28,534 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:46:28,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:28 WrapperNode [2025-02-06 03:46:28,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:46:28,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:46:28,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:46:28,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:46:28,541 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:46:28" (1/1) ... [2025-02-06 03:46:28,557 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:46:28" (1/1) ... [2025-02-06 03:46:28,583 INFO L138 Inliner]: procedures = 36, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 542 [2025-02-06 03:46:28,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:46:28,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:46:28,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:46:28,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:46:28,589 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:28" (1/1) ... [2025-02-06 03:46:28,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:28" (1/1) ... [2025-02-06 03:46:28,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:28" (1/1) ... [2025-02-06 03:46:28,611 INFO L175 MemorySlicer]: Split 134 memory accesses to 17 slices as follows [2, 9, 10, 6, 16, 17, 12, 6, 8, 10, 10, 3, 4, 3, 8, 4, 6]. 13 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-02-06 03:46:28,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:28" (1/1) ... [2025-02-06 03:46:28,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:28" (1/1) ... [2025-02-06 03:46:28,627 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:28" (1/1) ... [2025-02-06 03:46:28,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:28" (1/1) ... [2025-02-06 03:46:28,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:28" (1/1) ... [2025-02-06 03:46:28,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:28" (1/1) ... [2025-02-06 03:46:28,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:46:28,643 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:46:28,643 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:46:28,643 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:46:28,643 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:28" (1/1) ... [2025-02-06 03:46:28,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:46:28,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:46:28,672 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:46:28,677 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:46:28,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:46:28,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:46:28,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:46:28,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:46:28,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2025-02-06 03:46:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#16 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-02-06 03:46:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-02-06 03:46:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-02-06 03:46:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-02-06 03:46:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-02-06 03:46:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-02-06 03:46:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-02-06 03:46:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2025-02-06 03:46:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2025-02-06 03:46:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#16 [2025-02-06 03:46:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:46:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:46:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-06 03:46:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-06 03:46:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-02-06 03:46:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-02-06 03:46:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#16 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#16 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:46:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#16 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-02-06 03:46:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-02-06 03:46:28,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#16 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#16 [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:46:28,701 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:46:28,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:46:28,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2025-02-06 03:46:28,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2025-02-06 03:46:28,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#16 [2025-02-06 03:46:28,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:46:28,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:46:28,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:46:28,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:46:28,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:46:28,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-02-06 03:46:28,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-02-06 03:46:28,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-02-06 03:46:28,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-02-06 03:46:28,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-02-06 03:46:28,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-02-06 03:46:28,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-02-06 03:46:28,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-02-06 03:46:28,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-02-06 03:46:28,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2025-02-06 03:46:28,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2025-02-06 03:46:28,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#16 [2025-02-06 03:46:28,943 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:46:28,944 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:46:29,327 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~mem78#1;havoc property_#t~short79#1;havoc property_#t~ite90#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~short82#1;havoc property_#t~ite87#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~ite98#1;havoc property_#t~mem97#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short99#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem107#1;havoc property_#t~short108#1;havoc property_#t~ite119#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite113#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem123#1;havoc property_#t~ite126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short129#1;havoc property_#t~mem130#1;havoc property_#t~short131#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1; [2025-02-06 03:46:29,360 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-02-06 03:46:29,360 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:46:29,367 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:46:29,367 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:46:29,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:46:29 BoogieIcfgContainer [2025-02-06 03:46:29,368 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:46:29,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:46:29,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:46:29,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:46:29,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:46:28" (1/3) ... [2025-02-06 03:46:29,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59095be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:46:29, skipping insertion in model container [2025-02-06 03:46:29,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:28" (2/3) ... [2025-02-06 03:46:29,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59095be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:46:29, skipping insertion in model container [2025-02-06 03:46:29,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:46:29" (3/3) ... [2025-02-06 03:46:29,374 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-88.i [2025-02-06 03:46:29,384 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:46:29,390 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-88.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:46:29,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:46:29,439 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;@3104a77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:46:29,439 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:46:29,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:46:29,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:46:29,448 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:29,449 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:29,449 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:29,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:29,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1436369816, now seen corresponding path program 1 times [2025-02-06 03:46:29,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:29,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008054655] [2025-02-06 03:46:29,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:29,460 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:46:29,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:29,462 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:46:29,465 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:46:29,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:46:29,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:46:29,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:29,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:29,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:46:29,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-02-06 03:46:29,852 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:29,852 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:29,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008054655] [2025-02-06 03:46:29,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008054655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:29,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:29,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:46:29,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584102015] [2025-02-06 03:46:29,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:29,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:46:29,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:29,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:46:29,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:46:29,870 INFO L87 Difference]: Start difference. First operand has 110 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:46:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:29,887 INFO L93 Difference]: Finished difference Result 214 states and 334 transitions. [2025-02-06 03:46:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:46:29,888 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-02-06 03:46:29,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:29,892 INFO L225 Difference]: With dead ends: 214 [2025-02-06 03:46:29,892 INFO L226 Difference]: Without dead ends: 107 [2025-02-06 03:46:29,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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:46:29,900 INFO L435 NwaCegarLoop]: 156 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, 156 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:46:29,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:29,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-06 03:46:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-02-06 03:46:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:46:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2025-02-06 03:46:29,934 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 139 [2025-02-06 03:46:29,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:29,935 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2025-02-06 03:46:29,935 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:46:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2025-02-06 03:46:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:46:29,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:29,938 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:29,945 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:46:30,139 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:46:30,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:30,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:30,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1637494349, now seen corresponding path program 1 times [2025-02-06 03:46:30,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:30,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4683000] [2025-02-06 03:46:30,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:30,140 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:46:30,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:30,143 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:46:30,145 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:46:30,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:46:30,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:46:30,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:30,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:30,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:46:30,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:31,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2025-02-06 03:46:31,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2025-02-06 03:46:31,247 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 5 proven. 279 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-02-06 03:46:31,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:46:31,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:46:31,453 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 22 treesize of output 25 [2025-02-06 03:46:31,929 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:46:31,929 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:31,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4683000] [2025-02-06 03:46:31,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4683000] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:46:31,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:46:31,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-02-06 03:46:31,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382927265] [2025-02-06 03:46:31,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:46:31,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:46:31,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:31,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:46:31,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:46:31,932 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 15 states, 13 states have (on average 7.769230769230769) internal successors, (101), 14 states have internal predecessors, (101), 6 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2025-02-06 03:46:32,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:32,722 INFO L93 Difference]: Finished difference Result 323 states and 469 transitions. [2025-02-06 03:46:32,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:46:32,723 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.769230769230769) internal successors, (101), 14 states have internal predecessors, (101), 6 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) Word has length 139 [2025-02-06 03:46:32,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:32,725 INFO L225 Difference]: With dead ends: 323 [2025-02-06 03:46:32,725 INFO L226 Difference]: Without dead ends: 219 [2025-02-06 03:46:32,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:46:32,726 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 493 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:32,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 1526 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:46:32,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-06 03:46:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 211. [2025-02-06 03:46:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 173 states have (on average 1.3815028901734103) internal successors, (239), 173 states have internal predecessors, (239), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:46:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 307 transitions. [2025-02-06 03:46:32,745 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 307 transitions. Word has length 139 [2025-02-06 03:46:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:32,745 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 307 transitions. [2025-02-06 03:46:32,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.769230769230769) internal successors, (101), 14 states have internal predecessors, (101), 6 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2025-02-06 03:46:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 307 transitions. [2025-02-06 03:46:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:46:32,747 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:32,751 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:32,758 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:46:32,956 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:46:32,956 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:32,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:32,957 INFO L85 PathProgramCache]: Analyzing trace with hash -255020341, now seen corresponding path program 1 times [2025-02-06 03:46:32,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:32,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988655777] [2025-02-06 03:46:32,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:32,958 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:46:32,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:32,960 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:46:32,962 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:46:33,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:46:33,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:46:33,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:33,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:33,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:46:33,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:46:33,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:46:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:33,506 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:33,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988655777] [2025-02-06 03:46:33,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988655777] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:33,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:46:33,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-02-06 03:46:33,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874537433] [2025-02-06 03:46:33,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:33,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:33,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:33,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:33,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:46:33,507 INFO L87 Difference]: Start difference. First operand 211 states and 307 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:33,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:33,578 INFO L93 Difference]: Finished difference Result 423 states and 620 transitions. [2025-02-06 03:46:33,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:33,582 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-02-06 03:46:33,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:33,583 INFO L225 Difference]: With dead ends: 423 [2025-02-06 03:46:33,584 INFO L226 Difference]: Without dead ends: 319 [2025-02-06 03:46:33,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:46:33,585 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 158 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:33,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 436 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:33,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-02-06 03:46:33,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 217. [2025-02-06 03:46:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 179 states have (on average 1.3798882681564246) internal successors, (247), 179 states have internal predecessors, (247), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:46:33,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 315 transitions. [2025-02-06 03:46:33,627 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 315 transitions. Word has length 141 [2025-02-06 03:46:33,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:33,628 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 315 transitions. [2025-02-06 03:46:33,628 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:33,628 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 315 transitions. [2025-02-06 03:46:33,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:46:33,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:33,629 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:33,644 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 (4)] Ended with exit code 0 [2025-02-06 03:46:33,830 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:46:33,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:33,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:33,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2129816117, now seen corresponding path program 1 times [2025-02-06 03:46:33,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:33,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095047836] [2025-02-06 03:46:33,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:33,831 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:46:33,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:33,836 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:46:33,837 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:46:33,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:46:34,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:46:34,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:34,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:34,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:46:34,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:34,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:34,090 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:34,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095047836] [2025-02-06 03:46:34,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095047836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:34,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:34,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:46:34,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115483654] [2025-02-06 03:46:34,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:34,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:46:34,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:34,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:46:34,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:34,092 INFO L87 Difference]: Start difference. First operand 217 states and 315 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:34,133 INFO L93 Difference]: Finished difference Result 445 states and 647 transitions. [2025-02-06 03:46:34,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:34,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-02-06 03:46:34,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:34,135 INFO L225 Difference]: With dead ends: 445 [2025-02-06 03:46:34,136 INFO L226 Difference]: Without dead ends: 231 [2025-02-06 03:46:34,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:34,141 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:34,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 724 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:34,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-06 03:46:34,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2025-02-06 03:46:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 191 states have (on average 1.356020942408377) internal successors, (259), 191 states have internal predecessors, (259), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:46:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 327 transitions. [2025-02-06 03:46:34,163 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 327 transitions. Word has length 141 [2025-02-06 03:46:34,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:34,167 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 327 transitions. [2025-02-06 03:46:34,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 327 transitions. [2025-02-06 03:46:34,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:46:34,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:34,168 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:34,179 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:46:34,373 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:46:34,374 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:34,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:34,375 INFO L85 PathProgramCache]: Analyzing trace with hash 357696716, now seen corresponding path program 1 times [2025-02-06 03:46:34,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:34,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3901716] [2025-02-06 03:46:34,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:34,375 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:46:34,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:34,377 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:46:34,379 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:46:34,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:46:34,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:46:34,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:34,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:34,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:46:34,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:34,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:34,617 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:34,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3901716] [2025-02-06 03:46:34,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3901716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:34,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:34,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:46:34,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023865974] [2025-02-06 03:46:34,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:34,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:46:34,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:34,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:46:34,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:46:34,618 INFO L87 Difference]: Start difference. First operand 229 states and 327 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:34,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:34,674 INFO L93 Difference]: Finished difference Result 461 states and 659 transitions. [2025-02-06 03:46:34,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:46:34,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-02-06 03:46:34,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:34,678 INFO L225 Difference]: With dead ends: 461 [2025-02-06 03:46:34,678 INFO L226 Difference]: Without dead ends: 235 [2025-02-06 03:46:34,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:46:34,679 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:34,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 857 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:34,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-06 03:46:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2025-02-06 03:46:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 195 states have (on average 1.3487179487179488) internal successors, (263), 195 states have internal predecessors, (263), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:46:34,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 331 transitions. [2025-02-06 03:46:34,701 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 331 transitions. Word has length 141 [2025-02-06 03:46:34,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:34,701 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 331 transitions. [2025-02-06 03:46:34,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 331 transitions. [2025-02-06 03:46:34,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:46:34,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:34,702 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:34,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 (6)] Ended with exit code 0 [2025-02-06 03:46:34,902 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:46:34,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:34,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:34,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1245200397, now seen corresponding path program 1 times [2025-02-06 03:46:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:34,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274083096] [2025-02-06 03:46:34,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:34,903 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:46:34,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:34,908 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:46:34,909 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:46:35,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:46:35,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:46:35,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:35,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:35,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 03:46:35,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:35,183 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:35,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:35,183 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:35,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274083096] [2025-02-06 03:46:35,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274083096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:35,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:35,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:46:35,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619909222] [2025-02-06 03:46:35,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:35,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:46:35,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:35,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:46:35,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:35,188 INFO L87 Difference]: Start difference. First operand 233 states and 331 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:35,273 INFO L93 Difference]: Finished difference Result 469 states and 667 transitions. [2025-02-06 03:46:35,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:46:35,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-02-06 03:46:35,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:35,276 INFO L225 Difference]: With dead ends: 469 [2025-02-06 03:46:35,276 INFO L226 Difference]: Without dead ends: 239 [2025-02-06 03:46:35,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:35,277 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:35,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 992 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:35,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-02-06 03:46:35,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2025-02-06 03:46:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 199 states have (on average 1.3417085427135678) internal successors, (267), 199 states have internal predecessors, (267), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:46:35,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 335 transitions. [2025-02-06 03:46:35,295 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 335 transitions. Word has length 141 [2025-02-06 03:46:35,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:35,295 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 335 transitions. [2025-02-06 03:46:35,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:35,295 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 335 transitions. [2025-02-06 03:46:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:46:35,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:35,296 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:35,306 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 (7)] Forceful destruction successful, exit code 0 [2025-02-06 03:46:35,500 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:46:35,500 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:35,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:35,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1246123918, now seen corresponding path program 1 times [2025-02-06 03:46:35,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:35,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790847238] [2025-02-06 03:46:35,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:35,501 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:46:35,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:35,503 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:46:35,504 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:46:35,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:46:35,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:46:35,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:35,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:35,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 03:46:35,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:35,921 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 17 treesize of output 13 [2025-02-06 03:46:35,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 49 treesize of output 37 [2025-02-06 03:46:36,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 67 treesize of output 51 [2025-02-06 03:46:36,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 60 treesize of output 40 [2025-02-06 03:46:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:36,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:36,082 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:36,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790847238] [2025-02-06 03:46:36,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790847238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:36,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:36,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:46:36,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701902838] [2025-02-06 03:46:36,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:36,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:46:36,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:36,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:46:36,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:36,083 INFO L87 Difference]: Start difference. First operand 237 states and 335 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:36,517 INFO L93 Difference]: Finished difference Result 557 states and 780 transitions. [2025-02-06 03:46:36,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:46:36,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-02-06 03:46:36,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:36,519 INFO L225 Difference]: With dead ends: 557 [2025-02-06 03:46:36,519 INFO L226 Difference]: Without dead ends: 323 [2025-02-06 03:46:36,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:46:36,520 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 369 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:36,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 986 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:46:36,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-02-06 03:46:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 253. [2025-02-06 03:46:36,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 210 states have (on average 1.3238095238095238) internal successors, (278), 211 states have internal predecessors, (278), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 03:46:36,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 354 transitions. [2025-02-06 03:46:36,535 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 354 transitions. Word has length 141 [2025-02-06 03:46:36,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:36,535 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 354 transitions. [2025-02-06 03:46:36,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:36,535 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 354 transitions. [2025-02-06 03:46:36,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:46:36,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:36,536 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:36,542 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:46:36,740 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:46:36,740 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:36,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:36,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1162731475, now seen corresponding path program 1 times [2025-02-06 03:46:36,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:36,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294948069] [2025-02-06 03:46:36,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:36,741 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:46:36,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:36,743 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:46:36,744 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:46:36,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:46:36,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:46:36,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:36,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:36,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:46:36,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:36,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2025-02-06 03:46:37,097 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:37,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:37,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:37,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294948069] [2025-02-06 03:46:37,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294948069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:37,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:37,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:46:37,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597898325] [2025-02-06 03:46:37,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:37,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:37,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:37,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:37,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:37,098 INFO L87 Difference]: Start difference. First operand 253 states and 354 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:37,204 INFO L93 Difference]: Finished difference Result 668 states and 934 transitions. [2025-02-06 03:46:37,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:37,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-02-06 03:46:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:37,206 INFO L225 Difference]: With dead ends: 668 [2025-02-06 03:46:37,206 INFO L226 Difference]: Without dead ends: 427 [2025-02-06 03:46:37,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:46:37,207 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 145 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:37,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 598 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:37,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-02-06 03:46:37,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 295. [2025-02-06 03:46:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 237 states have (on average 1.2995780590717299) internal successors, (308), 237 states have internal predecessors, (308), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-06 03:46:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 410 transitions. [2025-02-06 03:46:37,219 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 410 transitions. Word has length 141 [2025-02-06 03:46:37,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:37,220 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 410 transitions. [2025-02-06 03:46:37,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 410 transitions. [2025-02-06 03:46:37,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:46:37,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:37,221 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:37,228 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:46:37,421 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:46:37,421 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:37,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:37,422 INFO L85 PathProgramCache]: Analyzing trace with hash -628982968, now seen corresponding path program 1 times [2025-02-06 03:46:37,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:37,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032271618] [2025-02-06 03:46:37,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:37,422 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:46:37,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:37,424 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:46:37,426 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:46:37,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:46:37,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:46:37,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:37,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:37,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:46:37,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:37,663 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:37,663 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:37,663 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:37,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032271618] [2025-02-06 03:46:37,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032271618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:37,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:37,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:37,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520728578] [2025-02-06 03:46:37,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:37,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:37,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:37,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:37,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:37,664 INFO L87 Difference]: Start difference. First operand 295 states and 410 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:37,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:37,690 INFO L93 Difference]: Finished difference Result 542 states and 756 transitions. [2025-02-06 03:46:37,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:37,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-02-06 03:46:37,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:37,691 INFO L225 Difference]: With dead ends: 542 [2025-02-06 03:46:37,691 INFO L226 Difference]: Without dead ends: 301 [2025-02-06 03:46:37,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 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:46:37,692 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 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:46:37,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-02-06 03:46:37,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2025-02-06 03:46:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 243 states have (on average 1.2921810699588476) internal successors, (314), 243 states have internal predecessors, (314), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-06 03:46:37,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 416 transitions. [2025-02-06 03:46:37,717 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 416 transitions. Word has length 143 [2025-02-06 03:46:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:37,717 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 416 transitions. [2025-02-06 03:46:37,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:37,717 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 416 transitions. [2025-02-06 03:46:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:46:37,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:37,718 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:37,725 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:46:37,918 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:46:37,918 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:37,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:37,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1480464939, now seen corresponding path program 1 times [2025-02-06 03:46:37,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:37,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405222912] [2025-02-06 03:46:37,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:37,919 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:46:37,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:37,921 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:46:37,922 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:46:38,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:46:38,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:46:38,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:38,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:38,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:46:38,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:46:38,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:46:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:38,504 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:38,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405222912] [2025-02-06 03:46:38,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405222912] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:38,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:46:38,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-02-06 03:46:38,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220093428] [2025-02-06 03:46:38,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:38,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:38,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:38,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:38,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:46:38,505 INFO L87 Difference]: Start difference. First operand 301 states and 416 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:38,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:38,576 INFO L93 Difference]: Finished difference Result 687 states and 952 transitions. [2025-02-06 03:46:38,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:38,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-02-06 03:46:38,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:38,580 INFO L225 Difference]: With dead ends: 687 [2025-02-06 03:46:38,580 INFO L226 Difference]: Without dead ends: 440 [2025-02-06 03:46:38,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:46:38,581 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 74 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:38,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 691 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:38,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-02-06 03:46:38,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 336. [2025-02-06 03:46:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 278 states have (on average 1.3129496402877698) internal successors, (365), 278 states have internal predecessors, (365), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-06 03:46:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 467 transitions. [2025-02-06 03:46:38,599 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 467 transitions. Word has length 143 [2025-02-06 03:46:38,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:38,600 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 467 transitions. [2025-02-06 03:46:38,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 467 transitions. [2025-02-06 03:46:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:46:38,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:38,601 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:38,609 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:46:38,808 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:46:38,808 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:38,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:38,809 INFO L85 PathProgramCache]: Analyzing trace with hash 483392586, now seen corresponding path program 1 times [2025-02-06 03:46:38,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:38,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195396034] [2025-02-06 03:46:38,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:38,810 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:46:38,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:38,812 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:46:38,813 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:46:38,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:46:39,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:46:39,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:39,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:39,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:46:39,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:39,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2025-02-06 03:46:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:39,182 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:39,183 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:39,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195396034] [2025-02-06 03:46:39,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195396034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:39,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:39,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:46:39,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184703919] [2025-02-06 03:46:39,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:39,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:39,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:39,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:39,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:39,184 INFO L87 Difference]: Start difference. First operand 336 states and 467 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:39,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:39,282 INFO L93 Difference]: Finished difference Result 771 states and 1073 transitions. [2025-02-06 03:46:39,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:39,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-02-06 03:46:39,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:39,285 INFO L225 Difference]: With dead ends: 771 [2025-02-06 03:46:39,285 INFO L226 Difference]: Without dead ends: 489 [2025-02-06 03:46:39,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:46:39,287 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 130 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:39,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 595 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:39,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-02-06 03:46:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 386. [2025-02-06 03:46:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 328 states have (on average 1.329268292682927) internal successors, (436), 328 states have internal predecessors, (436), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-06 03:46:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 538 transitions. [2025-02-06 03:46:39,302 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 538 transitions. Word has length 143 [2025-02-06 03:46:39,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:39,303 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 538 transitions. [2025-02-06 03:46:39,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 538 transitions. [2025-02-06 03:46:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:46:39,304 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:39,304 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:39,312 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:46:39,509 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:46:39,509 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:39,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:39,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1831036837, now seen corresponding path program 1 times [2025-02-06 03:46:39,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:39,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528879045] [2025-02-06 03:46:39,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:39,510 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:46:39,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:39,512 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:46:39,513 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:46:39,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:46:39,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:46:39,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:39,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:39,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:46:39,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:46:40,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:46:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:40,083 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:40,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528879045] [2025-02-06 03:46:40,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528879045] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:40,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:46:40,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-02-06 03:46:40,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539029835] [2025-02-06 03:46:40,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:40,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:40,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:40,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:40,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:46:40,084 INFO L87 Difference]: Start difference. First operand 386 states and 538 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:40,144 INFO L93 Difference]: Finished difference Result 791 states and 1101 transitions. [2025-02-06 03:46:40,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:40,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2025-02-06 03:46:40,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:40,146 INFO L225 Difference]: With dead ends: 791 [2025-02-06 03:46:40,146 INFO L226 Difference]: Without dead ends: 509 [2025-02-06 03:46:40,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:46:40,147 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 63 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:40,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 583 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:40,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-02-06 03:46:40,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 415. [2025-02-06 03:46:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 357 states have (on average 1.3389355742296918) internal successors, (478), 357 states have internal predecessors, (478), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-06 03:46:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 580 transitions. [2025-02-06 03:46:40,159 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 580 transitions. Word has length 144 [2025-02-06 03:46:40,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:40,159 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 580 transitions. [2025-02-06 03:46:40,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:40,160 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 580 transitions. [2025-02-06 03:46:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:46:40,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:40,161 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:40,170 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:46:40,361 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:46:40,361 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:40,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:40,362 INFO L85 PathProgramCache]: Analyzing trace with hash -211232534, now seen corresponding path program 1 times [2025-02-06 03:46:40,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:40,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529133601] [2025-02-06 03:46:40,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:40,362 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:46:40,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:40,365 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:46:40,366 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:46:40,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:46:40,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:46:40,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:40,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:40,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:46:40,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:46:40,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:46:40,945 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:40,945 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:40,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529133601] [2025-02-06 03:46:40,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529133601] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:40,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:46:40,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-02-06 03:46:40,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075683329] [2025-02-06 03:46:40,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:40,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:40,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:40,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:40,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:46:40,946 INFO L87 Difference]: Start difference. First operand 415 states and 580 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:41,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:41,030 INFO L93 Difference]: Finished difference Result 808 states and 1123 transitions. [2025-02-06 03:46:41,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:41,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2025-02-06 03:46:41,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:41,032 INFO L225 Difference]: With dead ends: 808 [2025-02-06 03:46:41,033 INFO L226 Difference]: Without dead ends: 497 [2025-02-06 03:46:41,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:46:41,034 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 112 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:41,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 441 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:41,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-02-06 03:46:41,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 423. [2025-02-06 03:46:41,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 365 states have (on average 1.3342465753424657) internal successors, (487), 365 states have internal predecessors, (487), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-06 03:46:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 589 transitions. [2025-02-06 03:46:41,050 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 589 transitions. Word has length 145 [2025-02-06 03:46:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:41,052 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 589 transitions. [2025-02-06 03:46:41,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 589 transitions. [2025-02-06 03:46:41,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 03:46:41,053 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:41,053 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:41,066 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:46:41,253 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:46:41,253 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:41,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:41,254 INFO L85 PathProgramCache]: Analyzing trace with hash -885429519, now seen corresponding path program 1 times [2025-02-06 03:46:41,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:41,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301713901] [2025-02-06 03:46:41,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:41,254 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:46:41,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:41,259 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:46:41,261 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:46:41,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 03:46:41,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 03:46:41,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:41,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:41,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 03:46:41,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:42,492 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 22 treesize of output 18 [2025-02-06 03:46:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 19 proven. 386 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-02-06 03:46:42,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:46:42,944 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:42,944 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:42,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301713901] [2025-02-06 03:46:42,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301713901] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:42,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:46:42,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [20] total 23 [2025-02-06 03:46:42,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473151034] [2025-02-06 03:46:42,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:42,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:46:42,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:42,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:46:42,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:46:42,946 INFO L87 Difference]: Start difference. First operand 423 states and 589 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:43,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:43,140 INFO L93 Difference]: Finished difference Result 926 states and 1276 transitions. [2025-02-06 03:46:43,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:43,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-02-06 03:46:43,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:43,143 INFO L225 Difference]: With dead ends: 926 [2025-02-06 03:46:43,143 INFO L226 Difference]: Without dead ends: 607 [2025-02-06 03:46:43,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2025-02-06 03:46:43,144 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 78 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:43,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 835 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:43,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-02-06 03:46:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2025-02-06 03:46:43,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 526 states have (on average 1.3136882129277567) internal successors, (691), 528 states have internal predecessors, (691), 67 states have call successors, (67), 9 states have call predecessors, (67), 9 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 03:46:43,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 825 transitions. [2025-02-06 03:46:43,161 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 825 transitions. Word has length 146 [2025-02-06 03:46:43,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:43,162 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 825 transitions. [2025-02-06 03:46:43,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:43,162 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 825 transitions. [2025-02-06 03:46:43,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 03:46:43,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:43,163 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:43,169 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 (15)] Forceful destruction successful, exit code 0 [2025-02-06 03:46:43,367 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:46:43,367 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:43,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:43,367 INFO L85 PathProgramCache]: Analyzing trace with hash 100463774, now seen corresponding path program 1 times [2025-02-06 03:46:43,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:43,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791759678] [2025-02-06 03:46:43,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:43,368 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:46:43,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:43,374 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:46:43,381 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:46:43,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 03:46:43,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 03:46:43,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:43,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:43,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 03:46:43,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:43,898 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 17 treesize of output 13 [2025-02-06 03:46:43,945 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 15 [2025-02-06 03:46:43,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 16 [2025-02-06 03:46:43,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2025-02-06 03:46:44,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 54 treesize of output 42 [2025-02-06 03:46:44,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 58 treesize of output 38 [2025-02-06 03:46:44,103 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 5 proven. 279 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-02-06 03:46:44,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:46:44,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 35 treesize of output 23 [2025-02-06 03:46:44,358 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:44,358 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:44,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791759678] [2025-02-06 03:46:44,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791759678] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:44,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:46:44,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 22 [2025-02-06 03:46:44,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264522041] [2025-02-06 03:46:44,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:44,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:46:44,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:44,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:46:44,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:46:44,361 INFO L87 Difference]: Start difference. First operand 603 states and 825 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:44,646 INFO L93 Difference]: Finished difference Result 1100 states and 1502 transitions. [2025-02-06 03:46:44,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:46:44,647 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-02-06 03:46:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:44,650 INFO L225 Difference]: With dead ends: 1100 [2025-02-06 03:46:44,650 INFO L226 Difference]: Without dead ends: 607 [2025-02-06 03:46:44,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2025-02-06 03:46:44,652 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 185 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:44,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 839 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:46:44,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-02-06 03:46:44,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2025-02-06 03:46:44,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 523 states have (on average 1.3040152963671128) internal successors, (682), 525 states have internal predecessors, (682), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 03:46:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 816 transitions. [2025-02-06 03:46:44,669 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 816 transitions. Word has length 146 [2025-02-06 03:46:44,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:44,670 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 816 transitions. [2025-02-06 03:46:44,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:44,670 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 816 transitions. [2025-02-06 03:46:44,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:46:44,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:44,671 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:44,677 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 (16)] Forceful destruction successful, exit code 0 [2025-02-06 03:46:44,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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:46:44,875 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:44,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:44,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1277250899, now seen corresponding path program 1 times [2025-02-06 03:46:44,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:44,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476186993] [2025-02-06 03:46:44,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:44,876 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:46:44,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:44,878 INFO L229 MonitoredProcess]: Starting monitored process 17 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:46:44,879 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 (17)] Waiting until timeout for monitored process [2025-02-06 03:46:45,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:46:45,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:46:45,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:45,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:45,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 03:46:45,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:45,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:45,135 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:45,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476186993] [2025-02-06 03:46:45,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476186993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:45,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:45,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:46:45,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668016092] [2025-02-06 03:46:45,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:45,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:46:45,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:45,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:46:45,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:46:45,136 INFO L87 Difference]: Start difference. First operand 603 states and 816 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:45,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:45,157 INFO L93 Difference]: Finished difference Result 1096 states and 1488 transitions. [2025-02-06 03:46:45,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:46:45,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-02-06 03:46:45,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:45,160 INFO L225 Difference]: With dead ends: 1096 [2025-02-06 03:46:45,160 INFO L226 Difference]: Without dead ends: 607 [2025-02-06 03:46:45,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:46:45,162 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:45,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:45,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-02-06 03:46:45,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2025-02-06 03:46:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 527 states have (on average 1.301707779886148) internal successors, (686), 529 states have internal predecessors, (686), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 03:46:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 820 transitions. [2025-02-06 03:46:45,179 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 820 transitions. Word has length 148 [2025-02-06 03:46:45,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:45,179 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 820 transitions. [2025-02-06 03:46:45,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 820 transitions. [2025-02-06 03:46:45,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:46:45,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:45,181 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:45,190 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 (17)] Ended with exit code 0 [2025-02-06 03:46:45,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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:46:45,381 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:45,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:45,383 INFO L85 PathProgramCache]: Analyzing trace with hash -131523896, now seen corresponding path program 1 times [2025-02-06 03:46:45,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:45,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215568199] [2025-02-06 03:46:45,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:45,383 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:46:45,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:45,385 INFO L229 MonitoredProcess]: Starting monitored process 18 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:46:45,387 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 (18)] Waiting until timeout for monitored process [2025-02-06 03:46:45,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:46:45,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:46:45,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:45,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:45,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:46:45,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:46,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2025-02-06 03:46:46,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2025-02-06 03:46:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 5 proven. 279 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-02-06 03:46:46,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:46:46,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:46:46,454 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 22 treesize of output 25 [2025-02-06 03:46:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:46:47,168 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:47,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215568199] [2025-02-06 03:46:47,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215568199] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:46:47,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:46:47,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-02-06 03:46:47,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481658821] [2025-02-06 03:46:47,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:46:47,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:46:47,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:47,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:46:47,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:46:47,169 INFO L87 Difference]: Start difference. First operand 607 states and 820 transitions. Second operand has 15 states, 13 states have (on average 10.0) internal successors, (130), 14 states have internal predecessors, (130), 6 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2025-02-06 03:46:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:47,912 INFO L93 Difference]: Finished difference Result 1122 states and 1511 transitions. [2025-02-06 03:46:47,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:46:47,915 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 10.0) internal successors, (130), 14 states have internal predecessors, (130), 6 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) Word has length 148 [2025-02-06 03:46:47,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:47,917 INFO L225 Difference]: With dead ends: 1122 [2025-02-06 03:46:47,917 INFO L226 Difference]: Without dead ends: 629 [2025-02-06 03:46:47,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:46:47,932 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 323 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:47,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 957 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:46:47,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-02-06 03:46:47,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 607. [2025-02-06 03:46:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 527 states have (on average 1.2979127134724857) internal successors, (684), 529 states have internal predecessors, (684), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 03:46:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 818 transitions. [2025-02-06 03:46:47,952 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 818 transitions. Word has length 148 [2025-02-06 03:46:47,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:47,952 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 818 transitions. [2025-02-06 03:46:47,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 10.0) internal successors, (130), 14 states have internal predecessors, (130), 6 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2025-02-06 03:46:47,953 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 818 transitions. [2025-02-06 03:46:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:46:47,954 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:47,954 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:47,962 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 (18)] Ended with exit code 0 [2025-02-06 03:46:48,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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:46:48,155 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:48,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:48,155 INFO L85 PathProgramCache]: Analyzing trace with hash 408612497, now seen corresponding path program 1 times [2025-02-06 03:46:48,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:48,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125633202] [2025-02-06 03:46:48,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:48,156 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:46:48,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:48,160 INFO L229 MonitoredProcess]: Starting monitored process 19 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:46:48,161 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 (19)] Waiting until timeout for monitored process [2025-02-06 03:46:48,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:46:48,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:46:48,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:48,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:48,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:46:48,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:48,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:48,627 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:48,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125633202] [2025-02-06 03:46:48,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125633202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:48,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:48,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:48,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381207666] [2025-02-06 03:46:48,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:48,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:46:48,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:48,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:46:48,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:48,628 INFO L87 Difference]: Start difference. First operand 607 states and 818 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:48,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:48,919 INFO L93 Difference]: Finished difference Result 1235 states and 1659 transitions. [2025-02-06 03:46:48,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:48,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-02-06 03:46:48,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:48,922 INFO L225 Difference]: With dead ends: 1235 [2025-02-06 03:46:48,922 INFO L226 Difference]: Without dead ends: 742 [2025-02-06 03:46:48,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:46:48,923 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 195 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:48,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 748 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:46:48,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-02-06 03:46:48,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 727. [2025-02-06 03:46:48,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 626 states have (on average 1.2827476038338659) internal successors, (803), 629 states have internal predecessors, (803), 84 states have call successors, (84), 16 states have call predecessors, (84), 16 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 03:46:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 971 transitions. [2025-02-06 03:46:48,967 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 971 transitions. Word has length 150 [2025-02-06 03:46:48,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:48,967 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 971 transitions. [2025-02-06 03:46:48,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:48,967 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 971 transitions. [2025-02-06 03:46:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:46:48,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:48,968 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:48,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 (19)] Ended with exit code 0 [2025-02-06 03:46:49,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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:46:49,168 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:49,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:49,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2073318225, now seen corresponding path program 1 times [2025-02-06 03:46:49,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:49,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176097297] [2025-02-06 03:46:49,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:49,169 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:46:49,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:49,171 INFO L229 MonitoredProcess]: Starting monitored process 20 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:46:49,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 (20)] Waiting until timeout for monitored process [2025-02-06 03:46:49,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:46:49,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:46:49,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:49,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:49,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:46:49,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:49,618 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:49,618 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:49,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176097297] [2025-02-06 03:46:49,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176097297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:49,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:49,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:49,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29491371] [2025-02-06 03:46:49,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:49,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:46:49,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:49,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:46:49,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:49,619 INFO L87 Difference]: Start difference. First operand 727 states and 971 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:49,906 INFO L93 Difference]: Finished difference Result 1343 states and 1794 transitions. [2025-02-06 03:46:49,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:46:49,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-02-06 03:46:49,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:49,909 INFO L225 Difference]: With dead ends: 1343 [2025-02-06 03:46:49,909 INFO L226 Difference]: Without dead ends: 734 [2025-02-06 03:46:49,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:49,910 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 229 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:49,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 772 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:46:49,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-02-06 03:46:49,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 719. [2025-02-06 03:46:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 618 states have (on average 1.27831715210356) internal successors, (790), 621 states have internal predecessors, (790), 84 states have call successors, (84), 16 states have call predecessors, (84), 16 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 03:46:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 958 transitions. [2025-02-06 03:46:49,951 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 958 transitions. Word has length 150 [2025-02-06 03:46:49,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:49,951 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 958 transitions. [2025-02-06 03:46:49,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 958 transitions. [2025-02-06 03:46:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:46:49,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:49,953 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:49,959 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 (20)] Ended with exit code 0 [2025-02-06 03:46:50,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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:46:50,153 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:50,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:50,154 INFO L85 PathProgramCache]: Analyzing trace with hash -790609334, now seen corresponding path program 1 times [2025-02-06 03:46:50,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:50,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806740700] [2025-02-06 03:46:50,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:50,154 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:46:50,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:50,156 INFO L229 MonitoredProcess]: Starting monitored process 21 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:46:50,157 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 (21)] Waiting until timeout for monitored process [2025-02-06 03:46:50,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:46:50,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:46:50,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:50,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:50,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 03:46:50,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:50,711 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 17 treesize of output 13 [2025-02-06 03:46:50,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 51 treesize of output 39 [2025-02-06 03:46:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:46:50,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:46:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:50,865 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:50,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806740700] [2025-02-06 03:46:50,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806740700] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:50,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:46:50,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2025-02-06 03:46:50,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610238892] [2025-02-06 03:46:50,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:50,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:46:50,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:50,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:46:50,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:46:50,868 INFO L87 Difference]: Start difference. First operand 719 states and 958 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:50,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:50,958 INFO L93 Difference]: Finished difference Result 748 states and 988 transitions. [2025-02-06 03:46:50,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:50,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-02-06 03:46:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:50,961 INFO L225 Difference]: With dead ends: 748 [2025-02-06 03:46:50,961 INFO L226 Difference]: Without dead ends: 746 [2025-02-06 03:46:50,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:46:50,962 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 101 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:50,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 906 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:50,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-02-06 03:46:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 738. [2025-02-06 03:46:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 637 states have (on average 1.2700156985871272) internal successors, (809), 640 states have internal predecessors, (809), 82 states have call successors, (82), 18 states have call predecessors, (82), 18 states have return successors, (82), 79 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 03:46:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 973 transitions. [2025-02-06 03:46:50,984 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 973 transitions. Word has length 150 [2025-02-06 03:46:50,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:50,985 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 973 transitions. [2025-02-06 03:46:50,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 973 transitions. [2025-02-06 03:46:50,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:46:50,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:50,986 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:50,996 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 (21)] Ended with exit code 0 [2025-02-06 03:46:51,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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:46:51,187 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:51,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:51,187 INFO L85 PathProgramCache]: Analyzing trace with hash -789685813, now seen corresponding path program 1 times [2025-02-06 03:46:51,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:51,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631539911] [2025-02-06 03:46:51,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:51,187 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:46:51,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:51,189 INFO L229 MonitoredProcess]: Starting monitored process 22 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:46:51,191 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 (22)] Waiting until timeout for monitored process [2025-02-06 03:46:51,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:46:51,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:46:51,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:51,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:51,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 03:46:51,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:52,117 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 15 treesize of output 1 [2025-02-06 03:46:52,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 125 treesize of output 89 [2025-02-06 03:46:52,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 137 treesize of output 77 [2025-02-06 03:46:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-02-06 03:46:52,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:46:52,551 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:52,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631539911] [2025-02-06 03:46:52,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631539911] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:52,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [182829125] [2025-02-06 03:46:52,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:52,551 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:46:52,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:46:52,573 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:46:52,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2025-02-06 03:46:52,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:46:53,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:46:53,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:53,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:53,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 03:46:53,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:53,990 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 15 treesize of output 1 [2025-02-06 03:46:54,418 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 15 treesize of output 1 [2025-02-06 03:46:54,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 125 treesize of output 89 [2025-02-06 03:46:54,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 137 treesize of output 77 [2025-02-06 03:46:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-02-06 03:46:54,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:46:54,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [182829125] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:54,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:46:54,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-02-06 03:46:54,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840908303] [2025-02-06 03:46:54,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:46:54,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 03:46:54,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:54,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 03:46:54,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:46:54,875 INFO L87 Difference]: Start difference. First operand 738 states and 973 transitions. Second operand has 16 states, 16 states have (on average 8.5) internal successors, (136), 15 states have internal predecessors, (136), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2025-02-06 03:46:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:55,660 INFO L93 Difference]: Finished difference Result 2055 states and 2699 transitions. [2025-02-06 03:46:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:46:55,661 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.5) internal successors, (136), 15 states have internal predecessors, (136), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 150 [2025-02-06 03:46:55,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:55,666 INFO L225 Difference]: With dead ends: 2055 [2025-02-06 03:46:55,666 INFO L226 Difference]: Without dead ends: 1435 [2025-02-06 03:46:55,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2025-02-06 03:46:55,668 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 544 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:55,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1170 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:46:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2025-02-06 03:46:55,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1425. [2025-02-06 03:46:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 1239 states have (on average 1.2671509281678772) internal successors, (1570), 1247 states have internal predecessors, (1570), 149 states have call successors, (149), 36 states have call predecessors, (149), 36 states have return successors, (149), 141 states have call predecessors, (149), 149 states have call successors, (149) [2025-02-06 03:46:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 1868 transitions. [2025-02-06 03:46:55,731 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 1868 transitions. Word has length 150 [2025-02-06 03:46:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:55,731 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 1868 transitions. [2025-02-06 03:46:55,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.5) internal successors, (136), 15 states have internal predecessors, (136), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2025-02-06 03:46:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1868 transitions. [2025-02-06 03:46:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:46:55,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:55,733 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:55,741 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 (22)] Ended with exit code 0 [2025-02-06 03:46:55,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2025-02-06 03:46:56,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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,23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:46:56,141 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:56,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:56,141 INFO L85 PathProgramCache]: Analyzing trace with hash 97817868, now seen corresponding path program 1 times [2025-02-06 03:46:56,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:56,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237643561] [2025-02-06 03:46:56,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:56,142 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:46:56,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:56,144 INFO L229 MonitoredProcess]: Starting monitored process 24 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:46:56,145 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 (24)] Waiting until timeout for monitored process [2025-02-06 03:46:56,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:46:56,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:46:56,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:56,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:56,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:46:56,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:56,432 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 12 treesize of output 8 [2025-02-06 03:46:56,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 34 treesize of output 22 [2025-02-06 03:46:56,468 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:56,468 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:56,468 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:56,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237643561] [2025-02-06 03:46:56,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237643561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:56,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:56,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:56,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793782442] [2025-02-06 03:46:56,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:56,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:56,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:56,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:56,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:56,470 INFO L87 Difference]: Start difference. First operand 1425 states and 1868 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:56,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:56,563 INFO L93 Difference]: Finished difference Result 2658 states and 3482 transitions. [2025-02-06 03:46:56,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:56,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-02-06 03:46:56,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:56,571 INFO L225 Difference]: With dead ends: 2658 [2025-02-06 03:46:56,571 INFO L226 Difference]: Without dead ends: 1425 [2025-02-06 03:46:56,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:46:56,573 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 131 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 780 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:46:56,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 780 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:56,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2025-02-06 03:46:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1425. [2025-02-06 03:46:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 1239 states have (on average 1.2590799031476998) internal successors, (1560), 1247 states have internal predecessors, (1560), 149 states have call successors, (149), 36 states have call predecessors, (149), 36 states have return successors, (149), 141 states have call predecessors, (149), 149 states have call successors, (149) [2025-02-06 03:46:56,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 1858 transitions. [2025-02-06 03:46:56,646 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 1858 transitions. Word has length 150 [2025-02-06 03:46:56,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:56,647 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 1858 transitions. [2025-02-06 03:46:56,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:56,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1858 transitions. [2025-02-06 03:46:56,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:46:56,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:56,649 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:56,655 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 (24)] Forceful destruction successful, exit code 0 [2025-02-06 03:46:56,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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:46:56,849 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:56,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:56,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1709636595, now seen corresponding path program 1 times [2025-02-06 03:46:56,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:56,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238351553] [2025-02-06 03:46:56,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:56,850 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:46:56,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:56,853 INFO L229 MonitoredProcess]: Starting monitored process 25 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:46:56,854 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 (25)] Waiting until timeout for monitored process [2025-02-06 03:46:57,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:46:57,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:46:57,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:57,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:57,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 03:46:57,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:57,251 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 18 treesize of output 14 [2025-02-06 03:46:57,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 14 [2025-02-06 03:46:57,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 [2025-02-06 03:46:57,358 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:57,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:57,358 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:57,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238351553] [2025-02-06 03:46:57,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238351553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:57,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:57,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:46:57,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668176683] [2025-02-06 03:46:57,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:57,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:46:57,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:57,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:46:57,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:46:57,360 INFO L87 Difference]: Start difference. First operand 1425 states and 1858 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:57,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:57,890 INFO L93 Difference]: Finished difference Result 3509 states and 4546 transitions. [2025-02-06 03:46:57,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:46:57,891 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-02-06 03:46:57,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:57,897 INFO L225 Difference]: With dead ends: 3509 [2025-02-06 03:46:57,897 INFO L226 Difference]: Without dead ends: 2276 [2025-02-06 03:46:57,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:46:57,899 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 219 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:57,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1632 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:46:57,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2025-02-06 03:46:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 1801. [2025-02-06 03:46:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1615 states have (on average 1.2705882352941176) internal successors, (2052), 1623 states have internal predecessors, (2052), 149 states have call successors, (149), 36 states have call predecessors, (149), 36 states have return successors, (149), 141 states have call predecessors, (149), 149 states have call successors, (149) [2025-02-06 03:46:57,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2350 transitions. [2025-02-06 03:46:57,994 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2350 transitions. Word has length 150 [2025-02-06 03:46:57,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:57,994 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 2350 transitions. [2025-02-06 03:46:57,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:57,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2350 transitions. [2025-02-06 03:46:57,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:46:57,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:57,996 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:58,004 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 (25)] Ended with exit code 0 [2025-02-06 03:46:58,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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:46:58,196 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:58,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:58,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2003039602, now seen corresponding path program 1 times [2025-02-06 03:46:58,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:58,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567899040] [2025-02-06 03:46:58,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:58,198 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:46:58,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:58,200 INFO L229 MonitoredProcess]: Starting monitored process 26 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:46:58,202 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 (26)] Waiting until timeout for monitored process [2025-02-06 03:46:58,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:46:58,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:46:58,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:58,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:58,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:46:58,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:58,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2025-02-06 03:46:58,618 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:58,618 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:58,618 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:58,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567899040] [2025-02-06 03:46:58,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567899040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:58,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:58,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:46:58,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259516265] [2025-02-06 03:46:58,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:58,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:46:58,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:58,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:46:58,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:46:58,620 INFO L87 Difference]: Start difference. First operand 1801 states and 2350 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:58,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:58,731 INFO L93 Difference]: Finished difference Result 3360 states and 4383 transitions. [2025-02-06 03:46:58,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:46:58,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-02-06 03:46:58,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:58,737 INFO L225 Difference]: With dead ends: 3360 [2025-02-06 03:46:58,737 INFO L226 Difference]: Without dead ends: 1811 [2025-02-06 03:46:58,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:58,740 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 63 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:58,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 436 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:58,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2025-02-06 03:46:58,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1801. [2025-02-06 03:46:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1615 states have (on average 1.263157894736842) internal successors, (2040), 1623 states have internal predecessors, (2040), 149 states have call successors, (149), 36 states have call predecessors, (149), 36 states have return successors, (149), 141 states have call predecessors, (149), 149 states have call successors, (149) [2025-02-06 03:46:58,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2338 transitions. [2025-02-06 03:46:58,876 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2338 transitions. Word has length 150 [2025-02-06 03:46:58,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:58,876 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 2338 transitions. [2025-02-06 03:46:58,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2338 transitions. [2025-02-06 03:46:58,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:46:58,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:58,878 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:58,887 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 (26)] Ended with exit code 0 [2025-02-06 03:46:59,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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:46:59,082 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:59,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:59,083 INFO L85 PathProgramCache]: Analyzing trace with hash 401653774, now seen corresponding path program 1 times [2025-02-06 03:46:59,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:59,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113126278] [2025-02-06 03:46:59,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:59,083 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:46:59,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:59,085 INFO L229 MonitoredProcess]: Starting monitored process 27 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:46:59,090 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 (27)] Waiting until timeout for monitored process [2025-02-06 03:46:59,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:46:59,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:46:59,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:59,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:59,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:46:59,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:59,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2025-02-06 03:46:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:46:59,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:59,502 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:46:59,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113126278] [2025-02-06 03:46:59,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113126278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:59,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:59,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:46:59,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927167572] [2025-02-06 03:46:59,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:59,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:46:59,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:46:59,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:46:59,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:46:59,503 INFO L87 Difference]: Start difference. First operand 1801 states and 2338 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:59,610 INFO L93 Difference]: Finished difference Result 3056 states and 3955 transitions. [2025-02-06 03:46:59,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:46:59,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-02-06 03:46:59,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:59,617 INFO L225 Difference]: With dead ends: 3056 [2025-02-06 03:46:59,617 INFO L226 Difference]: Without dead ends: 1447 [2025-02-06 03:46:59,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:59,620 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 82 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:59,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 448 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2025-02-06 03:46:59,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1437. [2025-02-06 03:46:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1251 states have (on average 1.2390087929656275) internal successors, (1550), 1259 states have internal predecessors, (1550), 149 states have call successors, (149), 36 states have call predecessors, (149), 36 states have return successors, (149), 141 states have call predecessors, (149), 149 states have call successors, (149) [2025-02-06 03:46:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1848 transitions. [2025-02-06 03:46:59,710 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1848 transitions. Word has length 150 [2025-02-06 03:46:59,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:59,710 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 1848 transitions. [2025-02-06 03:46:59,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:46:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1848 transitions. [2025-02-06 03:46:59,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:46:59,711 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:59,711 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:59,717 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 (27)] Ended with exit code 0 [2025-02-06 03:46:59,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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:46:59,916 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:59,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:59,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1989513734, now seen corresponding path program 1 times [2025-02-06 03:46:59,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:46:59,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026320140] [2025-02-06 03:46:59,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:59,916 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:46:59,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:46:59,918 INFO L229 MonitoredProcess]: Starting monitored process 28 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:46:59,919 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 (28)] Waiting until timeout for monitored process [2025-02-06 03:47:00,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:47:00,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:47:00,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:47:00,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:47:00,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 03:47:00,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:47:00,183 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 17 treesize of output 13 [2025-02-06 03:47:00,203 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 15 [2025-02-06 03:47:00,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 54 treesize of output 42 [2025-02-06 03:47:00,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 16 [2025-02-06 03:47:00,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 14 [2025-02-06 03:47:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:47:00,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:47:00,372 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:47:00,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026320140] [2025-02-06 03:47:00,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026320140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:47:00,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:47:00,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:47:00,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016713155] [2025-02-06 03:47:00,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:47:00,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:47:00,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:47:00,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:47:00,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:47:00,375 INFO L87 Difference]: Start difference. First operand 1437 states and 1848 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:47:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:47:01,200 INFO L93 Difference]: Finished difference Result 2355 states and 3057 transitions. [2025-02-06 03:47:01,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 03:47:01,200 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-02-06 03:47:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:47:01,206 INFO L225 Difference]: With dead ends: 2355 [2025-02-06 03:47:01,206 INFO L226 Difference]: Without dead ends: 1833 [2025-02-06 03:47:01,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:47:01,207 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 203 mSDsluCounter, 1644 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:47:01,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1846 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:47:01,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2025-02-06 03:47:01,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1577. [2025-02-06 03:47:01,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1391 states have (on average 1.2609633357296908) internal successors, (1754), 1399 states have internal predecessors, (1754), 149 states have call successors, (149), 36 states have call predecessors, (149), 36 states have return successors, (149), 141 states have call predecessors, (149), 149 states have call successors, (149) [2025-02-06 03:47:01,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2052 transitions. [2025-02-06 03:47:01,273 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2052 transitions. Word has length 150 [2025-02-06 03:47:01,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:47:01,273 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2052 transitions. [2025-02-06 03:47:01,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:47:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2052 transitions. [2025-02-06 03:47:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:47:01,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:47:01,274 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:01,283 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 (28)] Ended with exit code 0 [2025-02-06 03:47:01,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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:47:01,476 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:47:01,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:47:01,476 INFO L85 PathProgramCache]: Analyzing trace with hash -636204037, now seen corresponding path program 1 times [2025-02-06 03:47:01,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:47:01,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720700201] [2025-02-06 03:47:01,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:47:01,477 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:47:01,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:47:01,479 INFO L229 MonitoredProcess]: Starting monitored process 29 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:47:01,479 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 (29)] Waiting until timeout for monitored process [2025-02-06 03:47:01,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:47:01,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:47:01,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:47:01,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:47:01,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 03:47:01,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:47:02,525 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 15 [2025-02-06 03:47:02,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 16 [2025-02-06 03:47:02,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2025-02-06 03:47:02,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 46 treesize of output 30 [2025-02-06 03:47:02,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 12 [2025-02-06 03:47:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 10 proven. 414 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-02-06 03:47:03,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:47:04,636 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:47:04,636 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:47:04,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720700201] [2025-02-06 03:47:04,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720700201] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:47:04,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:47:04,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 25 [2025-02-06 03:47:04,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725742355] [2025-02-06 03:47:04,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:47:04,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:47:04,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:47:04,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:47:04,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2025-02-06 03:47:04,637 INFO L87 Difference]: Start difference. First operand 1577 states and 2052 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:47:05,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:47:05,630 INFO L93 Difference]: Finished difference Result 2781 states and 3632 transitions. [2025-02-06 03:47:05,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:47:05,631 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), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-02-06 03:47:05,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:47:05,637 INFO L225 Difference]: With dead ends: 2781 [2025-02-06 03:47:05,637 INFO L226 Difference]: Without dead ends: 2151 [2025-02-06 03:47:05,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2025-02-06 03:47:05,640 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 336 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:47:05,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1017 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:47:05,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2025-02-06 03:47:05,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 1683. [2025-02-06 03:47:05,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1497 states have (on average 1.2745490981963927) internal successors, (1908), 1505 states have internal predecessors, (1908), 149 states have call successors, (149), 36 states have call predecessors, (149), 36 states have return successors, (149), 141 states have call predecessors, (149), 149 states have call successors, (149) [2025-02-06 03:47:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2206 transitions. [2025-02-06 03:47:05,711 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2206 transitions. Word has length 150 [2025-02-06 03:47:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:47:05,712 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2206 transitions. [2025-02-06 03:47:05,712 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), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:47:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2206 transitions. [2025-02-06 03:47:05,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:47:05,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:47:05,714 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:05,723 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 (29)] Ended with exit code 0 [2025-02-06 03:47:05,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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:47:05,918 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:47:05,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:47:05,919 INFO L85 PathProgramCache]: Analyzing trace with hash 121776635, now seen corresponding path program 1 times [2025-02-06 03:47:05,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:47:05,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686367591] [2025-02-06 03:47:05,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:47:05,919 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:47:05,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:47:05,923 INFO L229 MonitoredProcess]: Starting monitored process 30 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:47:05,924 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 (30)] Waiting until timeout for monitored process [2025-02-06 03:47:06,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:47:06,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:47:06,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:47:06,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:47:06,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 03:47:06,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:47:07,005 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 15 [2025-02-06 03:47:07,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 16 [2025-02-06 03:47:07,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2025-02-06 03:47:07,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 34 treesize of output 22 [2025-02-06 03:47:07,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 34 treesize of output 22 [2025-02-06 03:47:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 10 proven. 414 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-02-06 03:47:08,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:47:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:47:09,183 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:47:09,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686367591] [2025-02-06 03:47:09,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686367591] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:47:09,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:47:09,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 25 [2025-02-06 03:47:09,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781481955] [2025-02-06 03:47:09,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:47:09,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:47:09,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:47:09,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:47:09,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2025-02-06 03:47:09,184 INFO L87 Difference]: Start difference. First operand 1683 states and 2206 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:47:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:47:09,996 INFO L93 Difference]: Finished difference Result 3091 states and 4086 transitions. [2025-02-06 03:47:09,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:47:09,997 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), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-02-06 03:47:09,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:47:10,003 INFO L225 Difference]: With dead ends: 3091 [2025-02-06 03:47:10,003 INFO L226 Difference]: Without dead ends: 2377 [2025-02-06 03:47:10,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2025-02-06 03:47:10,005 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 161 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:47:10,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1201 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:47:10,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2025-02-06 03:47:10,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1797. [2025-02-06 03:47:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1611 states have (on average 1.28739913097455) internal successors, (2074), 1619 states have internal predecessors, (2074), 149 states have call successors, (149), 36 states have call predecessors, (149), 36 states have return successors, (149), 141 states have call predecessors, (149), 149 states have call successors, (149) [2025-02-06 03:47:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2372 transitions. [2025-02-06 03:47:10,112 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2372 transitions. Word has length 150 [2025-02-06 03:47:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:47:10,112 INFO L471 AbstractCegarLoop]: Abstraction has 1797 states and 2372 transitions. [2025-02-06 03:47:10,112 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), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:47:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2372 transitions. [2025-02-06 03:47:10,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:47:10,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:47:10,115 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:10,121 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 (30)] Ended with exit code 0 [2025-02-06 03:47:10,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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:47:10,316 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:47:10,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:47:10,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1475086332, now seen corresponding path program 1 times [2025-02-06 03:47:10,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:47:10,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323436355] [2025-02-06 03:47:10,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:47:10,317 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:47:10,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:47:10,319 INFO L229 MonitoredProcess]: Starting monitored process 31 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:47:10,319 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 (31)] Waiting until timeout for monitored process [2025-02-06 03:47:10,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:47:10,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:47:10,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:47:10,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:47:10,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 03:47:10,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:47:11,058 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 15 [2025-02-06 03:47:11,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2025-02-06 03:47:11,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 21 [2025-02-06 03:47:11,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 35 treesize of output 23 [2025-02-06 03:47:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 5 proven. 399 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-02-06 03:47:11,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:47:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:47:11,588 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:47:11,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323436355] [2025-02-06 03:47:11,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323436355] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:47:11,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:47:11,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 24 [2025-02-06 03:47:11,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894629489] [2025-02-06 03:47:11,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:47:11,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:47:11,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:47:11,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:47:11,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:47:11,589 INFO L87 Difference]: Start difference. First operand 1797 states and 2372 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:47:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:47:12,363 INFO L93 Difference]: Finished difference Result 3255 states and 4297 transitions. [2025-02-06 03:47:12,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 03:47:12,363 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-02-06 03:47:12,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:47:12,370 INFO L225 Difference]: With dead ends: 3255 [2025-02-06 03:47:12,370 INFO L226 Difference]: Without dead ends: 2449 [2025-02-06 03:47:12,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 03:47:12,372 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 281 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:47:12,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1793 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:47:12,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2025-02-06 03:47:12,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 2167. [2025-02-06 03:47:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 1948 states have (on average 1.2838809034907597) internal successors, (2501), 1960 states have internal predecessors, (2501), 173 states have call successors, (173), 45 states have call predecessors, (173), 45 states have return successors, (173), 161 states have call predecessors, (173), 173 states have call successors, (173) [2025-02-06 03:47:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 2847 transitions. [2025-02-06 03:47:12,469 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 2847 transitions. Word has length 150 [2025-02-06 03:47:12,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:47:12,469 INFO L471 AbstractCegarLoop]: Abstraction has 2167 states and 2847 transitions. [2025-02-06 03:47:12,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:47:12,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 2847 transitions. [2025-02-06 03:47:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:47:12,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:47:12,471 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:12,481 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 (31)] Forceful destruction successful, exit code 0 [2025-02-06 03:47:12,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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:47:12,672 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:47:12,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:47:12,673 INFO L85 PathProgramCache]: Analyzing trace with hash -604755206, now seen corresponding path program 1 times [2025-02-06 03:47:12,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:47:12,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800601204] [2025-02-06 03:47:12,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:47:12,673 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:47:12,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:47:12,675 INFO L229 MonitoredProcess]: Starting monitored process 32 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:47:12,677 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 (32)] Waiting until timeout for monitored process [2025-02-06 03:47:12,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:47:12,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:47:12,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:47:12,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:47:12,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:47:12,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:47:13,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 treesize of output 15 [2025-02-06 03:47:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:47:13,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:47:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:47:13,243 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:47:13,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800601204] [2025-02-06 03:47:13,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800601204] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:47:13,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:47:13,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2025-02-06 03:47:13,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249049521] [2025-02-06 03:47:13,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:47:13,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:47:13,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:47:13,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:47:13,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:47:13,245 INFO L87 Difference]: Start difference. First operand 2167 states and 2847 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:47:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:47:13,367 INFO L93 Difference]: Finished difference Result 4512 states and 5896 transitions. [2025-02-06 03:47:13,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:47:13,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-02-06 03:47:13,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:47:13,373 INFO L225 Difference]: With dead ends: 4512 [2025-02-06 03:47:13,374 INFO L226 Difference]: Without dead ends: 2581 [2025-02-06 03:47:13,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:47:13,377 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 81 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:47:13,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 690 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:47:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2581 states. [2025-02-06 03:47:13,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2581 to 2047. [2025-02-06 03:47:13,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2047 states, 1828 states have (on average 1.276258205689278) internal successors, (2333), 1840 states have internal predecessors, (2333), 173 states have call successors, (173), 45 states have call predecessors, (173), 45 states have return successors, (173), 161 states have call predecessors, (173), 173 states have call successors, (173) [2025-02-06 03:47:13,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 2679 transitions. [2025-02-06 03:47:13,475 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 2679 transitions. Word has length 150 [2025-02-06 03:47:13,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:47:13,476 INFO L471 AbstractCegarLoop]: Abstraction has 2047 states and 2679 transitions. [2025-02-06 03:47:13,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:47:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2679 transitions. [2025-02-06 03:47:13,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:47:13,477 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:47:13,477 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:13,485 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 (32)] Forceful destruction successful, exit code 0 [2025-02-06 03:47:13,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /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:47:13,681 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:47:13,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:47:13,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1956382132, now seen corresponding path program 1 times [2025-02-06 03:47:13,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:47:13,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057078426] [2025-02-06 03:47:13,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:47:13,682 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:47:13,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:47:13,685 INFO L229 MonitoredProcess]: Starting monitored process 33 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:47:13,686 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 (33)] Waiting until timeout for monitored process [2025-02-06 03:47:13,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:47:13,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:47:13,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:47:13,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:47:13,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:47:13,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:47:13,957 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-02-06 03:47:13,957 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:47:13,957 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:47:13,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057078426] [2025-02-06 03:47:13,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057078426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:47:13,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:47:13,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:47:13,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782462693] [2025-02-06 03:47:13,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:47:13,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:47:13,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:47:13,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:47:13,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:47:13,959 INFO L87 Difference]: Start difference. First operand 2047 states and 2679 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:47:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:47:14,072 INFO L93 Difference]: Finished difference Result 3950 states and 5169 transitions. [2025-02-06 03:47:14,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:47:14,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2025-02-06 03:47:14,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:47:14,078 INFO L225 Difference]: With dead ends: 3950 [2025-02-06 03:47:14,078 INFO L226 Difference]: Without dead ends: 2047 [2025-02-06 03:47:14,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 147 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:47:14,080 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:47:14,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 451 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:47:14,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2025-02-06 03:47:14,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 2047. [2025-02-06 03:47:14,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2047 states, 1828 states have (on average 1.2740700218818382) internal successors, (2329), 1840 states have internal predecessors, (2329), 173 states have call successors, (173), 45 states have call predecessors, (173), 45 states have return successors, (173), 161 states have call predecessors, (173), 173 states have call successors, (173) [2025-02-06 03:47:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 2675 transitions. [2025-02-06 03:47:14,184 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 2675 transitions. Word has length 150 [2025-02-06 03:47:14,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:47:14,184 INFO L471 AbstractCegarLoop]: Abstraction has 2047 states and 2675 transitions. [2025-02-06 03:47:14,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:47:14,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2675 transitions. [2025-02-06 03:47:14,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:47:14,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:47:14,186 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:14,196 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 (33)] Ended with exit code 0 [2025-02-06 03:47:14,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /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:47:14,387 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:47:14,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:47:14,387 INFO L85 PathProgramCache]: Analyzing trace with hash -954046487, now seen corresponding path program 1 times [2025-02-06 03:47:14,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:47:14,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829061290] [2025-02-06 03:47:14,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:47:14,388 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:47:14,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:47:14,391 INFO L229 MonitoredProcess]: Starting monitored process 34 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:47:14,391 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 (34)] Waiting until timeout for monitored process [2025-02-06 03:47:14,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:47:14,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:47:14,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:47:14,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:47:14,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 03:47:14,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:47:15,293 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 15 treesize of output 1 [2025-02-06 03:47:15,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 125 treesize of output 89 [2025-02-06 03:47:15,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 135 treesize of output 75 [2025-02-06 03:47:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 2 proven. 174 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-02-06 03:47:15,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:47:15,661 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:47:15,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829061290] [2025-02-06 03:47:15,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829061290] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:47:15,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1940671859] [2025-02-06 03:47:15,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:47:15,661 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:47:15,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:47:15,664 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:47:15,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2025-02-06 03:47:15,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:47:16,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:47:16,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:47:16,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:47:16,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 03:47:16,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:47:17,204 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 15 treesize of output 1 [2025-02-06 03:47:18,012 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 15 treesize of output 1 [2025-02-06 03:47:18,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 125 treesize of output 89 [2025-02-06 03:47:18,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 135 treesize of output 75 [2025-02-06 03:47:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 2 proven. 174 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-02-06 03:47:18,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:47:18,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1940671859] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:47:18,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:47:18,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2025-02-06 03:47:18,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328429668] [2025-02-06 03:47:18,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:47:18,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 03:47:18,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:47:18,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 03:47:18,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2025-02-06 03:47:18,529 INFO L87 Difference]: Start difference. First operand 2047 states and 2675 transitions. Second operand has 24 states, 22 states have (on average 6.636363636363637) internal successors, (146), 21 states have internal predecessors, (146), 6 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2025-02-06 03:47:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:47:21,606 INFO L93 Difference]: Finished difference Result 5904 states and 7700 transitions. [2025-02-06 03:47:21,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 03:47:21,607 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 6.636363636363637) internal successors, (146), 21 states have internal predecessors, (146), 6 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) Word has length 152 [2025-02-06 03:47:21,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:47:21,615 INFO L225 Difference]: With dead ends: 5904 [2025-02-06 03:47:21,615 INFO L226 Difference]: Without dead ends: 4093 [2025-02-06 03:47:21,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 361 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=423, Invalid=1833, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 03:47:21,619 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 932 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:47:21,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 1789 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 03:47:21,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2025-02-06 03:47:21,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 2063. [2025-02-06 03:47:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2063 states, 1839 states have (on average 1.272430668841762) internal successors, (2340), 1852 states have internal predecessors, (2340), 176 states have call successors, (176), 47 states have call predecessors, (176), 47 states have return successors, (176), 163 states have call predecessors, (176), 176 states have call successors, (176) [2025-02-06 03:47:21,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 2692 transitions. [2025-02-06 03:47:21,748 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 2692 transitions. Word has length 152 [2025-02-06 03:47:21,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:47:21,749 INFO L471 AbstractCegarLoop]: Abstraction has 2063 states and 2692 transitions. [2025-02-06 03:47:21,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 6.636363636363637) internal successors, (146), 21 states have internal predecessors, (146), 6 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2025-02-06 03:47:21,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 2692 transitions. [2025-02-06 03:47:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:47:21,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:47:21,751 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:21,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 (34)] Ended with exit code 0 [2025-02-06 03:47:21,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2025-02-06 03:47:22,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /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,35 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:47:22,156 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:47:22,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:47:22,156 INFO L85 PathProgramCache]: Analyzing trace with hash -853134520, now seen corresponding path program 1 times [2025-02-06 03:47:22,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:47:22,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240184853] [2025-02-06 03:47:22,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:47:22,157 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:47:22,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:47:22,159 INFO L229 MonitoredProcess]: Starting monitored process 36 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:47:22,160 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 (36)] Waiting until timeout for monitored process [2025-02-06 03:47:22,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:47:22,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:47:22,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:47:22,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:47:22,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:47:22,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:47:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-02-06 03:47:22,473 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:47:22,473 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:47:22,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240184853] [2025-02-06 03:47:22,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240184853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:47:22,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:47:22,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:47:22,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093408297] [2025-02-06 03:47:22,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:47:22,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:47:22,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:47:22,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:47:22,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:47:22,474 INFO L87 Difference]: Start difference. First operand 2063 states and 2692 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-06 03:47:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:47:22,606 INFO L93 Difference]: Finished difference Result 3030 states and 3934 transitions. [2025-02-06 03:47:22,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:47:22,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 152 [2025-02-06 03:47:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:47:22,610 INFO L225 Difference]: With dead ends: 3030 [2025-02-06 03:47:22,610 INFO L226 Difference]: Without dead ends: 1102 [2025-02-06 03:47:22,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 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:47:22,613 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 1 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:47:22,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 634 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:47:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2025-02-06 03:47:22,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1071. [2025-02-06 03:47:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 947 states have (on average 1.2608236536430835) internal successors, (1194), 953 states have internal predecessors, (1194), 96 states have call successors, (96), 27 states have call predecessors, (96), 27 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:47:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1386 transitions. [2025-02-06 03:47:22,669 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1386 transitions. Word has length 152 [2025-02-06 03:47:22,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:47:22,669 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1386 transitions. [2025-02-06 03:47:22,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-06 03:47:22,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1386 transitions. [2025-02-06 03:47:22,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:47:22,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:47:22,670 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:22,680 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 (36)] Ended with exit code 0 [2025-02-06 03:47:22,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /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:47:22,871 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:47:22,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:47:22,871 INFO L85 PathProgramCache]: Analyzing trace with hash 434172943, now seen corresponding path program 1 times [2025-02-06 03:47:22,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:47:22,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578589487] [2025-02-06 03:47:22,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:47:22,871 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:47:22,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:47:22,874 INFO L229 MonitoredProcess]: Starting monitored process 37 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:47:22,875 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 (37)] Waiting until timeout for monitored process