./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-31.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-31.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 08a905a57e2510263318b707c70f3b678c7204182c8cd0b9b57e46d4fa7b9fa2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:38:40,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:38:40,311 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:38:40,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:38:40,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:38:40,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:38:40,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:38:40,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:38:40,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:38:40,342 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:38:40,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:38:40,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:38:40,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:38:40,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:38:40,343 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:38:40,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:38:40,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:38:40,344 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:38:40,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:38:40,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:38:40,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:38:40,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:38:40,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:38:40,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:38:40,344 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:38:40,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:38:40,344 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:38:40,345 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:38:40,345 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:38:40,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:38:40,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:38:40,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:38:40,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:38:40,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:38:40,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:38:40,346 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:38:40,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:38:40,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:38:40,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:38:40,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:38:40,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:38:40,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:38:40,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:38:40,346 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 -> 08a905a57e2510263318b707c70f3b678c7204182c8cd0b9b57e46d4fa7b9fa2 [2025-02-06 03:38:40,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:38:40,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:38:40,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:38:40,573 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:38:40,574 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:38:40,575 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-31.i [2025-02-06 03:38:41,702 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11d9e5985/f58d81303f0d41a3981941e410228542/FLAG1a3a53e37 [2025-02-06 03:38:41,937 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:38:41,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-31.i [2025-02-06 03:38:41,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11d9e5985/f58d81303f0d41a3981941e410228542/FLAG1a3a53e37 [2025-02-06 03:38:41,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11d9e5985/f58d81303f0d41a3981941e410228542 [2025-02-06 03:38:41,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:38:41,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:38:41,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:38:41,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:38:41,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:38:41,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:38:41" (1/1) ... [2025-02-06 03:38:41,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@468b11bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:41, skipping insertion in model container [2025-02-06 03:38:41,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:38:41" (1/1) ... [2025-02-06 03:38:41,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:38:42,089 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-31.i[916,929] [2025-02-06 03:38:42,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:38:42,143 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:38:42,149 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-31.i[916,929] [2025-02-06 03:38:42,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:38:42,182 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:38:42,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:42 WrapperNode [2025-02-06 03:38:42,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:38:42,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:38:42,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:38:42,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:38:42,188 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:38:42" (1/1) ... [2025-02-06 03:38:42,197 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:38:42" (1/1) ... [2025-02-06 03:38:42,233 INFO L138 Inliner]: procedures = 29, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 434 [2025-02-06 03:38:42,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:38:42,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:38:42,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:38:42,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:38:42,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:42" (1/1) ... [2025-02-06 03:38:42,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:42" (1/1) ... [2025-02-06 03:38:42,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:42" (1/1) ... [2025-02-06 03:38:42,258 INFO L175 MemorySlicer]: Split 110 memory accesses to 11 slices as follows [2, 5, 8, 16, 12, 6, 6, 25, 8, 10, 12]. 23 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 2, 1, 4, 1]. [2025-02-06 03:38:42,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:42" (1/1) ... [2025-02-06 03:38:42,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:42" (1/1) ... [2025-02-06 03:38:42,278 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:42" (1/1) ... [2025-02-06 03:38:42,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:42" (1/1) ... [2025-02-06 03:38:42,280 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:42" (1/1) ... [2025-02-06 03:38:42,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:42" (1/1) ... [2025-02-06 03:38:42,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:38:42,285 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:38:42,285 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:38:42,285 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:38:42,286 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:42" (1/1) ... [2025-02-06 03:38:42,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:38:42,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:38:42,317 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:38:42,319 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:38:42,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:38:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:38:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:38:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:38:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:38:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:38:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:38:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-02-06 03:38:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-02-06 03:38:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-02-06 03:38:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-02-06 03:38:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-02-06 03:38:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:38:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:38:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:38:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:38:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:38:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:38:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:38:42,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 03:38:42,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 03:38:42,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 03:38:42,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 03:38:42,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:38:42,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:38:42,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:38:42,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:38:42,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:38:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:38:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-02-06 03:38:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-02-06 03:38:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-02-06 03:38:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-02-06 03:38:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-02-06 03:38:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:38:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:38:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:38:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:38:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:38:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:38:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:38:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 03:38:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 03:38:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 03:38:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 03:38:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:38:42,341 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 03:38:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:38:42,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:38:42,476 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:38:42,477 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:38:42,833 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem59#1;havoc property_#t~ite71#1;havoc property_#t~mem63#1;havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~short81#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite91#1;havoc property_#t~ite88#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite109#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short98#1;havoc property_#t~ite106#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short110#1; [2025-02-06 03:38:42,873 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-02-06 03:38:42,873 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:38:42,884 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:38:42,884 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:38:42,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:38:42 BoogieIcfgContainer [2025-02-06 03:38:42,885 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:38:42,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:38:42,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:38:42,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:38:42,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:38:41" (1/3) ... [2025-02-06 03:38:42,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d03946b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:38:42, skipping insertion in model container [2025-02-06 03:38:42,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:42" (2/3) ... [2025-02-06 03:38:42,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d03946b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:38:42, skipping insertion in model container [2025-02-06 03:38:42,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:38:42" (3/3) ... [2025-02-06 03:38:42,892 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-31.i [2025-02-06 03:38:42,902 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:38:42,904 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-31.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:38:42,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:38:42,958 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;@1b4c3572, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:38:42,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:38:42,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:38:42,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 03:38:42,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:42,970 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:42,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:42,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:42,974 INFO L85 PathProgramCache]: Analyzing trace with hash 173968285, now seen corresponding path program 1 times [2025-02-06 03:38:42,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:38:42,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730318489] [2025-02-06 03:38:42,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:42,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:38:43,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 03:38:43,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 03:38:43,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:43,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 03:38:43,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:38:43,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730318489] [2025-02-06 03:38:43,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730318489] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:38:43,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330998634] [2025-02-06 03:38:43,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:43,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:38:43,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:38:43,243 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:38:43,246 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:38:43,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 03:38:43,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 03:38:43,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:43,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:43,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:38:43,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:38:43,506 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 03:38:43,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:38:43,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330998634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:38:43,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:38:43,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:38:43,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689559629] [2025-02-06 03:38:43,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:43,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:38:43,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:38:43,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:38:43,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:38:43,524 INFO L87 Difference]: Start difference. First operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:38:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:43,544 INFO L93 Difference]: Finished difference Result 166 states and 258 transitions. [2025-02-06 03:38:43,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:38:43,546 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2025-02-06 03:38:43,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:43,550 INFO L225 Difference]: With dead ends: 166 [2025-02-06 03:38:43,550 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 03:38:43,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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:38:43,554 INFO L435 NwaCegarLoop]: 121 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, 121 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:38:43,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:38:43,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 03:38:43,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-06 03:38:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:38:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2025-02-06 03:38:43,582 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 94 [2025-02-06 03:38:43,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:43,583 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2025-02-06 03:38:43,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:38:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2025-02-06 03:38:43,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 03:38:43,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:43,585 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:43,592 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:38:43,786 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:38:43,786 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:43,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:43,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1199022906, now seen corresponding path program 1 times [2025-02-06 03:38:43,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:38:43,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17953612] [2025-02-06 03:38:43,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:43,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:38:43,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 03:38:43,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 03:38:43,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:43,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:38:44,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:38:44,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17953612] [2025-02-06 03:38:44,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17953612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:38:44,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:38:44,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:38:44,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202112851] [2025-02-06 03:38:44,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:44,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:38:44,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:38:44,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:38:44,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:38:44,170 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:44,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:44,186 INFO L93 Difference]: Finished difference Result 163 states and 239 transitions. [2025-02-06 03:38:44,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:38:44,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2025-02-06 03:38:44,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:44,188 INFO L225 Difference]: With dead ends: 163 [2025-02-06 03:38:44,188 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 03:38:44,188 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:38:44,189 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:44,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:38:44,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 03:38:44,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-06 03:38:44,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4) internal successors, (98), 70 states have internal predecessors, (98), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:38:44,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2025-02-06 03:38:44,199 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 94 [2025-02-06 03:38:44,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:44,200 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2025-02-06 03:38:44,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:44,200 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2025-02-06 03:38:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 03:38:44,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:44,203 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:44,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:38:44,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:44,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:44,204 INFO L85 PathProgramCache]: Analyzing trace with hash 154286791, now seen corresponding path program 1 times [2025-02-06 03:38:44,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:38:44,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23493510] [2025-02-06 03:38:44,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:44,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:38:44,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 03:38:44,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 03:38:44,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:44,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:38:44,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:38:44,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23493510] [2025-02-06 03:38:44,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23493510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:38:44,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:38:44,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:38:44,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966091874] [2025-02-06 03:38:44,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:44,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:38:44,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:38:44,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:38:44,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:38:44,884 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:45,027 INFO L93 Difference]: Finished difference Result 207 states and 297 transitions. [2025-02-06 03:38:45,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:38:45,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2025-02-06 03:38:45,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:45,029 INFO L225 Difference]: With dead ends: 207 [2025-02-06 03:38:45,031 INFO L226 Difference]: Without dead ends: 127 [2025-02-06 03:38:45,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:38:45,032 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 57 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:45,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 550 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:38:45,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-06 03:38:45,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2025-02-06 03:38:45,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 108 states have (on average 1.3981481481481481) internal successors, (151), 109 states have internal predecessors, (151), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 03:38:45,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 177 transitions. [2025-02-06 03:38:45,050 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 177 transitions. Word has length 94 [2025-02-06 03:38:45,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:45,050 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 177 transitions. [2025-02-06 03:38:45,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 177 transitions. [2025-02-06 03:38:45,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:38:45,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:45,051 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:45,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:38:45,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:45,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:45,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1944467269, now seen corresponding path program 1 times [2025-02-06 03:38:45,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:38:45,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129076323] [2025-02-06 03:38:45,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:45,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:38:45,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:38:45,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:38:45,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:45,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:38:45,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:38:45,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129076323] [2025-02-06 03:38:45,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129076323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:38:45,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:38:45,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:38:45,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925137796] [2025-02-06 03:38:45,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:45,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:38:45,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:38:45,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:38:45,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:38:45,316 INFO L87 Difference]: Start difference. First operand 124 states and 177 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:45,354 INFO L93 Difference]: Finished difference Result 245 states and 351 transitions. [2025-02-06 03:38:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:38:45,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-02-06 03:38:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:45,358 INFO L225 Difference]: With dead ends: 245 [2025-02-06 03:38:45,360 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 03:38:45,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:38:45,361 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:45,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 332 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:38:45,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 03:38:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-02-06 03:38:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 109 states have internal predecessors, (149), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 03:38:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 175 transitions. [2025-02-06 03:38:45,373 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 175 transitions. Word has length 96 [2025-02-06 03:38:45,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:45,374 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 175 transitions. [2025-02-06 03:38:45,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 175 transitions. [2025-02-06 03:38:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:38:45,375 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:45,375 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:45,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:38:45,375 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:45,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:45,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1747953764, now seen corresponding path program 1 times [2025-02-06 03:38:45,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:38:45,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979248463] [2025-02-06 03:38:45,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:45,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:38:45,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:38:45,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:38:45,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:45,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:38:45,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:38:45,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979248463] [2025-02-06 03:38:45,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979248463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:38:45,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:38:45,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:38:45,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834363912] [2025-02-06 03:38:45,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:45,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:38:45,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:38:45,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:38:45,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:38:45,770 INFO L87 Difference]: Start difference. First operand 124 states and 175 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:45,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:45,877 INFO L93 Difference]: Finished difference Result 259 states and 364 transitions. [2025-02-06 03:38:45,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:38:45,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-02-06 03:38:45,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:45,879 INFO L225 Difference]: With dead ends: 259 [2025-02-06 03:38:45,879 INFO L226 Difference]: Without dead ends: 138 [2025-02-06 03:38:45,880 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:38:45,881 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 65 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:45,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 487 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:38:45,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-06 03:38:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2025-02-06 03:38:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 83 states have internal predecessors, (110), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 03:38:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2025-02-06 03:38:45,896 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 96 [2025-02-06 03:38:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:45,897 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2025-02-06 03:38:45,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2025-02-06 03:38:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:38:45,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:45,898 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:45,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:38:45,899 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:45,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:45,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1035235146, now seen corresponding path program 1 times [2025-02-06 03:38:45,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:38:45,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630989018] [2025-02-06 03:38:45,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:45,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:38:45,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:38:45,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:38:45,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:45,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:38:46,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:38:46,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630989018] [2025-02-06 03:38:46,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630989018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:38:46,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:38:46,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:38:46,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495571167] [2025-02-06 03:38:46,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:46,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:38:46,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:38:46,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:38:46,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:38:46,045 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:46,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:46,091 INFO L93 Difference]: Finished difference Result 222 states and 308 transitions. [2025-02-06 03:38:46,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:38:46,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-02-06 03:38:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:46,092 INFO L225 Difference]: With dead ends: 222 [2025-02-06 03:38:46,092 INFO L226 Difference]: Without dead ends: 132 [2025-02-06 03:38:46,093 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:38:46,093 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 49 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:46,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 561 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:38:46,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-06 03:38:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 98. [2025-02-06 03:38:46,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.329268292682927) internal successors, (109), 83 states have internal predecessors, (109), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 03:38:46,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2025-02-06 03:38:46,100 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 96 [2025-02-06 03:38:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:46,100 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2025-02-06 03:38:46,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2025-02-06 03:38:46,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 03:38:46,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:46,101 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:46,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:38:46,101 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:46,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:46,101 INFO L85 PathProgramCache]: Analyzing trace with hash -76579015, now seen corresponding path program 1 times [2025-02-06 03:38:46,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:38:46,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831841242] [2025-02-06 03:38:46,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:46,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:38:46,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 03:38:46,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 03:38:46,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:46,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:46,243 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:38:46,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:38:46,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831841242] [2025-02-06 03:38:46,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831841242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:38:46,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:38:46,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:38:46,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704757312] [2025-02-06 03:38:46,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:46,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:38:46,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:38:46,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:38:46,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:38:46,245 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:46,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:46,293 INFO L93 Difference]: Finished difference Result 215 states and 295 transitions. [2025-02-06 03:38:46,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:38:46,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2025-02-06 03:38:46,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:46,295 INFO L225 Difference]: With dead ends: 215 [2025-02-06 03:38:46,297 INFO L226 Difference]: Without dead ends: 125 [2025-02-06 03:38:46,297 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:38:46,298 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 38 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:46,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 445 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:38:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-06 03:38:46,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 98. [2025-02-06 03:38:46,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 83 states have internal predecessors, (108), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 03:38:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 134 transitions. [2025-02-06 03:38:46,309 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 134 transitions. Word has length 97 [2025-02-06 03:38:46,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:46,309 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 134 transitions. [2025-02-06 03:38:46,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 134 transitions. [2025-02-06 03:38:46,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 03:38:46,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:46,310 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:46,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:38:46,310 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:46,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:46,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1212166428, now seen corresponding path program 1 times [2025-02-06 03:38:46,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:38:46,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363381474] [2025-02-06 03:38:46,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:46,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:38:46,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 03:38:46,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 03:38:46,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:46,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:46,772 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:38:46,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:38:46,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363381474] [2025-02-06 03:38:46,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363381474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:38:46,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:38:46,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:38:46,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56686231] [2025-02-06 03:38:46,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:46,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:38:46,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:38:46,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:38:46,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:38:46,774 INFO L87 Difference]: Start difference. First operand 98 states and 134 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:46,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:46,928 INFO L93 Difference]: Finished difference Result 266 states and 362 transitions. [2025-02-06 03:38:46,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:38:46,929 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2025-02-06 03:38:46,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:46,930 INFO L225 Difference]: With dead ends: 266 [2025-02-06 03:38:46,930 INFO L226 Difference]: Without dead ends: 176 [2025-02-06 03:38:46,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:38:46,931 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 157 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:46,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 700 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:38:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-02-06 03:38:46,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2025-02-06 03:38:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 147 states have (on average 1.3129251700680271) internal successors, (193), 149 states have internal predecessors, (193), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:38:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 235 transitions. [2025-02-06 03:38:46,950 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 235 transitions. Word has length 98 [2025-02-06 03:38:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:46,951 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 235 transitions. [2025-02-06 03:38:46,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 235 transitions. [2025-02-06 03:38:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 03:38:46,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:46,953 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:46,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:38:46,953 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:46,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:46,954 INFO L85 PathProgramCache]: Analyzing trace with hash -935119758, now seen corresponding path program 1 times [2025-02-06 03:38:46,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:38:46,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706047137] [2025-02-06 03:38:46,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:46,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:38:46,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:38:47,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:38:47,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:47,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:38:47,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [760242963] [2025-02-06 03:38:47,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:47,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:38:47,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:38:47,020 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:38:47,022 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:38:47,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:38:47,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:38:47,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:47,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:47,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 03:38:47,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:38:47,519 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 23 treesize of output 3 [2025-02-06 03:38:47,653 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:38:47,814 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 21 treesize of output 13 [2025-02-06 03:38:47,817 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:38:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-06 03:38:47,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:38:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:38:47,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:38:47,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706047137] [2025-02-06 03:38:47,937 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:38:47,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760242963] [2025-02-06 03:38:47,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760242963] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:38:47,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:38:47,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-02-06 03:38:47,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564600726] [2025-02-06 03:38:47,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:47,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:38:47,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:38:47,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:38:47,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:38:47,939 INFO L87 Difference]: Start difference. First operand 173 states and 235 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:48,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:48,010 INFO L93 Difference]: Finished difference Result 388 states and 529 transitions. [2025-02-06 03:38:48,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:38:48,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-02-06 03:38:48,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:48,012 INFO L225 Difference]: With dead ends: 388 [2025-02-06 03:38:48,012 INFO L226 Difference]: Without dead ends: 223 [2025-02-06 03:38:48,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:38:48,013 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 108 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:48,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 413 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:38:48,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-06 03:38:48,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 202. [2025-02-06 03:38:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 176 states have (on average 1.3181818181818181) internal successors, (232), 178 states have internal predecessors, (232), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:38:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 274 transitions. [2025-02-06 03:38:48,022 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 274 transitions. Word has length 99 [2025-02-06 03:38:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:48,023 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 274 transitions. [2025-02-06 03:38:48,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 274 transitions. [2025-02-06 03:38:48,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 03:38:48,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:48,024 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:48,031 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:38:48,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:38:48,228 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:48,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:48,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2005686230, now seen corresponding path program 1 times [2025-02-06 03:38:48,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:38:48,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011048060] [2025-02-06 03:38:48,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:48,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:38:48,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:38:48,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:38:48,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:48,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:38:48,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:38:48,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011048060] [2025-02-06 03:38:48,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011048060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:38:48,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:38:48,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:38:48,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646125246] [2025-02-06 03:38:48,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:48,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:38:48,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:38:48,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:38:48,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:38:48,406 INFO L87 Difference]: Start difference. First operand 202 states and 274 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:48,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:48,497 INFO L93 Difference]: Finished difference Result 502 states and 674 transitions. [2025-02-06 03:38:48,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:38:48,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-02-06 03:38:48,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:48,500 INFO L225 Difference]: With dead ends: 502 [2025-02-06 03:38:48,500 INFO L226 Difference]: Without dead ends: 308 [2025-02-06 03:38:48,500 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:38:48,501 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 49 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:48,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 704 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:38:48,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-02-06 03:38:48,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 217. [2025-02-06 03:38:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 191 states have (on average 1.324607329842932) internal successors, (253), 193 states have internal predecessors, (253), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:38:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 295 transitions. [2025-02-06 03:38:48,511 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 295 transitions. Word has length 99 [2025-02-06 03:38:48,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:48,511 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 295 transitions. [2025-02-06 03:38:48,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 295 transitions. [2025-02-06 03:38:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 03:38:48,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:48,512 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:48,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:38:48,513 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:48,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:48,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1495152053, now seen corresponding path program 1 times [2025-02-06 03:38:48,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:38:48,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855587779] [2025-02-06 03:38:48,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:48,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:38:48,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:38:48,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:38:48,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:48,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:48,655 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:38:48,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:38:48,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855587779] [2025-02-06 03:38:48,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855587779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:38:48,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:38:48,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:38:48,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106828630] [2025-02-06 03:38:48,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:48,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:38:48,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:38:48,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:38:48,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:38:48,656 INFO L87 Difference]: Start difference. First operand 217 states and 295 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:48,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:48,732 INFO L93 Difference]: Finished difference Result 536 states and 722 transitions. [2025-02-06 03:38:48,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:38:48,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-02-06 03:38:48,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:48,734 INFO L225 Difference]: With dead ends: 536 [2025-02-06 03:38:48,735 INFO L226 Difference]: Without dead ends: 327 [2025-02-06 03:38:48,735 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:38:48,736 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 98 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:48,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 377 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:38:48,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-02-06 03:38:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 227. [2025-02-06 03:38:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 203 states have (on average 1.3349753694581281) internal successors, (271), 204 states have internal predecessors, (271), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:38:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 309 transitions. [2025-02-06 03:38:48,747 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 309 transitions. Word has length 99 [2025-02-06 03:38:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:48,748 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 309 transitions. [2025-02-06 03:38:48,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:48,748 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 309 transitions. [2025-02-06 03:38:48,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 03:38:48,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:48,749 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:48,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:38:48,750 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:48,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:48,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1446505546, now seen corresponding path program 1 times [2025-02-06 03:38:48,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:38:48,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552233310] [2025-02-06 03:38:48,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:48,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:38:48,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:38:48,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:38:48,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:48,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:38:48,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:38:48,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552233310] [2025-02-06 03:38:48,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552233310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:38:48,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:38:48,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:38:48,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936290933] [2025-02-06 03:38:48,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:48,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:38:48,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:38:48,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:38:48,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:38:48,887 INFO L87 Difference]: Start difference. First operand 227 states and 309 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:48,952 INFO L93 Difference]: Finished difference Result 549 states and 727 transitions. [2025-02-06 03:38:48,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:38:48,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-02-06 03:38:48,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:48,955 INFO L225 Difference]: With dead ends: 549 [2025-02-06 03:38:48,955 INFO L226 Difference]: Without dead ends: 325 [2025-02-06 03:38:48,955 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:38:48,955 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 58 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:48,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 489 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:38:48,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-02-06 03:38:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 309. [2025-02-06 03:38:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 273 states have (on average 1.2673992673992673) internal successors, (346), 276 states have internal predecessors, (346), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-06 03:38:48,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 400 transitions. [2025-02-06 03:38:48,971 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 400 transitions. Word has length 99 [2025-02-06 03:38:48,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:48,971 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 400 transitions. [2025-02-06 03:38:48,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:48,971 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 400 transitions. [2025-02-06 03:38:48,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 03:38:48,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:48,972 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:48,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:38:48,972 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:48,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:48,973 INFO L85 PathProgramCache]: Analyzing trace with hash 387063345, now seen corresponding path program 1 times [2025-02-06 03:38:48,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:38:48,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905787360] [2025-02-06 03:38:48,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:48,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:38:48,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:38:49,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:38:49,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:49,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:38:49,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [42664622] [2025-02-06 03:38:49,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:49,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:38:49,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:38:49,058 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:38:49,059 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:38:49,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:38:49,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:38:49,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:49,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:38:49,307 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:38:49,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:38:49,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:38:49,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:49,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:38:49,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:38:49,473 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:38:49,474 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:38:49,485 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:38:49,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:38:49,678 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:38:49,781 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:38:49,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:38:49 BoogieIcfgContainer [2025-02-06 03:38:49,783 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:38:49,784 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:38:49,784 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:38:49,784 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:38:49,784 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:38:42" (3/4) ... [2025-02-06 03:38:49,786 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:38:49,787 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:38:49,787 INFO L158 Benchmark]: Toolchain (without parser) took 7824.98ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 129.1MB in the beginning and 163.1MB in the end (delta: -34.0MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. [2025-02-06 03:38:49,787 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:38:49,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.48ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 115.1MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:38:49,787 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.96ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 112.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:38:49,788 INFO L158 Benchmark]: Boogie Preprocessor took 50.04ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 108.4MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:38:49,788 INFO L158 Benchmark]: IcfgBuilder took 599.89ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 75.4MB in the end (delta: 33.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 03:38:49,788 INFO L158 Benchmark]: TraceAbstraction took 6896.34ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 74.8MB in the beginning and 163.2MB in the end (delta: -88.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:38:49,788 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 260.0MB. Free memory was 163.2MB in the beginning and 163.1MB in the end (delta: 78.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:38:49,789 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.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.48ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 115.1MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.96ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 112.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.04ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 108.4MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 599.89ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 75.4MB in the end (delta: 33.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6896.34ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 74.8MB in the beginning and 163.2MB in the end (delta: -88.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 260.0MB. Free memory was 163.2MB in the beginning and 163.1MB in the end (delta: 78.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 200; [L22] signed long int var_1_1 = 200; [L23] signed long int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] signed long int var_1_3 = 1107940323; [L26] signed long int var_1_3 = 1107940323; [L27] signed long int* var_1_3_Pointer = &(var_1_3); [L28] unsigned char var_1_6 = 0; [L28] unsigned char var_1_6 = 0; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] signed long int var_1_7 = 4; [L30] signed long int var_1_7 = 4; [L31] signed long int* var_1_7_Pointer = &(var_1_7); [L32] signed long int var_1_8 = -32; [L32] signed long int var_1_8 = -32; [L33] signed long int* var_1_8_Pointer = &(var_1_8); [L34] unsigned char var_1_9 = 64; [L34] unsigned char var_1_9 = 64; [L35] unsigned char* var_1_9_Pointer = &(var_1_9); [L36] unsigned char var_1_12 = 4; [L36] unsigned char var_1_12 = 4; [L37] unsigned char* var_1_12_Pointer = &(var_1_12); [L38] double var_1_13 = 0.97; [L38] double var_1_13 = 0.97; [L39] double* var_1_13_Pointer = &(var_1_13); [L40] double var_1_14 = 32.6; [L40] double var_1_14 = 32.6; [L41] double* var_1_14_Pointer = &(var_1_14); [L42] signed long int last_1_var_1_7 = 4; [L43] double last_1_var_1_13 = 0.97; VAL [isInitial=0, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L102] EXPR \read(var_1_7) [L102] last_1_var_1_7 = var_1_7 [L103] EXPR \read(var_1_13) [L103] last_1_var_1_13 = var_1_13 [L113] RET updateLastVariables() [L114] CALL updateVariables() [L83] var_1_2 = __VERIFIER_nondet_uchar() [L84] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] var_1_3 = __VERIFIER_nondet_long() [L87] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] var_1_6 = __VERIFIER_nondet_uchar() [L90] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] var_1_8 = __VERIFIER_nondet_long() [L93] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] var_1_12 = __VERIFIER_nondet_uchar() [L96] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] var_1_14 = __VERIFIER_nondet_double() [L99] EXPR \read(var_1_14) [L99] EXPR var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F [L99] EXPR \read(var_1_14) [L99] EXPR var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L114] RET updateVariables() [L115] CALL step() [L47] EXPR \read(*var_1_3_Pointer) [L47] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L47] COND FALSE !(! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) [L54] EXPR \read(*var_1_12_Pointer) [L54] (*(var_1_9_Pointer)) = (*(var_1_12_Pointer)) [L56] EXPR \read(*var_1_9_Pointer) [L56] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L56] COND FALSE !((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) [L59] EXPR \read(*var_1_9_Pointer) [L59] EXPR \read(*var_1_3_Pointer) [L59] (*(var_1_7_Pointer)) = ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))) [L61] EXPR \read(*var_1_9_Pointer) [L61] EXPR \read(*var_1_3_Pointer) [L61] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L61] COND FALSE !(((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) [L72] EXPR \read(*var_1_14_Pointer) [L72] (*(var_1_13_Pointer)) = (*(var_1_14_Pointer)) [L74] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L74] COND TRUE (*(var_1_2_Pointer)) [L75] EXPR \read(*var_1_3_Pointer) [L75] EXPR \read(*var_1_9_Pointer) [L75] EXPR \read(*var_1_9_Pointer) [L75] (*(var_1_1_Pointer)) = (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1) [L106] EXPR \read(*var_1_1_Pointer) [L106] EXPR \read(*var_1_3_Pointer) [L106] EXPR \read(*var_1_9_Pointer) [L106] EXPR \read(*var_1_9_Pointer) [L106] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer)))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer)))))) [L106] EXPR \read(*var_1_9_Pointer) [L106] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))) [L106] EXPR \read(*var_1_7_Pointer) [L106] EXPR \read(*var_1_9_Pointer) [L106] EXPR \read(*var_1_3_Pointer) [L106] EXPR ((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer)))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) [L106] EXPR \read(*var_1_3_Pointer) [L106] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) [L106] EXPR \read(*var_1_9_Pointer) [L106] EXPR \read(*var_1_12_Pointer) [L106] EXPR (! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) ? (((*(var_1_2_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_13_Pointer)) == ((double) 0.8)) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) ? (((*(var_1_2_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_13_Pointer)) == ((double) 0.8)) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) [L106] EXPR \read(*var_1_9_Pointer) [L106] EXPR \read(*var_1_3_Pointer) [L106] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) ? (((*(var_1_2_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_13_Pointer)) == ((double) 0.8)) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer)))) [L106] EXPR \read(*var_1_13_Pointer) [L106] EXPR \read(*var_1_14_Pointer) [L106] EXPR (((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) ? (((*(var_1_2_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_13_Pointer)) == ((double) 0.8)) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer)))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) ? (((*(var_1_2_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_13_Pointer)) == ((double) 0.8)) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106-L107] return ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) ? (((*(var_1_2_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_13_Pointer)) == ((double) 0.8)) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 13, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 679 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 679 mSDsluCounter, 5414 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3790 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 671 IncrementalHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 1624 mSDtfsCounter, 671 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=12, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 335 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1554 NumberOfCodeBlocks, 1554 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1340 ConstructedInterpolants, 0 QuantifiedInterpolants, 3512 SizeOfPredicates, 17 NumberOfNonLiveVariables, 893 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2908/3080 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:38:49,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-31.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 08a905a57e2510263318b707c70f3b678c7204182c8cd0b9b57e46d4fa7b9fa2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:38:51,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:38:51,627 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:38:51,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:38:51,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:38:51,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:38:51,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:38:51,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:38:51,651 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:38:51,651 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:38:51,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:38:51,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:38:51,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:38:51,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:38:51,653 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:38:51,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:38:51,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:38:51,653 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:38:51,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:38:51,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:38:51,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:38:51,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:38:51,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:38:51,654 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:38:51,654 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:38:51,654 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:38:51,654 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:38:51,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:38:51,654 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:38:51,654 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:38:51,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:38:51,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:38:51,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:38:51,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:38:51,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:38:51,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:38:51,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:38:51,655 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:38:51,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:38:51,655 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:38:51,656 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:38:51,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:38:51,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:38:51,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:38:51,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:38:51,656 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 -> 08a905a57e2510263318b707c70f3b678c7204182c8cd0b9b57e46d4fa7b9fa2 [2025-02-06 03:38:51,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:38:51,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:38:51,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:38:51,880 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:38:51,880 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:38:51,882 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-31.i [2025-02-06 03:38:52,971 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8d846e40/66677fa66e1247b58cd390ddc6c91ac6/FLAGfd7b017fa [2025-02-06 03:38:53,183 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:38:53,184 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-31.i [2025-02-06 03:38:53,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8d846e40/66677fa66e1247b58cd390ddc6c91ac6/FLAGfd7b017fa [2025-02-06 03:38:53,204 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8d846e40/66677fa66e1247b58cd390ddc6c91ac6 [2025-02-06 03:38:53,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:38:53,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:38:53,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:38:53,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:38:53,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:38:53,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:38:53" (1/1) ... [2025-02-06 03:38:53,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da1517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:53, skipping insertion in model container [2025-02-06 03:38:53,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:38:53" (1/1) ... [2025-02-06 03:38:53,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:38:53,322 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-31.i[916,929] [2025-02-06 03:38:53,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:38:53,379 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:38:53,388 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-31.i[916,929] [2025-02-06 03:38:53,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:38:53,419 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:38:53,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:53 WrapperNode [2025-02-06 03:38:53,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:38:53,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:38:53,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:38:53,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:38:53,425 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:38:53" (1/1) ... [2025-02-06 03:38:53,434 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:38:53" (1/1) ... [2025-02-06 03:38:53,456 INFO L138 Inliner]: procedures = 33, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 432 [2025-02-06 03:38:53,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:38:53,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:38:53,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:38:53,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:38:53,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:53" (1/1) ... [2025-02-06 03:38:53,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:53" (1/1) ... [2025-02-06 03:38:53,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:53" (1/1) ... [2025-02-06 03:38:53,494 INFO L175 MemorySlicer]: Split 110 memory accesses to 11 slices as follows [2, 5, 8, 16, 12, 6, 6, 25, 8, 10, 12]. 23 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 2, 1, 4, 1]. [2025-02-06 03:38:53,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:53" (1/1) ... [2025-02-06 03:38:53,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:53" (1/1) ... [2025-02-06 03:38:53,513 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:53" (1/1) ... [2025-02-06 03:38:53,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:53" (1/1) ... [2025-02-06 03:38:53,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:53" (1/1) ... [2025-02-06 03:38:53,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:53" (1/1) ... [2025-02-06 03:38:53,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:38:53,526 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:38:53,526 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:38:53,526 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:38:53,526 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:53" (1/1) ... [2025-02-06 03:38:53,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:38:53,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:38:53,550 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:38:53,552 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:38:53,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:38:53,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:38:53,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:38:53,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-02-06 03:38:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-02-06 03:38:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-02-06 03:38:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-02-06 03:38:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-02-06 03:38:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-02-06 03:38:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2025-02-06 03:38:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:38:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:38:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:38:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:38:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:38:53,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-06 03:38:53,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-02-06 03:38:53,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-02-06 03:38:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-02-06 03:38:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-02-06 03:38:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-02-06 03:38:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:38:53,576 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:38:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:38:53,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:38:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:38:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:38:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:38:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:38:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:38:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:38:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-02-06 03:38:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-02-06 03:38:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-02-06 03:38:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-02-06 03:38:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-02-06 03:38:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:38:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:38:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:38:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:38:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:38:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-02-06 03:38:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-02-06 03:38:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-02-06 03:38:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-02-06 03:38:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-02-06 03:38:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-02-06 03:38:53,765 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:38:53,766 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:38:54,207 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem59#1;havoc property_#t~ite71#1;havoc property_#t~mem63#1;havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~short81#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite91#1;havoc property_#t~ite88#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite109#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short98#1;havoc property_#t~ite106#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short110#1; [2025-02-06 03:38:54,245 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-02-06 03:38:54,245 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:38:54,254 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:38:54,255 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:38:54,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:38:54 BoogieIcfgContainer [2025-02-06 03:38:54,255 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:38:54,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:38:54,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:38:54,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:38:54,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:38:53" (1/3) ... [2025-02-06 03:38:54,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7759b069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:38:54, skipping insertion in model container [2025-02-06 03:38:54,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:38:53" (2/3) ... [2025-02-06 03:38:54,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7759b069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:38:54, skipping insertion in model container [2025-02-06 03:38:54,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:38:54" (3/3) ... [2025-02-06 03:38:54,262 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-31.i [2025-02-06 03:38:54,271 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:38:54,272 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-31.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:38:54,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:38:54,344 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;@17b3439, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:38:54,345 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:38:54,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:38:54,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 03:38:54,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:54,357 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:54,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:54,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:54,361 INFO L85 PathProgramCache]: Analyzing trace with hash 173968285, now seen corresponding path program 1 times [2025-02-06 03:38:54,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:38:54,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852731957] [2025-02-06 03:38:54,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:54,369 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:38:54,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:38:54,375 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:38:54,376 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:38:54,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 03:38:54,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 03:38:54,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:54,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:54,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:38:54,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:38:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 03:38:54,680 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:38:54,681 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:38:54,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852731957] [2025-02-06 03:38:54,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852731957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:38:54,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:38:54,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:38:54,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393731246] [2025-02-06 03:38:54,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:54,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:38:54,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:38:54,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:38:54,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:38:54,702 INFO L87 Difference]: Start difference. First operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:54,722 INFO L93 Difference]: Finished difference Result 163 states and 253 transitions. [2025-02-06 03:38:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:38:54,723 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2025-02-06 03:38:54,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:54,727 INFO L225 Difference]: With dead ends: 163 [2025-02-06 03:38:54,727 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 03:38:54,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 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:38:54,731 INFO L435 NwaCegarLoop]: 114 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, 114 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:38:54,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:38:54,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 03:38:54,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-06 03:38:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:38:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2025-02-06 03:38:54,762 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 94 [2025-02-06 03:38:54,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:54,762 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2025-02-06 03:38:54,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2025-02-06 03:38:54,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 03:38:54,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:54,765 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:54,772 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:38:54,965 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:38:54,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:54,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:54,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1199022906, now seen corresponding path program 1 times [2025-02-06 03:38:54,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:38:54,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059105975] [2025-02-06 03:38:54,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:54,967 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:38:54,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:38:54,970 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:38:54,971 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:38:55,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 03:38:55,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 03:38:55,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:55,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:55,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:38:55,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:38:55,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:38:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:38:55,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:38:55,258 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:38:55,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059105975] [2025-02-06 03:38:55,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059105975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:38:55,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:38:55,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:38:55,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849031971] [2025-02-06 03:38:55,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:55,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:38:55,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:38:55,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:38:55,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:38:55,261 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:55,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:55,287 INFO L93 Difference]: Finished difference Result 157 states and 225 transitions. [2025-02-06 03:38:55,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:38:55,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2025-02-06 03:38:55,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:55,290 INFO L225 Difference]: With dead ends: 157 [2025-02-06 03:38:55,290 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 03:38:55,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 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:38:55,293 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:55,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:38:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 03:38:55,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-06 03:38:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:38:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2025-02-06 03:38:55,303 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 94 [2025-02-06 03:38:55,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:55,305 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2025-02-06 03:38:55,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:55,305 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2025-02-06 03:38:55,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 03:38:55,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:55,307 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:55,313 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 (3)] Ended with exit code 0 [2025-02-06 03:38:55,507 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:38:55,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:55,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:55,508 INFO L85 PathProgramCache]: Analyzing trace with hash 154286791, now seen corresponding path program 1 times [2025-02-06 03:38:55,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:38:55,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100358305] [2025-02-06 03:38:55,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:55,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:38:55,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:38:55,513 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:38:55,521 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:38:55,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 03:38:55,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 03:38:55,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:55,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:55,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 03:38:55,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:38:56,050 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 26 treesize of output 22 [2025-02-06 03:38:56,139 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-06 03:38:56,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:38:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:38:56,261 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:38:56,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100358305] [2025-02-06 03:38:56,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100358305] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:38:56,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:38:56,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-02-06 03:38:56,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347460173] [2025-02-06 03:38:56,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:56,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:38:56,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:38:56,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:38:56,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:38:56,263 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:56,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:56,508 INFO L93 Difference]: Finished difference Result 199 states and 279 transitions. [2025-02-06 03:38:56,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:38:56,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2025-02-06 03:38:56,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:56,509 INFO L225 Difference]: With dead ends: 199 [2025-02-06 03:38:56,509 INFO L226 Difference]: Without dead ends: 122 [2025-02-06 03:38:56,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:38:56,510 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 53 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:56,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 424 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:38:56,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-06 03:38:56,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2025-02-06 03:38:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3592233009708738) internal successors, (140), 104 states have internal predecessors, (140), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 03:38:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 166 transitions. [2025-02-06 03:38:56,518 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 166 transitions. Word has length 94 [2025-02-06 03:38:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:56,519 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 166 transitions. [2025-02-06 03:38:56,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 166 transitions. [2025-02-06 03:38:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:38:56,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:56,520 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:56,527 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:38:56,724 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:38:56,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:56,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:56,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1944467269, now seen corresponding path program 1 times [2025-02-06 03:38:56,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:38:56,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501197563] [2025-02-06 03:38:56,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:56,725 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:38:56,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:38:56,727 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:38:56,728 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:38:56,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:38:56,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:38:56,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:56,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:56,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:38:56,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:38:56,927 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:38:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:38:56,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:38:56,938 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:38:56,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501197563] [2025-02-06 03:38:56,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501197563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:38:56,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:38:56,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:38:56,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949010858] [2025-02-06 03:38:56,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:56,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:38:56,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:38:56,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:38:56,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:38:56,940 INFO L87 Difference]: Start difference. First operand 119 states and 166 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:56,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:56,956 INFO L93 Difference]: Finished difference Result 235 states and 329 transitions. [2025-02-06 03:38:56,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:38:56,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-02-06 03:38:56,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:56,958 INFO L225 Difference]: With dead ends: 235 [2025-02-06 03:38:56,958 INFO L226 Difference]: Without dead ends: 119 [2025-02-06 03:38:56,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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:38:56,958 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:56,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:38:56,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-06 03:38:56,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-02-06 03:38:56,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 104 states have internal predecessors, (138), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 03:38:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 164 transitions. [2025-02-06 03:38:56,968 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 164 transitions. Word has length 96 [2025-02-06 03:38:56,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:56,969 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 164 transitions. [2025-02-06 03:38:56,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:56,969 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 164 transitions. [2025-02-06 03:38:56,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:38:56,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:56,970 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:56,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 (5)] Ended with exit code 0 [2025-02-06 03:38:57,170 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:38:57,171 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:57,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:57,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1747953764, now seen corresponding path program 1 times [2025-02-06 03:38:57,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:38:57,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892377500] [2025-02-06 03:38:57,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:57,172 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:38:57,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:38:57,173 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:38:57,175 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:38:57,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:38:57,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:38:57,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:57,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:57,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:38:57,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:38:57,359 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 24 treesize of output 20 [2025-02-06 03:38:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:38:57,439 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:38:57,439 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:38:57,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892377500] [2025-02-06 03:38:57,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892377500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:38:57,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:38:57,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:38:57,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930559076] [2025-02-06 03:38:57,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:57,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:38:57,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:38:57,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:38:57,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:38:57,440 INFO L87 Difference]: Start difference. First operand 119 states and 164 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:57,609 INFO L93 Difference]: Finished difference Result 249 states and 342 transitions. [2025-02-06 03:38:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:38:57,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-02-06 03:38:57,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:57,611 INFO L225 Difference]: With dead ends: 249 [2025-02-06 03:38:57,611 INFO L226 Difference]: Without dead ends: 133 [2025-02-06 03:38:57,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:38:57,612 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 61 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:57,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 461 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:38:57,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-06 03:38:57,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 95. [2025-02-06 03:38:57,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 80 states have internal predecessors, (103), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 03:38:57,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2025-02-06 03:38:57,621 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 96 [2025-02-06 03:38:57,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:57,621 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2025-02-06 03:38:57,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:57,621 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2025-02-06 03:38:57,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:38:57,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:57,626 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:57,639 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:38:57,826 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:38:57,826 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:57,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:57,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1035235146, now seen corresponding path program 1 times [2025-02-06 03:38:57,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:38:57,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631614437] [2025-02-06 03:38:57,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:57,828 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:38:57,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:38:57,832 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:38:57,833 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:38:57,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:38:58,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:38:58,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:58,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:58,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:38:58,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:38:58,223 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 31 treesize of output 19 [2025-02-06 03:38:58,240 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-06 03:38:58,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:38:58,299 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:38:58,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631614437] [2025-02-06 03:38:58,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631614437] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:38:58,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [944987660] [2025-02-06 03:38:58,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:58,300 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:38:58,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:38:58,321 INFO L229 MonitoredProcess]: Starting monitored process 8 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:38:58,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-02-06 03:38:58,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:38:58,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:38:58,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:58,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:58,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:38:58,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:38:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:38:58,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:38:58,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [944987660] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:38:58,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:38:58,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-06 03:38:58,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403331716] [2025-02-06 03:38:58,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:58,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:38:58,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:38:58,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:38:58,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:38:58,696 INFO L87 Difference]: Start difference. First operand 95 states and 129 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:58,760 INFO L93 Difference]: Finished difference Result 214 states and 290 transitions. [2025-02-06 03:38:58,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:38:58,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-02-06 03:38:58,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:58,762 INFO L225 Difference]: With dead ends: 214 [2025-02-06 03:38:58,762 INFO L226 Difference]: Without dead ends: 127 [2025-02-06 03:38:58,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:38:58,763 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 45 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:58,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 521 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:38:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-06 03:38:58,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 95. [2025-02-06 03:38:58,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 80 states have internal predecessors, (102), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 03:38:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 128 transitions. [2025-02-06 03:38:58,770 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 128 transitions. Word has length 96 [2025-02-06 03:38:58,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:58,770 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 128 transitions. [2025-02-06 03:38:58,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 128 transitions. [2025-02-06 03:38:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 03:38:58,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:58,771 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:58,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-06 03:38:58,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2025-02-06 03:38:59,171 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,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:38:59,172 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:59,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:59,172 INFO L85 PathProgramCache]: Analyzing trace with hash -76579015, now seen corresponding path program 1 times [2025-02-06 03:38:59,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:38:59,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857937444] [2025-02-06 03:38:59,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:59,173 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:38:59,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:38:59,174 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:38:59,176 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:38:59,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 03:38:59,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 03:38:59,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:59,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:59,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:38:59,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:38:59,548 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:38:59,577 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:38:59,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:38:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:38:59,655 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:38:59,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857937444] [2025-02-06 03:38:59,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857937444] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:38:59,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:38:59,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2025-02-06 03:38:59,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031382810] [2025-02-06 03:38:59,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:59,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:38:59,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:38:59,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:38:59,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:38:59,656 INFO L87 Difference]: Start difference. First operand 95 states and 128 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:59,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:59,709 INFO L93 Difference]: Finished difference Result 207 states and 277 transitions. [2025-02-06 03:38:59,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:38:59,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2025-02-06 03:38:59,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:59,711 INFO L225 Difference]: With dead ends: 207 [2025-02-06 03:38:59,711 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 03:38:59,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 181 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:38:59,712 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 34 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:59,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 416 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:38:59,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 03:38:59,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 95. [2025-02-06 03:38:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 80 states have internal predecessors, (101), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 03:38:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 127 transitions. [2025-02-06 03:38:59,718 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 127 transitions. Word has length 97 [2025-02-06 03:38:59,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:59,718 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 127 transitions. [2025-02-06 03:38:59,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:38:59,719 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2025-02-06 03:38:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 03:38:59,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:59,720 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:59,728 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:38:59,920 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:38:59,920 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:59,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:59,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1212166428, now seen corresponding path program 1 times [2025-02-06 03:38:59,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:38:59,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956156056] [2025-02-06 03:38:59,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:59,921 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:38:59,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:38:59,923 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:38:59,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 (10)] Waiting until timeout for monitored process [2025-02-06 03:39:00,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 03:39:00,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 03:39:00,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:00,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:00,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:39:00,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:00,317 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:39:00,354 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:39:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 03:39:00,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:39:00,462 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:00,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956156056] [2025-02-06 03:39:00,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956156056] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:00,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:39:00,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2025-02-06 03:39:00,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031881547] [2025-02-06 03:39:00,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:00,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:39:00,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:00,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:39:00,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:39:00,463 INFO L87 Difference]: Start difference. First operand 95 states and 127 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:39:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:00,609 INFO L93 Difference]: Finished difference Result 258 states and 344 transitions. [2025-02-06 03:39:00,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:39:00,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2025-02-06 03:39:00,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:00,610 INFO L225 Difference]: With dead ends: 258 [2025-02-06 03:39:00,610 INFO L226 Difference]: Without dead ends: 171 [2025-02-06 03:39:00,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 187 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:39:00,611 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 76 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:00,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 611 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:00,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-06 03:39:00,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2025-02-06 03:39:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 142 states have (on average 1.2816901408450705) internal successors, (182), 144 states have internal predecessors, (182), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:39:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 224 transitions. [2025-02-06 03:39:00,619 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 224 transitions. Word has length 98 [2025-02-06 03:39:00,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:00,619 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 224 transitions. [2025-02-06 03:39:00,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:39:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 224 transitions. [2025-02-06 03:39:00,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 03:39:00,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:00,620 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:00,628 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 (10)] Forceful destruction successful, exit code 0 [2025-02-06 03:39:00,824 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:39:00,824 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:00,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:00,824 INFO L85 PathProgramCache]: Analyzing trace with hash -935119758, now seen corresponding path program 1 times [2025-02-06 03:39:00,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:00,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937287962] [2025-02-06 03:39:00,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:00,825 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:39:00,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:00,827 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:39:00,827 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:39:00,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:39:01,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:39:01,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:01,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:01,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 03:39:01,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:01,572 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:39:01,577 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 18 treesize of output 10 [2025-02-06 03:39:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-06 03:39:01,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:39:02,171 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:02,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937287962] [2025-02-06 03:39:02,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937287962] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:02,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:39:02,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2025-02-06 03:39:02,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129323213] [2025-02-06 03:39:02,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:02,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:39:02,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:02,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:39:02,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:39:02,172 INFO L87 Difference]: Start difference. First operand 168 states and 224 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:39:02,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:02,998 INFO L93 Difference]: Finished difference Result 330 states and 439 transitions. [2025-02-06 03:39:03,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:39:03,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-02-06 03:39:03,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:03,003 INFO L225 Difference]: With dead ends: 330 [2025-02-06 03:39:03,003 INFO L226 Difference]: Without dead ends: 170 [2025-02-06 03:39:03,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:39:03,005 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 94 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:03,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 387 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:39:03,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-06 03:39:03,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2025-02-06 03:39:03,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 144 states have internal predecessors, (181), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:39:03,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 223 transitions. [2025-02-06 03:39:03,027 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 223 transitions. Word has length 99 [2025-02-06 03:39:03,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:03,028 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 223 transitions. [2025-02-06 03:39:03,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:39:03,028 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 223 transitions. [2025-02-06 03:39:03,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 03:39:03,028 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:03,030 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:03,038 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:39:03,230 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:39:03,230 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:03,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:03,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2005686230, now seen corresponding path program 1 times [2025-02-06 03:39:03,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:03,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919246274] [2025-02-06 03:39:03,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:03,231 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:39:03,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:03,234 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:39:03,235 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:39:03,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:39:03,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:39:03,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:03,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:03,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:39:03,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:03,588 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 31 treesize of output 19 [2025-02-06 03:39:03,601 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-06 03:39:03,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:03,653 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:03,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919246274] [2025-02-06 03:39:03,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919246274] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:03,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1774083586] [2025-02-06 03:39:03,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:03,654 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:39:03,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:39:03,656 INFO L229 MonitoredProcess]: Starting monitored process 13 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:39:03,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2025-02-06 03:39:03,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:39:04,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:39:04,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:04,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:04,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 03:39:04,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:04,311 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:39:04,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 03:39:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 03:39:04,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:04,671 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:39:04,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1774083586] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:04,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:39:04,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 17 [2025-02-06 03:39:04,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37308836] [2025-02-06 03:39:04,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:04,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:39:04,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:04,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:39:04,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:39:04,674 INFO L87 Difference]: Start difference. First operand 168 states and 223 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:39:04,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:04,824 INFO L93 Difference]: Finished difference Result 415 states and 545 transitions. [2025-02-06 03:39:04,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:39:04,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-02-06 03:39:04,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:04,826 INFO L225 Difference]: With dead ends: 415 [2025-02-06 03:39:04,826 INFO L226 Difference]: Without dead ends: 255 [2025-02-06 03:39:04,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:39:04,827 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 45 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:04,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 653 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:04,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-02-06 03:39:04,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 178. [2025-02-06 03:39:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 154 states have internal predecessors, (195), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:39:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 237 transitions. [2025-02-06 03:39:04,836 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 237 transitions. Word has length 99 [2025-02-06 03:39:04,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:04,836 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 237 transitions. [2025-02-06 03:39:04,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:39:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 237 transitions. [2025-02-06 03:39:04,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 03:39:04,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:04,837 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:04,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2025-02-06 03:39:05,046 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:39:05,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:39:05,238 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:05,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:05,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1495152053, now seen corresponding path program 1 times [2025-02-06 03:39:05,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:05,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435217889] [2025-02-06 03:39:05,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:05,239 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:39:05,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:05,241 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:39:05,247 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:39:05,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:39:05,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:39:05,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:05,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:05,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:39:05,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:05,595 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 31 treesize of output 19 [2025-02-06 03:39:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-06 03:39:05,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:05,661 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:05,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435217889] [2025-02-06 03:39:05,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435217889] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:05,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1165044661] [2025-02-06 03:39:05,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:05,661 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:39:05,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:39:05,663 INFO L229 MonitoredProcess]: Starting monitored process 15 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:39:05,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2025-02-06 03:39:05,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:39:06,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:39:06,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:06,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:06,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 03:39:06,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:06,273 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:39:06,686 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 31 treesize of output 19 [2025-02-06 03:39:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-06 03:39:06,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:06,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1165044661] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:06,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:39:06,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2025-02-06 03:39:06,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695840502] [2025-02-06 03:39:06,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:39:06,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:39:06,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:06,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:39:06,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:39:06,811 INFO L87 Difference]: Start difference. First operand 178 states and 237 transitions. Second operand has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2025-02-06 03:39:07,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:07,185 INFO L93 Difference]: Finished difference Result 346 states and 452 transitions. [2025-02-06 03:39:07,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:39:07,186 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) Word has length 99 [2025-02-06 03:39:07,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:07,187 INFO L225 Difference]: With dead ends: 346 [2025-02-06 03:39:07,187 INFO L226 Difference]: Without dead ends: 176 [2025-02-06 03:39:07,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2025-02-06 03:39:07,188 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 135 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:07,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 503 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:39:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-02-06 03:39:07,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 168. [2025-02-06 03:39:07,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 140 states have (on average 1.2214285714285715) internal successors, (171), 142 states have internal predecessors, (171), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:39:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 213 transitions. [2025-02-06 03:39:07,201 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 213 transitions. Word has length 99 [2025-02-06 03:39:07,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:07,201 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 213 transitions. [2025-02-06 03:39:07,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2025-02-06 03:39:07,202 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2025-02-06 03:39:07,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 03:39:07,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:07,203 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:07,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2025-02-06 03:39:07,411 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:39:07,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:39:07,604 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:07,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:07,604 INFO L85 PathProgramCache]: Analyzing trace with hash 387063345, now seen corresponding path program 1 times [2025-02-06 03:39:07,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:07,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130734598] [2025-02-06 03:39:07,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:07,605 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:39:07,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:07,608 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:39:07,608 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:39:07,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:39:07,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:39:07,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:07,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:07,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 03:39:07,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:08,560 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 19 [2025-02-06 03:39:08,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:39:08,974 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 191 treesize of output 121 [2025-02-06 03:39:08,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:39:08,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 138 [2025-02-06 03:39:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 03:39:09,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:09,305 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:09,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130734598] [2025-02-06 03:39:09,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130734598] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:09,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [293708485] [2025-02-06 03:39:09,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:09,306 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:39:09,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:39:09,307 INFO L229 MonitoredProcess]: Starting monitored process 17 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:39:09,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2025-02-06 03:39:09,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:39:10,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:39:10,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:10,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:10,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 03:39:10,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:10,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-02-06 03:39:11,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-02-06 03:39:12,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:39:12,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 121 [2025-02-06 03:39:12,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 146 [2025-02-06 03:39:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 03:39:12,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:12,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [293708485] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:12,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:39:12,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2025-02-06 03:39:12,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194062189] [2025-02-06 03:39:12,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:39:12,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 03:39:12,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:12,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 03:39:12,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:39:12,324 INFO L87 Difference]: Start difference. First operand 168 states and 213 transitions. Second operand has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 17 states have internal predecessors, (97), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-06 03:39:15,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:15,918 INFO L93 Difference]: Finished difference Result 471 states and 588 transitions. [2025-02-06 03:39:15,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:39:15,919 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 17 states have internal predecessors, (97), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 100 [2025-02-06 03:39:15,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:15,921 INFO L225 Difference]: With dead ends: 471 [2025-02-06 03:39:15,921 INFO L226 Difference]: Without dead ends: 469 [2025-02-06 03:39:15,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2025-02-06 03:39:15,922 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 386 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:15,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1121 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-06 03:39:15,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-06 03:39:15,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 463. [2025-02-06 03:39:15,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 386 states have (on average 1.2046632124352332) internal successors, (465), 392 states have internal predecessors, (465), 58 states have call successors, (58), 18 states have call predecessors, (58), 18 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:39:15,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 581 transitions. [2025-02-06 03:39:15,959 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 581 transitions. Word has length 100 [2025-02-06 03:39:15,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:15,959 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 581 transitions. [2025-02-06 03:39:15,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 17 states have internal predecessors, (97), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-06 03:39:15,959 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 581 transitions. [2025-02-06 03:39:15,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 03:39:15,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:15,960 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:15,968 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 (16)] Ended with exit code 0 [2025-02-06 03:39:16,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2025-02-06 03:39:16,361 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,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:39:16,361 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:16,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:16,361 INFO L85 PathProgramCache]: Analyzing trace with hash -114108224, now seen corresponding path program 1 times [2025-02-06 03:39:16,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:16,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827233115] [2025-02-06 03:39:16,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:16,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:39:16,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:16,363 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:39:16,364 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:39:16,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:39:16,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:39:16,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:16,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:16,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:39:16,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:39:16,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:16,584 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:16,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827233115] [2025-02-06 03:39:16,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827233115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:16,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:16,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:39:16,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333582188] [2025-02-06 03:39:16,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:16,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:39:16,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:16,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:39:16,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:39:16,585 INFO L87 Difference]: Start difference. First operand 463 states and 581 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:39:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:16,648 INFO L93 Difference]: Finished difference Result 918 states and 1152 transitions. [2025-02-06 03:39:16,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:39:16,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2025-02-06 03:39:16,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:16,653 INFO L225 Difference]: With dead ends: 918 [2025-02-06 03:39:16,653 INFO L226 Difference]: Without dead ends: 463 [2025-02-06 03:39:16,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 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:39:16,655 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:16,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 508 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-02-06 03:39:16,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 454. [2025-02-06 03:39:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 377 states have (on average 1.193633952254642) internal successors, (450), 383 states have internal predecessors, (450), 58 states have call successors, (58), 18 states have call predecessors, (58), 18 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:39:16,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 566 transitions. [2025-02-06 03:39:16,694 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 566 transitions. Word has length 100 [2025-02-06 03:39:16,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:16,694 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 566 transitions. [2025-02-06 03:39:16,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:39:16,694 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 566 transitions. [2025-02-06 03:39:16,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 03:39:16,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:16,695 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:16,703 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:39:16,895 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:39:16,896 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:16,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:16,896 INFO L85 PathProgramCache]: Analyzing trace with hash 2112544242, now seen corresponding path program 1 times [2025-02-06 03:39:16,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:16,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625633263] [2025-02-06 03:39:16,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:16,897 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:39:16,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:16,898 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:39:16,899 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:39:16,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:39:17,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:39:17,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:17,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:17,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:39:17,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:17,100 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 03:39:17,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:17,100 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:17,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625633263] [2025-02-06 03:39:17,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625633263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:17,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:17,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:39:17,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199856778] [2025-02-06 03:39:17,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:17,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:39:17,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:17,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:39:17,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:39:17,101 INFO L87 Difference]: Start difference. First operand 454 states and 566 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:39:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:17,188 INFO L93 Difference]: Finished difference Result 900 states and 1122 transitions. [2025-02-06 03:39:17,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:39:17,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2025-02-06 03:39:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:17,192 INFO L225 Difference]: With dead ends: 900 [2025-02-06 03:39:17,192 INFO L226 Difference]: Without dead ends: 454 [2025-02-06 03:39:17,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 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:39:17,193 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 307 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.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:17,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:17,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-02-06 03:39:17,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2025-02-06 03:39:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 377 states have (on average 1.1909814323607426) internal successors, (449), 383 states have internal predecessors, (449), 58 states have call successors, (58), 18 states have call predecessors, (58), 18 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:39:17,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 565 transitions. [2025-02-06 03:39:17,230 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 565 transitions. Word has length 100 [2025-02-06 03:39:17,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:17,232 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 565 transitions. [2025-02-06 03:39:17,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:39:17,232 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 565 transitions. [2025-02-06 03:39:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 03:39:17,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:17,233 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:17,241 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:39:17,433 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:39:17,434 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:17,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:17,434 INFO L85 PathProgramCache]: Analyzing trace with hash -119705681, now seen corresponding path program 1 times [2025-02-06 03:39:17,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:17,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732611174] [2025-02-06 03:39:17,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:17,434 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:39:17,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:17,436 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:39:17,437 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:39:17,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 03:39:17,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 03:39:17,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:17,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:17,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 03:39:17,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:18,466 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 19 [2025-02-06 03:39:18,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:39:18,799 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 191 treesize of output 121 [2025-02-06 03:39:18,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:39:18,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 136 [2025-02-06 03:39:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 03:39:18,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:19,177 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:19,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732611174] [2025-02-06 03:39:19,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732611174] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:19,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [697764805] [2025-02-06 03:39:19,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:19,178 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:39:19,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:39:19,179 INFO L229 MonitoredProcess]: Starting monitored process 21 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:39:19,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2025-02-06 03:39:19,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 03:39:20,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 03:39:20,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:20,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:20,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 03:39:20,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:20,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-02-06 03:39:27,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-02-06 03:39:27,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:39:27,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 121 [2025-02-06 03:39:27,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 144 [2025-02-06 03:39:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 03:39:27,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:27,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [697764805] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:27,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:39:27,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 24 [2025-02-06 03:39:27,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30566616] [2025-02-06 03:39:27,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:39:27,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 03:39:27,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:27,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 03:39:27,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=798, Unknown=1, NotChecked=0, Total=930 [2025-02-06 03:39:27,962 INFO L87 Difference]: Start difference. First operand 454 states and 565 transitions. Second operand has 25 states, 23 states have (on average 4.391304347826087) internal successors, (101), 22 states have internal predecessors, (101), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-06 03:39:32,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:32,175 INFO L93 Difference]: Finished difference Result 770 states and 947 transitions. [2025-02-06 03:39:32,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 03:39:32,175 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.391304347826087) internal successors, (101), 22 states have internal predecessors, (101), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 102 [2025-02-06 03:39:32,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:32,183 INFO L225 Difference]: With dead ends: 770 [2025-02-06 03:39:32,183 INFO L226 Difference]: Without dead ends: 768 [2025-02-06 03:39:32,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 227 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=430, Invalid=1921, Unknown=1, NotChecked=0, Total=2352 [2025-02-06 03:39:32,184 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 434 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:32,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1807 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-06 03:39:32,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-02-06 03:39:32,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 608. [2025-02-06 03:39:32,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 505 states have (on average 1.194059405940594) internal successors, (603), 513 states have internal predecessors, (603), 77 states have call successors, (77), 25 states have call predecessors, (77), 25 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) [2025-02-06 03:39:32,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 757 transitions. [2025-02-06 03:39:32,250 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 757 transitions. Word has length 102 [2025-02-06 03:39:32,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:32,251 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 757 transitions. [2025-02-06 03:39:32,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.391304347826087) internal successors, (101), 22 states have internal predecessors, (101), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-06 03:39:32,251 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 757 transitions. [2025-02-06 03:39:32,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 03:39:32,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:32,252 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:32,260 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:39:32,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2025-02-06 03:39:32,653 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,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:39:32,653 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:32,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:32,653 INFO L85 PathProgramCache]: Analyzing trace with hash 905786318, now seen corresponding path program 1 times [2025-02-06 03:39:32,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:32,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197009366] [2025-02-06 03:39:32,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:32,654 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:39:32,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:32,655 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:39:32,656 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:39:32,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 03:39:32,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 03:39:32,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:32,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:32,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:39:32,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:39:32,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:32,874 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:32,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197009366] [2025-02-06 03:39:32,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197009366] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:32,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:32,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:39:32,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080349240] [2025-02-06 03:39:32,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:32,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:39:32,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:32,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:39:32,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:39:32,875 INFO L87 Difference]: Start difference. First operand 608 states and 757 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:39:32,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:32,988 INFO L93 Difference]: Finished difference Result 1088 states and 1345 transitions. [2025-02-06 03:39:32,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:39:32,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2025-02-06 03:39:32,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:32,990 INFO L225 Difference]: With dead ends: 1088 [2025-02-06 03:39:32,990 INFO L226 Difference]: Without dead ends: 482 [2025-02-06 03:39:32,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 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:39:32,992 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:32,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-02-06 03:39:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 458. [2025-02-06 03:39:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 380 states have (on average 1.186842105263158) internal successors, (451), 386 states have internal predecessors, (451), 58 states have call successors, (58), 19 states have call predecessors, (58), 19 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:39:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 567 transitions. [2025-02-06 03:39:33,032 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 567 transitions. Word has length 102 [2025-02-06 03:39:33,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:33,032 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 567 transitions. [2025-02-06 03:39:33,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:39:33,032 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 567 transitions. [2025-02-06 03:39:33,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:39:33,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:33,033 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:33,041 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:39:33,234 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 [2025-02-06 03:39:33,234 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:33,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:33,234 INFO L85 PathProgramCache]: Analyzing trace with hash -299092290, now seen corresponding path program 1 times [2025-02-06 03:39:33,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:33,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70877891] [2025-02-06 03:39:33,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:33,235 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:39:33,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:33,237 INFO L229 MonitoredProcess]: Starting monitored process 23 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:39:33,238 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 (23)] Waiting until timeout for monitored process [2025-02-06 03:39:33,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:39:33,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:39:33,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:33,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:33,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 03:39:33,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:33,695 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 25 treesize of output 17 [2025-02-06 03:39:33,698 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:39:33,724 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-06 03:39:33,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:33,929 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 26 [2025-02-06 03:39:36,575 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:36,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70877891] [2025-02-06 03:39:36,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70877891] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:36,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1372910407] [2025-02-06 03:39:36,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:36,575 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:39:36,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:39:36,577 INFO L229 MonitoredProcess]: Starting monitored process 24 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:39:36,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2025-02-06 03:39:36,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:39:37,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:39:37,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:37,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:37,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 03:39:37,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:37,453 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:39:38,292 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 25 treesize of output 17 [2025-02-06 03:39:38,295 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:39:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-06 03:39:38,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:38,398 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 26 [2025-02-06 03:39:40,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1372910407] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:40,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:39:40,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-02-06 03:39:40,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416677109] [2025-02-06 03:39:40,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:39:40,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 03:39:40,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:40,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 03:39:40,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:39:40,853 INFO L87 Difference]: Start difference. First operand 458 states and 567 transitions. Second operand has 18 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2025-02-06 03:39:42,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:42,037 INFO L93 Difference]: Finished difference Result 1027 states and 1261 transitions. [2025-02-06 03:39:42,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 03:39:42,038 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) Word has length 103 [2025-02-06 03:39:42,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:42,040 INFO L225 Difference]: With dead ends: 1027 [2025-02-06 03:39:42,040 INFO L226 Difference]: Without dead ends: 577 [2025-02-06 03:39:42,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 03:39:42,041 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 279 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:42,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 950 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:39:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-02-06 03:39:42,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 506. [2025-02-06 03:39:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 428 states have (on average 1.1728971962616823) internal successors, (502), 434 states have internal predecessors, (502), 58 states have call successors, (58), 19 states have call predecessors, (58), 19 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:39:42,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 618 transitions. [2025-02-06 03:39:42,082 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 618 transitions. Word has length 103 [2025-02-06 03:39:42,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:42,082 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 618 transitions. [2025-02-06 03:39:42,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2025-02-06 03:39:42,082 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 618 transitions. [2025-02-06 03:39:42,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:39:42,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:42,084 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:42,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2025-02-06 03:39:42,292 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 (23)] Ended with exit code 0 [2025-02-06 03:39:42,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /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:39:42,485 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:42,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:42,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2089384299, now seen corresponding path program 1 times [2025-02-06 03:39:42,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:42,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472294447] [2025-02-06 03:39:42,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:42,486 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:39:42,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:42,488 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:39:42,489 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:39:42,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:39:42,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:39:42,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:42,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:42,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 03:39:42,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:43,147 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 26 treesize of output 18 [2025-02-06 03:39:43,151 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 28 treesize of output 16 [2025-02-06 03:39:43,192 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-06 03:39:43,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:43,472 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 26 [2025-02-06 03:39:44,828 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:44,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472294447] [2025-02-06 03:39:44,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472294447] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:44,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [375200953] [2025-02-06 03:39:44,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:44,829 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:39:44,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:39:44,830 INFO L229 MonitoredProcess]: Starting monitored process 26 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:39:44,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2025-02-06 03:39:44,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:39:45,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:39:45,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:45,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:45,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 03:39:45,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:45,954 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:39:47,452 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 26 treesize of output 18 [2025-02-06 03:39:47,457 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 21 [2025-02-06 03:39:47,601 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-06 03:39:47,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:47,695 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 26 [2025-02-06 03:39:52,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [375200953] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:52,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:39:52,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 22 [2025-02-06 03:39:52,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164666721] [2025-02-06 03:39:52,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:39:52,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 03:39:52,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:52,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 03:39:52,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2025-02-06 03:39:52,737 INFO L87 Difference]: Start difference. First operand 506 states and 618 transitions. Second operand has 22 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2025-02-06 03:39:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:59,012 INFO L93 Difference]: Finished difference Result 1458 states and 1763 transitions. [2025-02-06 03:39:59,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-06 03:39:59,013 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) Word has length 103 [2025-02-06 03:39:59,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:59,015 INFO L225 Difference]: With dead ends: 1458 [2025-02-06 03:39:59,015 INFO L226 Difference]: Without dead ends: 960 [2025-02-06 03:39:59,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=925, Invalid=4477, Unknown=0, NotChecked=0, Total=5402 [2025-02-06 03:39:59,018 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 862 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:59,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 950 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-06 03:39:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-02-06 03:39:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 413. [2025-02-06 03:39:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 346 states have (on average 1.170520231213873) internal successors, (405), 350 states have internal predecessors, (405), 49 states have call successors, (49), 17 states have call predecessors, (49), 17 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 03:39:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 503 transitions. [2025-02-06 03:39:59,067 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 503 transitions. Word has length 103 [2025-02-06 03:39:59,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:59,067 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 503 transitions. [2025-02-06 03:39:59,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2025-02-06 03:39:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 503 transitions. [2025-02-06 03:39:59,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 03:39:59,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:59,068 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:59,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2025-02-06 03:39:59,277 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:39:59,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:39:59,469 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:59,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:59,470 INFO L85 PathProgramCache]: Analyzing trace with hash 83017431, now seen corresponding path program 1 times [2025-02-06 03:39:59,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:59,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344263956] [2025-02-06 03:39:59,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:59,470 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:39:59,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:59,472 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:39:59,473 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:39:59,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:39:59,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:39:59,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:59,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:59,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 03:39:59,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:00,776 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 19 [2025-02-06 03:40:01,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:40:01,275 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 191 treesize of output 121 [2025-02-06 03:40:01,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:40:01,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 138 [2025-02-06 03:40:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 03:40:01,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:01,805 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:01,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344263956] [2025-02-06 03:40:01,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344263956] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:01,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1484260282] [2025-02-06 03:40:01,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:01,805 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:40:01,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:40:01,808 INFO L229 MonitoredProcess]: Starting monitored process 28 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:40:01,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2025-02-06 03:40:01,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:40:02,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:40:02,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:02,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:02,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 03:40:02,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:03,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2025-02-06 03:40:05,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-02-06 03:40:05,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:40:05,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 121 [2025-02-06 03:40:05,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 142 [2025-02-06 03:40:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 03:40:05,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:06,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1484260282] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:06,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:40:06,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2025-02-06 03:40:06,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226352992] [2025-02-06 03:40:06,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:40:06,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 03:40:06,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:06,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 03:40:06,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2025-02-06 03:40:06,124 INFO L87 Difference]: Start difference. First operand 413 states and 503 transitions. Second operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-06 03:40:11,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:40:14,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:14,488 INFO L93 Difference]: Finished difference Result 617 states and 740 transitions. [2025-02-06 03:40:14,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:40:14,489 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 105 [2025-02-06 03:40:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:14,491 INFO L225 Difference]: With dead ends: 617 [2025-02-06 03:40:14,491 INFO L226 Difference]: Without dead ends: 615 [2025-02-06 03:40:14,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=186, Invalid=1004, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 03:40:14,492 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 321 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 87 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:14,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1361 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 676 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2025-02-06 03:40:14,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-02-06 03:40:14,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 467. [2025-02-06 03:40:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 400 states have (on average 1.175) internal successors, (470), 404 states have internal predecessors, (470), 49 states have call successors, (49), 17 states have call predecessors, (49), 17 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 03:40:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 568 transitions. [2025-02-06 03:40:14,540 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 568 transitions. Word has length 105 [2025-02-06 03:40:14,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:14,540 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 568 transitions. [2025-02-06 03:40:14,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-06 03:40:14,540 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 568 transitions. [2025-02-06 03:40:14,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 03:40:14,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:14,542 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:14,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2025-02-06 03:40:14,749 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 (27)] Forceful destruction successful, exit code 0 [2025-02-06 03:40:14,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:40:14,942 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:14,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:14,943 INFO L85 PathProgramCache]: Analyzing trace with hash 692422376, now seen corresponding path program 1 times [2025-02-06 03:40:14,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:14,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393796424] [2025-02-06 03:40:14,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:14,943 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:40:14,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:14,945 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:40:14,946 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:40:15,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 03:40:15,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 03:40:15,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:15,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:15,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:40:15,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 5 proven. 135 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-02-06 03:40:15,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:40:15,634 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:15,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393796424] [2025-02-06 03:40:15,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393796424] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:15,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:40:15,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-02-06 03:40:15,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844790330] [2025-02-06 03:40:15,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:15,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:40:15,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:15,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:40:15,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:40:15,635 INFO L87 Difference]: Start difference. First operand 467 states and 568 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:40:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:15,776 INFO L93 Difference]: Finished difference Result 1079 states and 1303 transitions. [2025-02-06 03:40:15,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:40:15,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-02-06 03:40:15,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:15,779 INFO L225 Difference]: With dead ends: 1079 [2025-02-06 03:40:15,779 INFO L226 Difference]: Without dead ends: 657 [2025-02-06 03:40:15,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 200 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:40:15,780 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 82 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:15,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 389 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:40:15,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-02-06 03:40:15,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 651. [2025-02-06 03:40:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 568 states have (on average 1.1690140845070423) internal successors, (664), 574 states have internal predecessors, (664), 57 states have call successors, (57), 25 states have call predecessors, (57), 25 states have return successors, (57), 51 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-06 03:40:15,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 778 transitions. [2025-02-06 03:40:15,836 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 778 transitions. Word has length 106 [2025-02-06 03:40:15,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:15,836 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 778 transitions. [2025-02-06 03:40:15,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:40:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 778 transitions. [2025-02-06 03:40:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 03:40:15,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:15,837 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:15,851 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:40:16,038 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:40:16,038 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:16,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:16,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1859734585, now seen corresponding path program 1 times [2025-02-06 03:40:16,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:16,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662050266] [2025-02-06 03:40:16,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:16,039 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:40:16,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:16,040 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:40:16,041 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:40:16,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 03:40:16,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 03:40:16,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:16,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:16,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:40:16,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:40:16,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:40:16,864 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:16,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662050266] [2025-02-06 03:40:16,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662050266] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:16,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:40:16,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-02-06 03:40:16,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619326193] [2025-02-06 03:40:16,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:16,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:40:16,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:16,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:40:16,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:40:16,865 INFO L87 Difference]: Start difference. First operand 651 states and 778 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:40:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:16,995 INFO L93 Difference]: Finished difference Result 1381 states and 1649 transitions. [2025-02-06 03:40:16,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:40:16,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-02-06 03:40:16,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:16,997 INFO L225 Difference]: With dead ends: 1381 [2025-02-06 03:40:16,997 INFO L226 Difference]: Without dead ends: 775 [2025-02-06 03:40:16,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:40:16,999 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 61 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:16,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 348 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:40:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-02-06 03:40:17,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 689. [2025-02-06 03:40:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 606 states have (on average 1.1567656765676568) internal successors, (701), 612 states have internal predecessors, (701), 57 states have call successors, (57), 25 states have call predecessors, (57), 25 states have return successors, (57), 51 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-06 03:40:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 815 transitions. [2025-02-06 03:40:17,054 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 815 transitions. Word has length 106 [2025-02-06 03:40:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:17,055 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 815 transitions. [2025-02-06 03:40:17,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:40:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 815 transitions. [2025-02-06 03:40:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 03:40:17,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:17,056 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:17,065 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:40:17,256 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:40:17,256 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:17,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:17,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1718309863, now seen corresponding path program 1 times [2025-02-06 03:40:17,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:17,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861755580] [2025-02-06 03:40:17,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:17,257 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:40:17,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:17,259 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:40:17,260 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:40:17,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 03:40:17,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 03:40:17,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:17,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:17,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 03:40:17,559 INFO L279 TraceCheckSpWp]: Computing forward predicates...