./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-a_file-54.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 2f657570a1e1457f1f304b0d552f8742bb723e9b2810b7fa1033cb000332d16c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:23:49,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:23:49,709 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:23:49,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:23:49,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:23:49,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:23:49,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:23:49,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:23:49,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:23:49,730 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:23:49,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:23:49,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:23:49,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:23:49,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:23:49,731 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:23:49,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:23:49,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:23:49,732 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:23:49,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:23:49,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:23:49,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:23:49,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:23:49,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:23:49,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:23:49,732 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:23:49,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:23:49,733 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:23:49,733 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:23:49,733 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:23:49,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:23:49,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:23:49,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:23:49,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:23:49,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:23:49,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:23:49,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:23:49,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:23:49,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:23:49,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:23:49,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:23:49,734 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:23:49,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:23:49,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:23:49,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:23:49,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:23:49,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:23:49,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:23:49,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:23:49,735 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 -> 2f657570a1e1457f1f304b0d552f8742bb723e9b2810b7fa1033cb000332d16c [2025-01-09 15:23:49,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:23:49,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:23:49,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:23:49,983 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:23:49,983 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:23:49,984 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-a_file-54.i [2025-01-09 15:23:51,072 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c37a5211/4e077d7c06ef4752a10ab681bb7cd488/FLAG193b8ed5c [2025-01-09 15:23:51,321 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:23:51,323 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i [2025-01-09 15:23:51,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c37a5211/4e077d7c06ef4752a10ab681bb7cd488/FLAG193b8ed5c [2025-01-09 15:23:51,658 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c37a5211/4e077d7c06ef4752a10ab681bb7cd488 [2025-01-09 15:23:51,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:23:51,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:23:51,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:23:51,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:23:51,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:23:51,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7a3495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51, skipping insertion in model container [2025-01-09 15:23:51,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:23:51,768 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-a_file-54.i[916,929] [2025-01-09 15:23:51,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:23:51,839 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:23:51,851 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-a_file-54.i[916,929] [2025-01-09 15:23:51,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:23:51,896 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:23:51,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51 WrapperNode [2025-01-09 15:23:51,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:23:51,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:23:51,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:23:51,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:23:51,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,942 INFO L138 Inliner]: procedures = 29, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 467 [2025-01-09 15:23:51,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:23:51,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:23:51,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:23:51,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:23:51,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,970 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 33, 41, 7, 13, 19]. 36 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 3, 1, 2, 2]. The 16 writes are split as follows [0, 7, 4, 1, 2, 2]. [2025-01-09 15:23:51,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,981 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:23:51,996 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:23:51,996 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:23:51,996 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:23:51,996 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:52,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:23:52,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:23:52,021 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-01-09 15:23:52,024 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-01-09 15:23:52,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:23:52,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:23:52,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:23:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:23:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:23:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:23:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:23:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:23:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:23:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:23:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:23:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:23:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:23:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:23:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:23:52,045 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:23:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:23:52,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:23:52,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:23:52,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:23:52,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:23:52,154 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:23:52,155 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:23:52,489 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-01-09 15:23:52,489 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:23:52,502 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:23:52,503 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:23:52,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:23:52 BoogieIcfgContainer [2025-01-09 15:23:52,503 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:23:52,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:23:52,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:23:52,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:23:52,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:23:51" (1/3) ... [2025-01-09 15:23:52,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241fe549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:23:52, skipping insertion in model container [2025-01-09 15:23:52,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (2/3) ... [2025-01-09 15:23:52,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241fe549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:23:52, skipping insertion in model container [2025-01-09 15:23:52,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:23:52" (3/3) ... [2025-01-09 15:23:52,511 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-54.i [2025-01-09 15:23:52,521 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:23:52,522 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-54.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:23:52,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:23:52,579 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;@50611378, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:23:52,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:23:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:23:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 15:23:52,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:52,591 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:52,591 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:52,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:52,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1621578330, now seen corresponding path program 1 times [2025-01-09 15:23:52,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:52,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041694815] [2025-01-09 15:23:52,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:52,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:52,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 15:23:52,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 15:23:52,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:52,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:52,856 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 15:23:52,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:52,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041694815] [2025-01-09 15:23:52,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041694815] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:23:52,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430655419] [2025-01-09 15:23:52,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:52,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:23:52,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:23:52,861 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-01-09 15:23:52,863 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-01-09 15:23:52,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 15:23:53,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 15:23:53,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:53,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:53,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:23:53,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:23:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 15:23:53,068 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:23:53,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430655419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:53,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:23:53,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:23:53,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412079488] [2025-01-09 15:23:53,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:53,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:23:53,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:53,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:23:53,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:23:53,089 INFO L87 Difference]: Start difference. First operand has 109 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:23:53,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:53,106 INFO L93 Difference]: Finished difference Result 212 states and 327 transitions. [2025-01-09 15:23:53,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:23:53,107 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-01-09 15:23:53,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:53,111 INFO L225 Difference]: With dead ends: 212 [2025-01-09 15:23:53,112 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 15:23:53,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 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-01-09 15:23:53,116 INFO L435 NwaCegarLoop]: 155 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, 155 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-01-09 15:23:53,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:23:53,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 15:23:53,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-01-09 15:23:53,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:23:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2025-01-09 15:23:53,154 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 105 [2025-01-09 15:23:53,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:53,155 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2025-01-09 15:23:53,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:23:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2025-01-09 15:23:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 15:23:53,157 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:53,157 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:53,163 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-01-09 15:23:53,358 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-01-09 15:23:53,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:53,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:53,359 INFO L85 PathProgramCache]: Analyzing trace with hash 59399430, now seen corresponding path program 1 times [2025-01-09 15:23:53,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:53,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796343486] [2025-01-09 15:23:53,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:53,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:53,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 15:23:53,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 15:23:53,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:53,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 15:23:53,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:53,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796343486] [2025-01-09 15:23:53,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796343486] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:23:53,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732744405] [2025-01-09 15:23:53,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:53,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:23:53,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:23:53,709 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-01-09 15:23:53,710 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-01-09 15:23:53,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 15:23:53,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 15:23:53,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:53,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:53,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:23:53,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:23:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:23:53,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:23:53,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732744405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:53,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:23:53,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 15:23:53,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472004755] [2025-01-09 15:23:53,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:53,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:23:53,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:53,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:23:53,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:23:53,935 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:23:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:53,965 INFO L93 Difference]: Finished difference Result 212 states and 311 transitions. [2025-01-09 15:23:53,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:23:53,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-01-09 15:23:53,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:53,969 INFO L225 Difference]: With dead ends: 212 [2025-01-09 15:23:53,969 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 15:23:53,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:23:53,970 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:53,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:23:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 15:23:53,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-01-09 15:23:53,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:23:53,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2025-01-09 15:23:53,980 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 105 [2025-01-09 15:23:53,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:53,984 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2025-01-09 15:23:53,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:23:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2025-01-09 15:23:53,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 15:23:53,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:53,986 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:53,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:23:54,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:23:54,187 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:54,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:54,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1834406792, now seen corresponding path program 1 times [2025-01-09 15:23:54,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:54,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004113725] [2025-01-09 15:23:54,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:54,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:54,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 15:23:54,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 15:23:54,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:54,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 15:23:54,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:54,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004113725] [2025-01-09 15:23:54,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004113725] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:23:54,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49134817] [2025-01-09 15:23:54,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:54,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:23:54,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:23:54,386 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-01-09 15:23:54,389 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-01-09 15:23:54,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 15:23:54,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 15:23:54,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:54,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:54,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:23:54,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:23:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:23:54,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:23:54,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49134817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:54,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:23:54,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 15:23:54,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153820332] [2025-01-09 15:23:54,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:54,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:23:54,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:54,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:23:54,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:23:54,574 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:23:54,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:54,608 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2025-01-09 15:23:54,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:23:54,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-01-09 15:23:54,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:54,612 INFO L225 Difference]: With dead ends: 216 [2025-01-09 15:23:54,612 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 15:23:54,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:23:54,613 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:54,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:23:54,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 15:23:54,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-01-09 15:23:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:23:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2025-01-09 15:23:54,625 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 105 [2025-01-09 15:23:54,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:54,625 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2025-01-09 15:23:54,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:23:54,625 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2025-01-09 15:23:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 15:23:54,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:54,628 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:54,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 15:23:54,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:23:54,829 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:54,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:54,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1836253834, now seen corresponding path program 1 times [2025-01-09 15:23:54,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:54,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754196566] [2025-01-09 15:23:54,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:54,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:54,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 15:23:54,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 15:23:54,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:54,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:54,946 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 15:23:54,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:54,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754196566] [2025-01-09 15:23:54,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754196566] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:23:54,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595837325] [2025-01-09 15:23:54,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:54,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:23:54,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:23:54,948 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:23:54,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 15:23:55,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 15:23:55,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 15:23:55,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:55,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:55,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:23:55,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:23:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:23:55,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:23:55,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595837325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:55,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:23:55,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-09 15:23:55,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145700296] [2025-01-09 15:23:55,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:55,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:23:55,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:55,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:23:55,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:23:55,097 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:23:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:55,114 INFO L93 Difference]: Finished difference Result 219 states and 318 transitions. [2025-01-09 15:23:55,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:23:55,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-01-09 15:23:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:55,116 INFO L225 Difference]: With dead ends: 219 [2025-01-09 15:23:55,116 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 15:23:55,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:23:55,117 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:55,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:23:55,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 15:23:55,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-01-09 15:23:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:23:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2025-01-09 15:23:55,122 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 105 [2025-01-09 15:23:55,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:55,123 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2025-01-09 15:23:55,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:23:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2025-01-09 15:23:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 15:23:55,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:55,124 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:55,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 15:23:55,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:23:55,327 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:55,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:55,327 INFO L85 PathProgramCache]: Analyzing trace with hash -284055835, now seen corresponding path program 1 times [2025-01-09 15:23:55,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:55,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500049683] [2025-01-09 15:23:55,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:55,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:55,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 15:23:55,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 15:23:55,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:55,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:23:55,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:55,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500049683] [2025-01-09 15:23:55,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500049683] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:55,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:23:55,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:23:55,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533654613] [2025-01-09 15:23:55,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:55,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:23:55,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:55,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:23:55,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:23:55,498 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:23:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:55,601 INFO L93 Difference]: Finished difference Result 323 states and 466 transitions. [2025-01-09 15:23:55,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:23:55,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-01-09 15:23:55,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:55,603 INFO L225 Difference]: With dead ends: 323 [2025-01-09 15:23:55,603 INFO L226 Difference]: Without dead ends: 214 [2025-01-09 15:23:55,604 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-01-09 15:23:55,604 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 136 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:55,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 550 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:23:55,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-09 15:23:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 133. [2025-01-09 15:23:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 119 states have (on average 1.4285714285714286) internal successors, (170), 119 states have internal predecessors, (170), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:23:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 194 transitions. [2025-01-09 15:23:55,621 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 194 transitions. Word has length 107 [2025-01-09 15:23:55,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:55,621 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 194 transitions. [2025-01-09 15:23:55,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:23:55,621 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 194 transitions. [2025-01-09 15:23:55,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:23:55,625 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:55,625 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:55,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:23:55,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:55,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:55,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2046015553, now seen corresponding path program 1 times [2025-01-09 15:23:55,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:55,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146077702] [2025-01-09 15:23:55,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:55,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:55,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:23:55,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:23:55,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:55,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:23:55,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:55,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146077702] [2025-01-09 15:23:55,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146077702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:55,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:23:55,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:23:55,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452926694] [2025-01-09 15:23:55,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:55,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:23:55,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:55,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:23:55,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:23:55,836 INFO L87 Difference]: Start difference. First operand 133 states and 194 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:23:55,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:55,887 INFO L93 Difference]: Finished difference Result 368 states and 536 transitions. [2025-01-09 15:23:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:23:55,888 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), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-01-09 15:23:55,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:55,889 INFO L225 Difference]: With dead ends: 368 [2025-01-09 15:23:55,889 INFO L226 Difference]: Without dead ends: 238 [2025-01-09 15:23:55,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:23:55,892 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 109 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:55,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 421 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:23:55,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-01-09 15:23:55,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2025-01-09 15:23:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 207 states have internal predecessors, (292), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:23:55,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 340 transitions. [2025-01-09 15:23:55,915 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 340 transitions. Word has length 108 [2025-01-09 15:23:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:55,917 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 340 transitions. [2025-01-09 15:23:55,917 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), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:23:55,917 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 340 transitions. [2025-01-09 15:23:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:23:55,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:55,918 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:55,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:23:55,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:55,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:55,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1431303293, now seen corresponding path program 1 times [2025-01-09 15:23:55,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:55,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339355083] [2025-01-09 15:23:55,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:55,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:55,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:23:55,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:23:55,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:55,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:56,192 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:23:56,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:56,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339355083] [2025-01-09 15:23:56,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339355083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:56,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:23:56,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:23:56,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592292686] [2025-01-09 15:23:56,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:56,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:23:56,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:56,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:23:56,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:23:56,194 INFO L87 Difference]: Start difference. First operand 234 states and 340 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:23:56,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:56,305 INFO L93 Difference]: Finished difference Result 469 states and 681 transitions. [2025-01-09 15:23:56,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:23:56,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-01-09 15:23:56,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:56,308 INFO L225 Difference]: With dead ends: 469 [2025-01-09 15:23:56,309 INFO L226 Difference]: Without dead ends: 238 [2025-01-09 15:23:56,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:23:56,310 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 101 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:56,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 529 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:23:56,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-01-09 15:23:56,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2025-01-09 15:23:56,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.4057971014492754) internal successors, (291), 207 states have internal predecessors, (291), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:23:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 339 transitions. [2025-01-09 15:23:56,320 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 339 transitions. Word has length 108 [2025-01-09 15:23:56,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:56,321 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 339 transitions. [2025-01-09 15:23:56,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:23:56,321 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 339 transitions. [2025-01-09 15:23:56,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:23:56,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:56,322 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:56,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:23:56,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:56,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:56,322 INFO L85 PathProgramCache]: Analyzing trace with hash 844497279, now seen corresponding path program 1 times [2025-01-09 15:23:56,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:56,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934388385] [2025-01-09 15:23:56,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:56,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:56,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:23:56,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:23:56,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:56,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:23:57,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:57,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934388385] [2025-01-09 15:23:57,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934388385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:57,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:23:57,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:23:57,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956511809] [2025-01-09 15:23:57,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:57,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:23:57,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:57,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:23:57,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:23:57,103 INFO L87 Difference]: Start difference. First operand 234 states and 339 transitions. Second operand has 8 states, 6 states have (on average 8.5) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:23:57,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:57,256 INFO L93 Difference]: Finished difference Result 579 states and 826 transitions. [2025-01-09 15:23:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:23:57,256 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.5) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-01-09 15:23:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:57,258 INFO L225 Difference]: With dead ends: 579 [2025-01-09 15:23:57,258 INFO L226 Difference]: Without dead ends: 348 [2025-01-09 15:23:57,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:23:57,259 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 67 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:57,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 912 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:23:57,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-01-09 15:23:57,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 344. [2025-01-09 15:23:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 311 states have (on average 1.3794212218649518) internal successors, (429), 313 states have internal predecessors, (429), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:23:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 485 transitions. [2025-01-09 15:23:57,272 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 485 transitions. Word has length 108 [2025-01-09 15:23:57,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:57,273 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 485 transitions. [2025-01-09 15:23:57,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.5) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:23:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 485 transitions. [2025-01-09 15:23:57,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:23:57,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:57,274 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:57,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:23:57,274 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:57,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:57,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1887952288, now seen corresponding path program 1 times [2025-01-09 15:23:57,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:57,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582331430] [2025-01-09 15:23:57,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:57,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:57,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:23:57,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:23:57,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:57,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:23:57,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:57,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582331430] [2025-01-09 15:23:57,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582331430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:57,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:23:57,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:23:57,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041435288] [2025-01-09 15:23:57,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:57,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:23:57,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:57,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:23:57,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:23:57,800 INFO L87 Difference]: Start difference. First operand 344 states and 485 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:23:58,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:58,336 INFO L93 Difference]: Finished difference Result 842 states and 1196 transitions. [2025-01-09 15:23:58,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 15:23:58,336 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-01-09 15:23:58,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:58,340 INFO L225 Difference]: With dead ends: 842 [2025-01-09 15:23:58,340 INFO L226 Difference]: Without dead ends: 654 [2025-01-09 15:23:58,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:23:58,341 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 223 mSDsluCounter, 2497 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 2845 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:58,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 2845 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:23:58,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-01-09 15:23:58,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 531. [2025-01-09 15:23:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 482 states have (on average 1.383817427385892) internal successors, (667), 485 states have internal predecessors, (667), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 15:23:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 751 transitions. [2025-01-09 15:23:58,378 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 751 transitions. Word has length 109 [2025-01-09 15:23:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:58,379 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 751 transitions. [2025-01-09 15:23:58,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:23:58,380 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 751 transitions. [2025-01-09 15:23:58,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:23:58,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:58,381 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:58,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:23:58,381 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:58,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:58,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1395897758, now seen corresponding path program 1 times [2025-01-09 15:23:58,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:58,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683890982] [2025-01-09 15:23:58,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:58,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:58,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:23:58,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:23:58,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:58,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:23:58,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:58,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683890982] [2025-01-09 15:23:58,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683890982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:58,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:23:58,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:23:58,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764132091] [2025-01-09 15:23:58,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:58,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:23:58,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:58,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:23:58,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:23:58,636 INFO L87 Difference]: Start difference. First operand 531 states and 751 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:23:58,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:58,754 INFO L93 Difference]: Finished difference Result 1026 states and 1451 transitions. [2025-01-09 15:23:58,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:23:58,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-01-09 15:23:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:58,757 INFO L225 Difference]: With dead ends: 1026 [2025-01-09 15:23:58,758 INFO L226 Difference]: Without dead ends: 651 [2025-01-09 15:23:58,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:23:58,761 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 238 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:58,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 916 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:23:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-01-09 15:23:58,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 648. [2025-01-09 15:23:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 585 states have (on average 1.3743589743589744) internal successors, (804), 590 states have internal predecessors, (804), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:23:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 912 transitions. [2025-01-09 15:23:58,801 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 912 transitions. Word has length 109 [2025-01-09 15:23:58,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:58,802 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 912 transitions. [2025-01-09 15:23:58,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:23:58,802 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 912 transitions. [2025-01-09 15:23:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:23:58,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:58,805 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:58,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:23:58,805 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:58,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:58,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2021965794, now seen corresponding path program 1 times [2025-01-09 15:23:58,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:58,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811053566] [2025-01-09 15:23:58,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:58,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:58,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:23:58,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:23:58,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:58,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:23:59,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:59,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811053566] [2025-01-09 15:23:59,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811053566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:59,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:23:59,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:23:59,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326447829] [2025-01-09 15:23:59,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:59,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:23:59,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:59,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:23:59,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:23:59,042 INFO L87 Difference]: Start difference. First operand 648 states and 912 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:23:59,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:59,168 INFO L93 Difference]: Finished difference Result 1306 states and 1835 transitions. [2025-01-09 15:23:59,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:23:59,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-01-09 15:23:59,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:59,172 INFO L225 Difference]: With dead ends: 1306 [2025-01-09 15:23:59,172 INFO L226 Difference]: Without dead ends: 814 [2025-01-09 15:23:59,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-01-09 15:23:59,174 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 133 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:59,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 923 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:23:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2025-01-09 15:23:59,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 810. [2025-01-09 15:23:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 721 states have (on average 1.361997226074896) internal successors, (982), 729 states have internal predecessors, (982), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 15:23:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1134 transitions. [2025-01-09 15:23:59,205 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1134 transitions. Word has length 109 [2025-01-09 15:23:59,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:59,206 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1134 transitions. [2025-01-09 15:23:59,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:23:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1134 transitions. [2025-01-09 15:23:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:23:59,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:59,207 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:59,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:23:59,207 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:59,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:59,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1261884252, now seen corresponding path program 1 times [2025-01-09 15:23:59,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:59,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70542555] [2025-01-09 15:23:59,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:59,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:59,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:23:59,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:23:59,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:59,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:23:59,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:59,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70542555] [2025-01-09 15:23:59,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70542555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:59,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:23:59,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:23:59,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732193744] [2025-01-09 15:23:59,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:59,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:23:59,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:59,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:23:59,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:23:59,472 INFO L87 Difference]: Start difference. First operand 810 states and 1134 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:23:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:59,681 INFO L93 Difference]: Finished difference Result 1434 states and 2008 transitions. [2025-01-09 15:23:59,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:23:59,681 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-01-09 15:23:59,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:59,685 INFO L225 Difference]: With dead ends: 1434 [2025-01-09 15:23:59,686 INFO L226 Difference]: Without dead ends: 819 [2025-01-09 15:23:59,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:23:59,688 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 141 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 2043 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:59,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 2043 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:23:59,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-01-09 15:23:59,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 528. [2025-01-09 15:23:59,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 469 states have (on average 1.3603411513859276) internal successors, (638), 474 states have internal predecessors, (638), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 15:23:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 738 transitions. [2025-01-09 15:23:59,728 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 738 transitions. Word has length 109 [2025-01-09 15:23:59,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:59,728 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 738 transitions. [2025-01-09 15:23:59,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:23:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 738 transitions. [2025-01-09 15:23:59,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:23:59,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:59,729 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:23:59,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:23:59,730 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:59,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:59,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1377608847, now seen corresponding path program 1 times [2025-01-09 15:23:59,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:59,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080154316] [2025-01-09 15:23:59,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:59,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:59,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:23:59,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:23:59,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:59,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:24:00,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:00,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080154316] [2025-01-09 15:24:00,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080154316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:00,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:00,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:24:00,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305669956] [2025-01-09 15:24:00,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:00,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:24:00,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:00,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:24:00,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:24:00,014 INFO L87 Difference]: Start difference. First operand 528 states and 738 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:00,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:00,089 INFO L93 Difference]: Finished difference Result 560 states and 772 transitions. [2025-01-09 15:24:00,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:24:00,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-01-09 15:24:00,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:00,092 INFO L225 Difference]: With dead ends: 560 [2025-01-09 15:24:00,092 INFO L226 Difference]: Without dead ends: 558 [2025-01-09 15:24:00,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-01-09 15:24:00,095 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 119 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:00,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 817 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:24:00,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-01-09 15:24:00,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2025-01-09 15:24:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 496 states have (on average 1.340725806451613) internal successors, (665), 501 states have internal predecessors, (665), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 15:24:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 765 transitions. [2025-01-09 15:24:00,128 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 765 transitions. Word has length 110 [2025-01-09 15:24:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:00,129 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 765 transitions. [2025-01-09 15:24:00,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 765 transitions. [2025-01-09 15:24:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:24:00,133 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:00,133 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:24:00,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:24:00,133 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:00,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:00,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1375761805, now seen corresponding path program 1 times [2025-01-09 15:24:00,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:00,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721495392] [2025-01-09 15:24:00,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:00,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:00,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:24:00,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:24:00,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:00,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:24:00,182 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:24:00,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:24:00,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:24:00,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:00,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:24:00,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:24:00,271 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:24:00,272 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:24:00,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:24:00,276 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:00,350 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:24:00,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:24:00 BoogieIcfgContainer [2025-01-09 15:24:00,354 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:24:00,354 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:24:00,354 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:24:00,355 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:24:00,355 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:23:52" (3/4) ... [2025-01-09 15:24:00,357 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:24:00,357 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:24:00,358 INFO L158 Benchmark]: Toolchain (without parser) took 8697.52ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 120.8MB in the beginning and 280.3MB in the end (delta: -159.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:24:00,358 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 192.9MB. Free memory is still 111.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:24:00,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.93ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 106.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:24:00,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.10ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 102.6MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:24:00,359 INFO L158 Benchmark]: Boogie Preprocessor took 51.95ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 98.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:24:00,359 INFO L158 Benchmark]: RCFGBuilder took 507.60ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 67.2MB in the end (delta: 31.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 15:24:00,359 INFO L158 Benchmark]: TraceAbstraction took 7849.28ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 66.7MB in the beginning and 280.3MB in the end (delta: -213.7MB). Peak memory consumption was 132.5MB. Max. memory is 16.1GB. [2025-01-09 15:24:00,359 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 327.2MB. Free memory was 280.3MB in the beginning and 280.3MB in the end (delta: 66.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:24:00,360 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.65ms. Allocated memory is still 192.9MB. Free memory is still 111.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.93ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 106.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.10ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 102.6MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.95ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 98.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 507.60ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 67.2MB in the end (delta: 31.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7849.28ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 66.7MB in the beginning and 280.3MB in the end (delta: -213.7MB). Peak memory consumption was 132.5MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 327.2MB. Free memory was 280.3MB in the beginning and 280.3MB in the end (delta: 66.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L25-L27] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L25-L27] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L25-L27] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L25-L27] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L28-L30] float float_Array_0[1] = { 9.8 }; [L28-L30] float float_Array_0[1] = { 9.8 }; [L31-L33] signed char signed_char_Array_0[2] = { 2, 25 }; [L31-L33] signed char signed_char_Array_0[2] = { 2, 25 }; [L31-L33] signed char signed_char_Array_0[2] = { 2, 25 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 10, 16 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 10, 16 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 10, 16 }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L99] isInitial = 1 [L100] FCALL initially() [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L72] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] double_Array_0[0] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] double_Array_0[1] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[1] [L84] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L84] EXPR double_Array_0[1] [L84] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] RET updateVariables() [L104] CALL step() [L40] EXPR double_Array_0[0] [L40] float_Array_0[0] = double_Array_0[0] [L41] EXPR signed_char_Array_0[0] [L41] signed_char_Array_0[1] = signed_char_Array_0[0] [L42] signed long int stepLocal_0 = -4; [L43] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L43] COND FALSE !(stepLocal_0 >= signed_char_Array_0[1]) [L46] EXPR unsigned_char_Array_0[0] [L46] unsigned char stepLocal_2 = unsigned_char_Array_0[0]; [L47] BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L47] COND FALSE !(BOOL_unsigned_char_Array_0[0][0]) [L56] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L56] EXPR ((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1]) [L56] EXPR unsigned_char_Array_0[1] [L56] EXPR ((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, stepLocal_2=254, unsigned_char_Array_0={8:0}] [L56] signed long int stepLocal_1 = (((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])); [L57] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L57] COND FALSE !((8 * unsigned_char_Array_0[1]) == stepLocal_1) [L68] EXPR BOOL_unsigned_char_Array_0[1][0] [L68] BOOL_unsigned_char_Array_0[1][1] = BOOL_unsigned_char_Array_0[1][0] [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 [L95] EXPR (-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) [L95] EXPR unsigned_char_Array_0[1] [L95] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1]) [L95] EXPR unsigned_char_Array_0[1] [L95] EXPR ((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) [L95] EXPR BOOL_unsigned_char_Array_0[1][1] [L95] EXPR BOOL_unsigned_char_Array_0[1][0] [L95] EXPR ((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1) [L95] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1 [L95] EXPR BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0])) [L95] EXPR float_Array_0[0] [L95] EXPR double_Array_0[0] [L95] EXPR ((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95-L96] return (((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 14, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1274 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1269 mSDsluCounter, 11452 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8952 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1467 IncrementalHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 2500 mSDtfsCounter, 1467 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 546 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=810occurred in iteration=11, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 516 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1927 NumberOfCodeBlocks, 1927 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1800 ConstructedInterpolants, 0 QuantifiedInterpolants, 3451 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1475 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 4367/4488 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-01-09 15:24:00,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.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 2f657570a1e1457f1f304b0d552f8742bb723e9b2810b7fa1033cb000332d16c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:24:02,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:24:02,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:24:02,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:24:02,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:24:02,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:24:02,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:24:02,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:24:02,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:24:02,340 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:24:02,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:24:02,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:24:02,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:24:02,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:24:02,343 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:24:02,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:24:02,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:24:02,343 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:24:02,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:24:02,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:24:02,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:24:02,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:24:02,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:24:02,344 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:24:02,344 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:24:02,344 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:24:02,344 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:24:02,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:24:02,344 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:24:02,344 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:24:02,344 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:24:02,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:24:02,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:24:02,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:24:02,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:24:02,344 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:24:02,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:24:02,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:24:02,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:24:02,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:24:02,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:24:02,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:24:02,345 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:24:02,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:24:02,345 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:24:02,345 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:24:02,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:24:02,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:24:02,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:24:02,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:24:02,345 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 -> 2f657570a1e1457f1f304b0d552f8742bb723e9b2810b7fa1033cb000332d16c [2025-01-09 15:24:02,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:24:02,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:24:02,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:24:02,605 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:24:02,605 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:24:02,608 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-a_file-54.i [2025-01-09 15:24:03,770 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/595f071e6/4dea95e3ad004998831cc74c9e24c199/FLAG2d228baed [2025-01-09 15:24:03,968 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:24:03,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i [2025-01-09 15:24:03,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/595f071e6/4dea95e3ad004998831cc74c9e24c199/FLAG2d228baed [2025-01-09 15:24:04,341 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/595f071e6/4dea95e3ad004998831cc74c9e24c199 [2025-01-09 15:24:04,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:24:04,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:24:04,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:24:04,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:24:04,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:24:04,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:24:04" (1/1) ... [2025-01-09 15:24:04,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2201fb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:04, skipping insertion in model container [2025-01-09 15:24:04,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:24:04" (1/1) ... [2025-01-09 15:24:04,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:24:04,460 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-a_file-54.i[916,929] [2025-01-09 15:24:04,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:24:04,515 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:24:04,523 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-a_file-54.i[916,929] [2025-01-09 15:24:04,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:24:04,569 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:24:04,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:04 WrapperNode [2025-01-09 15:24:04,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:24:04,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:24:04,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:24:04,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:24:04,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:04" (1/1) ... [2025-01-09 15:24:04,598 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:04" (1/1) ... [2025-01-09 15:24:04,638 INFO L138 Inliner]: procedures = 33, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 466 [2025-01-09 15:24:04,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:24:04,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:24:04,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:24:04,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:24:04,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:04" (1/1) ... [2025-01-09 15:24:04,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:04" (1/1) ... [2025-01-09 15:24:04,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:04" (1/1) ... [2025-01-09 15:24:04,680 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 33, 41, 7, 13, 19]. 36 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 3, 1, 2, 2]. The 16 writes are split as follows [0, 7, 4, 1, 2, 2]. [2025-01-09 15:24:04,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:04" (1/1) ... [2025-01-09 15:24:04,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:04" (1/1) ... [2025-01-09 15:24:04,709 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:04" (1/1) ... [2025-01-09 15:24:04,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:04" (1/1) ... [2025-01-09 15:24:04,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:04" (1/1) ... [2025-01-09 15:24:04,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:04" (1/1) ... [2025-01-09 15:24:04,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:04" (1/1) ... [2025-01-09 15:24:04,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:24:04,742 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:24:04,742 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:24:04,742 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:24:04,743 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:04" (1/1) ... [2025-01-09 15:24:04,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:24:04,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:24:04,774 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-01-09 15:24:04,776 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-01-09 15:24:04,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:24:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:24:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:24:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-01-09 15:24:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-01-09 15:24:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-01-09 15:24:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-01-09 15:24:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:24:04,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:24:04,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-01-09 15:24:04,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-01-09 15:24:04,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-01-09 15:24:04,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-01-09 15:24:04,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:24:04,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:24:04,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:24:04,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:24:04,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:24:04,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:24:04,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:24:04,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:24:04,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:24:04,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:24:04,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:24:04,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:24:04,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:24:04,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:24:04,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 15:24:04,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 15:24:04,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 15:24:04,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-01-09 15:24:04,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:24:04,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:24:04,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-01-09 15:24:04,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-01-09 15:24:04,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-01-09 15:24:04,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-01-09 15:24:04,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:24:04,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:24:04,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-01-09 15:24:04,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-01-09 15:24:04,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-01-09 15:24:04,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-01-09 15:24:04,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 15:24:04,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 15:24:04,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 15:24:04,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 15:24:04,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 15:24:04,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-01-09 15:24:04,808 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:24:04,808 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:24:04,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:24:04,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:24:04,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:24:04,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:24:04,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:24:04,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:24:04,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:24:04,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:24:04,965 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:24:04,967 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:24:06,123 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2025-01-09 15:24:06,123 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:24:06,132 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:24:06,134 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:24:06,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:24:06 BoogieIcfgContainer [2025-01-09 15:24:06,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:24:06,136 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:24:06,136 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:24:06,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:24:06,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:24:04" (1/3) ... [2025-01-09 15:24:06,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254c4f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:24:06, skipping insertion in model container [2025-01-09 15:24:06,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:04" (2/3) ... [2025-01-09 15:24:06,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254c4f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:24:06, skipping insertion in model container [2025-01-09 15:24:06,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:24:06" (3/3) ... [2025-01-09 15:24:06,144 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-54.i [2025-01-09 15:24:06,156 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:24:06,158 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-54.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:24:06,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:24:06,220 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;@25fa0583, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:24:06,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:24:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:24:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 15:24:06,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:06,235 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:24:06,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:06,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:06,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1621578330, now seen corresponding path program 1 times [2025-01-09 15:24:06,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:24:06,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051528276] [2025-01-09 15:24:06,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:06,255 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-01-09 15:24:06,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:24:06,258 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-01-09 15:24:06,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 15:24:06,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 15:24:06,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 15:24:06,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:06,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:06,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:24:06,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:06,624 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-01-09 15:24:06,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:06,625 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:24:06,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051528276] [2025-01-09 15:24:06,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051528276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:06,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:06,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:24:06,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776160473] [2025-01-09 15:24:06,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:06,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:24:06,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:24:06,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:24:06,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:24:06,645 INFO L87 Difference]: Start difference. First operand has 109 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:24:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:06,669 INFO L93 Difference]: Finished difference Result 212 states and 327 transitions. [2025-01-09 15:24:06,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:24:06,673 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-01-09 15:24:06,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:06,680 INFO L225 Difference]: With dead ends: 212 [2025-01-09 15:24:06,680 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 15:24:06,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-01-09 15:24:06,686 INFO L435 NwaCegarLoop]: 155 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, 155 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-01-09 15:24:06,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:24:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 15:24:06,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-01-09 15:24:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:24:06,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2025-01-09 15:24:06,716 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 105 [2025-01-09 15:24:06,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:06,717 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2025-01-09 15:24:06,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:24:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2025-01-09 15:24:06,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 15:24:06,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:06,723 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:24:06,733 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-01-09 15:24:06,925 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-01-09 15:24:06,927 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:06,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:06,928 INFO L85 PathProgramCache]: Analyzing trace with hash 59399430, now seen corresponding path program 1 times [2025-01-09 15:24:06,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:24:06,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689183854] [2025-01-09 15:24:06,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:06,929 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-01-09 15:24:06,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:24:06,932 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-01-09 15:24:06,935 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-01-09 15:24:07,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 15:24:07,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 15:24:07,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:07,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:07,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:24:07,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:07,325 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:24:07,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:07,325 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:24:07,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689183854] [2025-01-09 15:24:07,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689183854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:07,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:07,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:24:07,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815862641] [2025-01-09 15:24:07,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:07,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:24:07,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:24:07,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:24:07,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:24:07,327 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:07,374 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2025-01-09 15:24:07,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:24:07,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-01-09 15:24:07,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:07,376 INFO L225 Difference]: With dead ends: 211 [2025-01-09 15:24:07,376 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 15:24:07,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 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-01-09 15:24:07,380 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:07,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:24:07,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 15:24:07,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-01-09 15:24:07,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:24:07,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2025-01-09 15:24:07,390 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 105 [2025-01-09 15:24:07,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:07,391 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2025-01-09 15:24:07,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:07,391 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2025-01-09 15:24:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 15:24:07,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:07,396 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:24:07,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:24:07,601 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-01-09 15:24:07,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:07,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:07,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2060910239, now seen corresponding path program 1 times [2025-01-09 15:24:07,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:24:07,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885294327] [2025-01-09 15:24:07,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:07,603 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-01-09 15:24:07,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:24:07,605 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-01-09 15:24:07,606 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-01-09 15:24:07,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 15:24:07,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 15:24:07,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:07,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:07,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:24:07,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:24:07,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:07,922 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:24:07,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885294327] [2025-01-09 15:24:07,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885294327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:07,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:07,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:24:07,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739187056] [2025-01-09 15:24:07,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:07,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:24:07,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:24:07,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:24:07,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:24:07,923 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:08,179 INFO L93 Difference]: Finished difference Result 218 states and 318 transitions. [2025-01-09 15:24:08,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:24:08,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-01-09 15:24:08,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:08,182 INFO L225 Difference]: With dead ends: 218 [2025-01-09 15:24:08,182 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 15:24:08,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:24:08,183 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 584 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:08,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 584 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:24:08,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 15:24:08,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-01-09 15:24:08,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:24:08,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2025-01-09 15:24:08,199 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 107 [2025-01-09 15:24:08,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:08,200 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2025-01-09 15:24:08,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:08,200 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2025-01-09 15:24:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 15:24:08,203 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:08,203 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:24:08,214 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-01-09 15:24:08,403 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-01-09 15:24:08,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:08,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:08,405 INFO L85 PathProgramCache]: Analyzing trace with hash -285902877, now seen corresponding path program 1 times [2025-01-09 15:24:08,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:24:08,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946552476] [2025-01-09 15:24:08,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:08,405 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-01-09 15:24:08,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:24:08,407 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-01-09 15:24:08,408 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-01-09 15:24:08,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 15:24:08,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 15:24:08,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:08,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:08,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:24:08,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:24:08,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:08,679 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:24:08,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946552476] [2025-01-09 15:24:08,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946552476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:08,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:08,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:24:08,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686985442] [2025-01-09 15:24:08,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:08,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:24:08,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:24:08,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:24:08,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:24:08,681 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:08,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:08,791 INFO L93 Difference]: Finished difference Result 224 states and 323 transitions. [2025-01-09 15:24:08,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:24:08,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-01-09 15:24:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:08,792 INFO L225 Difference]: With dead ends: 224 [2025-01-09 15:24:08,794 INFO L226 Difference]: Without dead ends: 115 [2025-01-09 15:24:08,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 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-01-09 15:24:08,795 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:08,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 724 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:24:08,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-09 15:24:08,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-01-09 15:24:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:24:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2025-01-09 15:24:08,805 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 107 [2025-01-09 15:24:08,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:08,807 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2025-01-09 15:24:08,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2025-01-09 15:24:08,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 15:24:08,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:08,808 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:24:08,816 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-01-09 15:24:09,008 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-01-09 15:24:09,009 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:09,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:09,009 INFO L85 PathProgramCache]: Analyzing trace with hash -284055835, now seen corresponding path program 1 times [2025-01-09 15:24:09,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:24:09,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178272658] [2025-01-09 15:24:09,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:09,010 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-01-09 15:24:09,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:24:09,012 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-01-09 15:24:09,014 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-01-09 15:24:09,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 15:24:09,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 15:24:09,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:09,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:09,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:24:09,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:09,307 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 23 treesize of output 11 [2025-01-09 15:24:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:24:09,347 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:09,347 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:24:09,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178272658] [2025-01-09 15:24:09,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178272658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:09,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:09,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:24:09,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086103186] [2025-01-09 15:24:09,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:09,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:24:09,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:24:09,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:24:09,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:24:09,348 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:09,699 INFO L93 Difference]: Finished difference Result 327 states and 470 transitions. [2025-01-09 15:24:09,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:24:09,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-01-09 15:24:09,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:09,701 INFO L225 Difference]: With dead ends: 327 [2025-01-09 15:24:09,703 INFO L226 Difference]: Without dead ends: 216 [2025-01-09 15:24:09,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:24:09,704 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 136 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:09,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 550 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:24:09,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-01-09 15:24:09,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 135. [2025-01-09 15:24:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 121 states have (on average 1.421487603305785) internal successors, (172), 121 states have internal predecessors, (172), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:24:09,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 196 transitions. [2025-01-09 15:24:09,716 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 196 transitions. Word has length 107 [2025-01-09 15:24:09,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:09,718 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 196 transitions. [2025-01-09 15:24:09,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 196 transitions. [2025-01-09 15:24:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:24:09,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:09,719 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:24:09,727 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-01-09 15:24:09,919 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-01-09 15:24:09,920 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:09,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:09,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2046015553, now seen corresponding path program 1 times [2025-01-09 15:24:09,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:24:09,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254919275] [2025-01-09 15:24:09,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:09,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-01-09 15:24:09,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:24:09,923 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-01-09 15:24:09,923 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-01-09 15:24:10,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:24:10,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:24:10,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:10,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:10,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:24:10,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:10,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-01-09 15:24:10,574 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 9 [2025-01-09 15:24:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:24:10,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:10,584 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:24:10,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254919275] [2025-01-09 15:24:10,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254919275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:10,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:10,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:24:10,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751285928] [2025-01-09 15:24:10,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:10,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:24:10,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:24:10,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:24:10,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:24:10,586 INFO L87 Difference]: Start difference. First operand 135 states and 196 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:10,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:10,807 INFO L93 Difference]: Finished difference Result 372 states and 540 transitions. [2025-01-09 15:24:10,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:24:10,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-01-09 15:24:10,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:10,809 INFO L225 Difference]: With dead ends: 372 [2025-01-09 15:24:10,809 INFO L226 Difference]: Without dead ends: 240 [2025-01-09 15:24:10,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:24:10,810 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 94 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:10,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 421 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:24:10,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-01-09 15:24:10,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 236. [2025-01-09 15:24:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 209 states have (on average 1.4066985645933014) internal successors, (294), 209 states have internal predecessors, (294), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:24:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 342 transitions. [2025-01-09 15:24:10,826 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 342 transitions. Word has length 108 [2025-01-09 15:24:10,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:10,826 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 342 transitions. [2025-01-09 15:24:10,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 342 transitions. [2025-01-09 15:24:10,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:24:10,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:10,827 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:24:10,835 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-01-09 15:24:11,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:24:11,028 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:11,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:11,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1431303293, now seen corresponding path program 1 times [2025-01-09 15:24:11,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:24:11,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731293728] [2025-01-09 15:24:11,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:11,029 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-01-09 15:24:11,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:24:11,031 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:24:11,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 15:24:11,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:24:11,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:24:11,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:11,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:11,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:24:11,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:11,322 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 23 treesize of output 11 [2025-01-09 15:24:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:24:11,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:11,341 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:24:11,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731293728] [2025-01-09 15:24:11,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731293728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:11,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:11,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:24:11,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979985003] [2025-01-09 15:24:11,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:11,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:24:11,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:24:11,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:24:11,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:24:11,342 INFO L87 Difference]: Start difference. First operand 236 states and 342 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:11,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:11,958 INFO L93 Difference]: Finished difference Result 589 states and 855 transitions. [2025-01-09 15:24:11,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:24:11,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-01-09 15:24:11,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:11,961 INFO L225 Difference]: With dead ends: 589 [2025-01-09 15:24:11,961 INFO L226 Difference]: Without dead ends: 356 [2025-01-09 15:24:11,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:24:11,962 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 144 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:11,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 539 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:24:11,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-01-09 15:24:11,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 251. [2025-01-09 15:24:11,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 224 states have (on average 1.4107142857142858) internal successors, (316), 224 states have internal predecessors, (316), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:24:11,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 364 transitions. [2025-01-09 15:24:11,973 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 364 transitions. Word has length 108 [2025-01-09 15:24:11,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:11,973 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 364 transitions. [2025-01-09 15:24:11,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:11,973 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 364 transitions. [2025-01-09 15:24:11,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:24:11,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:11,974 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:24:11,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-01-09 15:24:12,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:24:12,178 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:12,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:12,179 INFO L85 PathProgramCache]: Analyzing trace with hash 844497279, now seen corresponding path program 1 times [2025-01-09 15:24:12,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:24:12,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959328262] [2025-01-09 15:24:12,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:12,179 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-01-09 15:24:12,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:24:12,181 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-01-09 15:24:12,184 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-01-09 15:24:12,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:24:12,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:24:12,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:12,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:12,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 15:24:12,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:12,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 15:24:12,818 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 52 treesize of output 24 [2025-01-09 15:24:13,521 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 54 treesize of output 35 [2025-01-09 15:24:13,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:24:13,682 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 71 treesize of output 35 [2025-01-09 15:24:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 100 proven. 48 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-09 15:24:13,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:24:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:24:13,935 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:24:13,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959328262] [2025-01-09 15:24:13,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959328262] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:24:13,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:24:13,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 17 [2025-01-09 15:24:13,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846579000] [2025-01-09 15:24:13,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:13,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:24:13,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:24:13,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:24:13,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:24:13,936 INFO L87 Difference]: Start difference. First operand 251 states and 364 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:14,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:14,781 INFO L93 Difference]: Finished difference Result 623 states and 889 transitions. [2025-01-09 15:24:14,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:24:14,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-01-09 15:24:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:14,785 INFO L225 Difference]: With dead ends: 623 [2025-01-09 15:24:14,786 INFO L226 Difference]: Without dead ends: 375 [2025-01-09 15:24:14,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:24:14,787 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 67 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:14,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 682 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:24:14,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-01-09 15:24:14,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 371. [2025-01-09 15:24:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 338 states have (on average 1.3816568047337279) internal successors, (467), 340 states have internal predecessors, (467), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:24:14,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 523 transitions. [2025-01-09 15:24:14,804 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 523 transitions. Word has length 108 [2025-01-09 15:24:14,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:14,805 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 523 transitions. [2025-01-09 15:24:14,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:14,805 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 523 transitions. [2025-01-09 15:24:14,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:24:14,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:14,806 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:24:14,815 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-01-09 15:24:15,007 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-01-09 15:24:15,007 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:15,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:15,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1887952288, now seen corresponding path program 1 times [2025-01-09 15:24:15,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:24:15,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819345431] [2025-01-09 15:24:15,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:15,008 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-01-09 15:24:15,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:24:15,011 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-01-09 15:24:15,012 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-01-09 15:24:15,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:24:15,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:24:15,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:15,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:15,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 15:24:15,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:15,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2025-01-09 15:24:15,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:24:15,409 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 46 treesize of output 22 [2025-01-09 15:24:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:24:15,477 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:15,477 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:24:15,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819345431] [2025-01-09 15:24:15,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1819345431] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:15,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:15,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:24:15,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240225095] [2025-01-09 15:24:15,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:15,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:24:15,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:24:15,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:24:15,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:24:15,480 INFO L87 Difference]: Start difference. First operand 371 states and 523 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:16,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:16,136 INFO L93 Difference]: Finished difference Result 1040 states and 1466 transitions. [2025-01-09 15:24:16,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:24:16,137 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-01-09 15:24:16,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:16,145 INFO L225 Difference]: With dead ends: 1040 [2025-01-09 15:24:16,145 INFO L226 Difference]: Without dead ends: 672 [2025-01-09 15:24:16,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:24:16,146 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 129 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:16,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1775 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:24:16,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-01-09 15:24:16,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 660. [2025-01-09 15:24:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 599 states have (on average 1.3739565943238732) internal successors, (823), 605 states have internal predecessors, (823), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 46 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:24:16,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 927 transitions. [2025-01-09 15:24:16,181 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 927 transitions. Word has length 109 [2025-01-09 15:24:16,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:16,181 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 927 transitions. [2025-01-09 15:24:16,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:16,182 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 927 transitions. [2025-01-09 15:24:16,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:24:16,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:16,184 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:24:16,201 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-01-09 15:24:16,384 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-01-09 15:24:16,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:16,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:16,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2021965794, now seen corresponding path program 1 times [2025-01-09 15:24:16,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:24:16,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284402482] [2025-01-09 15:24:16,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:16,386 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-01-09 15:24:16,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:24:16,388 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-01-09 15:24:16,389 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-01-09 15:24:16,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:24:16,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:24:16,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:16,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:16,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 15:24:16,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:16,708 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-01-09 15:24:16,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-01-09 15:24:16,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:24:16,788 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 30 treesize of output 16 [2025-01-09 15:24:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:24:16,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:16,934 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:24:16,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284402482] [2025-01-09 15:24:16,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284402482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:16,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:16,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:24:16,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280868416] [2025-01-09 15:24:16,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:16,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:24:16,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:24:16,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:24:16,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:24:16,935 INFO L87 Difference]: Start difference. First operand 660 states and 927 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:17,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:17,926 INFO L93 Difference]: Finished difference Result 1567 states and 2194 transitions. [2025-01-09 15:24:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:24:17,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-01-09 15:24:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:17,931 INFO L225 Difference]: With dead ends: 1567 [2025-01-09 15:24:17,931 INFO L226 Difference]: Without dead ends: 910 [2025-01-09 15:24:17,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:24:17,934 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 246 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:17,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 747 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:24:17,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-01-09 15:24:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 660. [2025-01-09 15:24:17,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 599 states have (on average 1.3672787979966612) internal successors, (819), 605 states have internal predecessors, (819), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 46 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:24:17,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 923 transitions. [2025-01-09 15:24:17,986 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 923 transitions. Word has length 109 [2025-01-09 15:24:17,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:17,987 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 923 transitions. [2025-01-09 15:24:17,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:17,987 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 923 transitions. [2025-01-09 15:24:17,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:24:17,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:17,988 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:24:18,000 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-01-09 15:24:18,188 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-01-09 15:24:18,189 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:18,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:18,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1261884252, now seen corresponding path program 1 times [2025-01-09 15:24:18,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:24:18,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078063158] [2025-01-09 15:24:18,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:18,191 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-01-09 15:24:18,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:24:18,193 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-01-09 15:24:18,194 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-01-09 15:24:18,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:24:18,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:24:18,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:18,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:18,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:24:18,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:18,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 15:24:18,463 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 9 [2025-01-09 15:24:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:24:18,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:18,503 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:24:18,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078063158] [2025-01-09 15:24:18,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078063158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:18,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:18,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:24:18,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374141303] [2025-01-09 15:24:18,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:18,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:24:18,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:24:18,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:24:18,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:24:18,504 INFO L87 Difference]: Start difference. First operand 660 states and 923 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:18,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:18,948 INFO L93 Difference]: Finished difference Result 1874 states and 2617 transitions. [2025-01-09 15:24:18,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:24:18,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-01-09 15:24:18,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:18,955 INFO L225 Difference]: With dead ends: 1874 [2025-01-09 15:24:18,955 INFO L226 Difference]: Without dead ends: 1217 [2025-01-09 15:24:18,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:24:18,957 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 141 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:18,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1531 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:24:18,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-01-09 15:24:18,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 640. [2025-01-09 15:24:18,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 579 states have (on average 1.3730569948186528) internal successors, (795), 585 states have internal predecessors, (795), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 46 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:24:18,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 899 transitions. [2025-01-09 15:24:18,994 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 899 transitions. Word has length 109 [2025-01-09 15:24:18,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:18,994 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 899 transitions. [2025-01-09 15:24:18,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:18,994 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 899 transitions. [2025-01-09 15:24:18,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:24:18,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:18,996 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:24:19,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-01-09 15:24:19,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:24:19,196 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:19,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:19,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1377608847, now seen corresponding path program 1 times [2025-01-09 15:24:19,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:24:19,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637201394] [2025-01-09 15:24:19,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:19,197 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-01-09 15:24:19,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:24:19,199 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:24:19,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-01-09 15:24:19,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:24:19,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:24:19,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:19,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:19,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 15:24:19,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:19,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 15:24:19,701 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 28 treesize of output 23 [2025-01-09 15:24:19,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:24:19,891 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 62 treesize of output 32 [2025-01-09 15:24:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-01-09 15:24:19,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:19,925 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:24:19,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637201394] [2025-01-09 15:24:19,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637201394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:19,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:19,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:24:19,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692274941] [2025-01-09 15:24:19,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:19,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:24:19,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:24:19,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:24:19,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:24:19,926 INFO L87 Difference]: Start difference. First operand 640 states and 899 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:24:20,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:20,359 INFO L93 Difference]: Finished difference Result 714 states and 989 transitions. [2025-01-09 15:24:20,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:24:20,359 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2025-01-09 15:24:20,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:20,364 INFO L225 Difference]: With dead ends: 714 [2025-01-09 15:24:20,364 INFO L226 Difference]: Without dead ends: 712 [2025-01-09 15:24:20,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:24:20,365 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 237 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:20,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 781 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:24:20,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-01-09 15:24:20,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 711. [2025-01-09 15:24:20,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 637 states have (on average 1.34850863422292) internal successors, (859), 644 states have internal predecessors, (859), 60 states have call successors, (60), 13 states have call predecessors, (60), 13 states have return successors, (60), 53 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 15:24:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 979 transitions. [2025-01-09 15:24:20,393 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 979 transitions. Word has length 110 [2025-01-09 15:24:20,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:20,393 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 979 transitions. [2025-01-09 15:24:20,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:24:20,393 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 979 transitions. [2025-01-09 15:24:20,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:24:20,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:20,394 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:24:20,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-01-09 15:24:20,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:24:20,595 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:20,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:20,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1375761805, now seen corresponding path program 1 times [2025-01-09 15:24:20,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:24:20,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497366296] [2025-01-09 15:24:20,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:20,596 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-01-09 15:24:20,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:24:20,598 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-01-09 15:24:20,599 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-01-09 15:24:20,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:24:21,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:24:21,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:21,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:21,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 15:24:21,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:21,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:24:21,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:24:21,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 57 [2025-01-09 15:24:22,555 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-01-09 15:24:32,033 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 203 treesize of output 167 [2025-01-09 15:24:32,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:24:32,059 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 267 treesize of output 117 [2025-01-09 15:24:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 15:24:32,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:32,563 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:24:32,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497366296] [2025-01-09 15:24:32,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497366296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:32,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:32,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:24:32,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810782698] [2025-01-09 15:24:32,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:32,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:24:32,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:24:32,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:24:32,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:24:32,564 INFO L87 Difference]: Start difference. First operand 711 states and 979 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:24:40,136 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 [] [2025-01-09 15:24:44,978 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 [] [2025-01-09 15:24:58,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:58,488 INFO L93 Difference]: Finished difference Result 2599 states and 3563 transitions. [2025-01-09 15:24:58,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:24:58,495 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2025-01-09 15:24:58,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:58,502 INFO L225 Difference]: With dead ends: 2599 [2025-01-09 15:24:58,502 INFO L226 Difference]: Without dead ends: 1922 [2025-01-09 15:24:58,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:24:58,505 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 400 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:58,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 849 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 566 Invalid, 2 Unknown, 0 Unchecked, 23.7s Time] [2025-01-09 15:24:58,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2025-01-09 15:24:58,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1910. [2025-01-09 15:24:58,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1910 states, 1730 states have (on average 1.3416184971098266) internal successors, (2321), 1756 states have internal predecessors, (2321), 146 states have call successors, (146), 33 states have call predecessors, (146), 33 states have return successors, (146), 120 states have call predecessors, (146), 146 states have call successors, (146) [2025-01-09 15:24:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2613 transitions. [2025-01-09 15:24:58,610 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2613 transitions. Word has length 110 [2025-01-09 15:24:58,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:58,611 INFO L471 AbstractCegarLoop]: Abstraction has 1910 states and 2613 transitions. [2025-01-09 15:24:58,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:24:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2613 transitions. [2025-01-09 15:24:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:24:58,614 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:58,614 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:24:58,629 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-01-09 15:24:58,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:24:58,815 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:58,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:58,815 INFO L85 PathProgramCache]: Analyzing trace with hash 399245557, now seen corresponding path program 1 times [2025-01-09 15:24:58,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:24:58,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657778078] [2025-01-09 15:24:58,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:58,816 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-01-09 15:24:58,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:24:58,819 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:24:58,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-01-09 15:24:58,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:24:59,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:24:59,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:59,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:59,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:24:59,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:24:59,070 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:59,070 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:24:59,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657778078] [2025-01-09 15:24:59,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657778078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:59,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:59,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:24:59,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442091528] [2025-01-09 15:24:59,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:59,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:24:59,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:24:59,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:24:59,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:24:59,072 INFO L87 Difference]: Start difference. First operand 1910 states and 2613 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:59,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:59,305 INFO L93 Difference]: Finished difference Result 3848 states and 5259 transitions. [2025-01-09 15:24:59,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:24:59,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-01-09 15:24:59,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:59,321 INFO L225 Difference]: With dead ends: 3848 [2025-01-09 15:24:59,321 INFO L226 Difference]: Without dead ends: 1982 [2025-01-09 15:24:59,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:24:59,323 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:59,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 588 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:24:59,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2025-01-09 15:24:59,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1982. [2025-01-09 15:24:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1802 states have (on average 1.327968923418424) internal successors, (2393), 1828 states have internal predecessors, (2393), 146 states have call successors, (146), 33 states have call predecessors, (146), 33 states have return successors, (146), 120 states have call predecessors, (146), 146 states have call successors, (146) [2025-01-09 15:24:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2685 transitions. [2025-01-09 15:24:59,404 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 2685 transitions. Word has length 110 [2025-01-09 15:24:59,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:59,404 INFO L471 AbstractCegarLoop]: Abstraction has 1982 states and 2685 transitions. [2025-01-09 15:24:59,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:24:59,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2685 transitions. [2025-01-09 15:24:59,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:24:59,407 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:59,407 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:24:59,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-01-09 15:24:59,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:24:59,608 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:59,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:59,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1868387979, now seen corresponding path program 1 times [2025-01-09 15:24:59,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:24:59,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273911278] [2025-01-09 15:24:59,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:59,608 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-01-09 15:24:59,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:24:59,610 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-01-09 15:24:59,611 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-01-09 15:24:59,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:24:59,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:24:59,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:59,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:59,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:24:59,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:59,881 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 15:24:59,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:59,882 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:24:59,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273911278] [2025-01-09 15:24:59,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273911278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:59,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:59,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:24:59,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282872044] [2025-01-09 15:24:59,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:59,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:24:59,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:24:59,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:24:59,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:24:59,884 INFO L87 Difference]: Start difference. First operand 1982 states and 2685 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:00,134 INFO L93 Difference]: Finished difference Result 3928 states and 5320 transitions. [2025-01-09 15:25:00,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:25:00,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2025-01-09 15:25:00,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:00,145 INFO L225 Difference]: With dead ends: 3928 [2025-01-09 15:25:00,145 INFO L226 Difference]: Without dead ends: 1982 [2025-01-09 15:25:00,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 107 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-01-09 15:25:00,147 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:00,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:25:00,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2025-01-09 15:25:00,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1982. [2025-01-09 15:25:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1802 states have (on average 1.3251942286348501) internal successors, (2388), 1828 states have internal predecessors, (2388), 146 states have call successors, (146), 33 states have call predecessors, (146), 33 states have return successors, (146), 120 states have call predecessors, (146), 146 states have call successors, (146) [2025-01-09 15:25:00,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2680 transitions. [2025-01-09 15:25:00,210 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 2680 transitions. Word has length 110 [2025-01-09 15:25:00,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:00,211 INFO L471 AbstractCegarLoop]: Abstraction has 1982 states and 2680 transitions. [2025-01-09 15:25:00,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2680 transitions. [2025-01-09 15:25:00,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 15:25:00,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:00,213 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:25:00,221 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-01-09 15:25:00,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:25:00,414 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:00,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:00,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1170276905, now seen corresponding path program 1 times [2025-01-09 15:25:00,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:00,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389569909] [2025-01-09 15:25:00,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:00,415 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-01-09 15:25:00,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:00,417 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:25:00,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-01-09 15:25:00,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:25:00,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:25:00,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:00,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:00,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 15:25:00,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:00,697 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 16 [2025-01-09 15:25:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:00,730 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:00,730 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:00,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389569909] [2025-01-09 15:25:00,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389569909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:00,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:00,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:25:00,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700744418] [2025-01-09 15:25:00,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:00,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:25:00,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:00,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:25:00,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:25:00,731 INFO L87 Difference]: Start difference. First operand 1982 states and 2680 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:00,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:00,955 INFO L93 Difference]: Finished difference Result 3554 states and 4790 transitions. [2025-01-09 15:25:00,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:25:00,956 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-01-09 15:25:00,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:00,961 INFO L225 Difference]: With dead ends: 3554 [2025-01-09 15:25:00,961 INFO L226 Difference]: Without dead ends: 1616 [2025-01-09 15:25:00,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:25:00,964 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:00,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 567 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:25:00,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2025-01-09 15:25:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1616. [2025-01-09 15:25:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1448 states have (on average 1.3087016574585635) internal successors, (1895), 1468 states have internal predecessors, (1895), 134 states have call successors, (134), 33 states have call predecessors, (134), 33 states have return successors, (134), 114 states have call predecessors, (134), 134 states have call successors, (134) [2025-01-09 15:25:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2163 transitions. [2025-01-09 15:25:01,028 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2163 transitions. Word has length 111 [2025-01-09 15:25:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:01,029 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2163 transitions. [2025-01-09 15:25:01,029 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2163 transitions. [2025-01-09 15:25:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:25:01,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:01,030 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:25:01,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 (17)] Ended with exit code 0 [2025-01-09 15:25:01,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:25:01,231 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:01,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:01,231 INFO L85 PathProgramCache]: Analyzing trace with hash 4134418, now seen corresponding path program 1 times [2025-01-09 15:25:01,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:01,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031995891] [2025-01-09 15:25:01,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:01,232 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-01-09 15:25:01,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:01,233 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-01-09 15:25:01,234 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-01-09 15:25:01,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:25:01,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:25:01,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:01,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:01,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:25:01,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:01,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 15:25:01,648 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 32 treesize of output 27 [2025-01-09 15:25:01,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:01,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2025-01-09 15:25:02,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:02,245 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 27 treesize of output 13 [2025-01-09 15:25:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-01-09 15:25:02,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:25:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 15:25:02,462 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:02,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031995891] [2025-01-09 15:25:02,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031995891] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:25:02,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:25:02,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2025-01-09 15:25:02,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139954175] [2025-01-09 15:25:02,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:25:02,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:25:02,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:02,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:25:02,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:25:02,463 INFO L87 Difference]: Start difference. First operand 1616 states and 2163 transitions. Second operand has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 6 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-09 15:25:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:03,430 INFO L93 Difference]: Finished difference Result 2776 states and 3666 transitions. [2025-01-09 15:25:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:25:03,431 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 6 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 6 states have call successors, (24) Word has length 112 [2025-01-09 15:25:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:03,436 INFO L225 Difference]: With dead ends: 2776 [2025-01-09 15:25:03,436 INFO L226 Difference]: Without dead ends: 1204 [2025-01-09 15:25:03,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:25:03,438 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 349 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:03,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 485 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:25:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2025-01-09 15:25:03,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 956. [2025-01-09 15:25:03,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 828 states have (on average 1.2741545893719808) internal successors, (1055), 838 states have internal predecessors, (1055), 98 states have call successors, (98), 29 states have call predecessors, (98), 29 states have return successors, (98), 88 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 15:25:03,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1251 transitions. [2025-01-09 15:25:03,497 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1251 transitions. Word has length 112 [2025-01-09 15:25:03,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:03,497 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1251 transitions. [2025-01-09 15:25:03,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 6 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-09 15:25:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1251 transitions. [2025-01-09 15:25:03,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:25:03,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:03,499 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:25:03,508 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 (18)] Forceful destruction successful, exit code 0 [2025-01-09 15:25:03,699 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-01-09 15:25:03,699 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:03,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash -589779514, now seen corresponding path program 1 times [2025-01-09 15:25:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:03,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396544795] [2025-01-09 15:25:03,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:03,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:25:03,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:03,702 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-01-09 15:25:03,702 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-01-09 15:25:03,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:25:03,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:25:03,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:03,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:03,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:25:03,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:03,980 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 36 treesize of output 18 [2025-01-09 15:25:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:04,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:04,005 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:04,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396544795] [2025-01-09 15:25:04,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396544795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:04,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:04,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:25:04,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135976191] [2025-01-09 15:25:04,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:04,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:25:04,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:04,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:25:04,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:04,006 INFO L87 Difference]: Start difference. First operand 956 states and 1251 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:04,484 INFO L93 Difference]: Finished difference Result 1832 states and 2385 transitions. [2025-01-09 15:25:04,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:25:04,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2025-01-09 15:25:04,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:04,489 INFO L225 Difference]: With dead ends: 1832 [2025-01-09 15:25:04,489 INFO L226 Difference]: Without dead ends: 920 [2025-01-09 15:25:04,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:25:04,490 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 107 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:04,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 687 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:25:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-01-09 15:25:04,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 908. [2025-01-09 15:25:04,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 780 states have (on average 1.2602564102564102) internal successors, (983), 790 states have internal predecessors, (983), 98 states have call successors, (98), 29 states have call predecessors, (98), 29 states have return successors, (98), 88 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 15:25:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1179 transitions. [2025-01-09 15:25:04,581 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1179 transitions. Word has length 112 [2025-01-09 15:25:04,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:04,581 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1179 transitions. [2025-01-09 15:25:04,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:04,582 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1179 transitions. [2025-01-09 15:25:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:25:04,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:04,583 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:25:04,591 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-01-09 15:25:04,783 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-01-09 15:25:04,784 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:04,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:04,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1596446247, now seen corresponding path program 1 times [2025-01-09 15:25:04,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:04,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301675179] [2025-01-09 15:25:04,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:04,785 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-01-09 15:25:04,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:04,786 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-01-09 15:25:04,787 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-01-09 15:25:04,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:25:05,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:25:05,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:05,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:05,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 15:25:05,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:05,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:25:06,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:06,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 55 [2025-01-09 15:25:07,357 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-01-09 15:25:17,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 167 [2025-01-09 15:25:17,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:17,506 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 265 treesize of output 115 [2025-01-09 15:25:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 15:25:18,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:25:25,889 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:25,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301675179] [2025-01-09 15:25:25,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301675179] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:25:25,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [781385039] [2025-01-09 15:25:25,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:25,889 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:25:25,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:25:25,891 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-01-09 15:25:25,892 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-01-09 15:25:26,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes.