./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-18.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 34c00af4b4663198525b0b7086d994deb20901b2017b1e6c2fe4ceb71d985d42 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:12:20,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:12:20,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:12:20,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:12:20,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:12:20,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:12:20,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:12:20,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:12:20,935 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:12:20,936 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:12:20,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:12:20,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:12:20,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:12:20,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:12:20,937 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:12:20,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:12:20,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:12:20,937 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:12:20,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:12:20,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:12:20,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:12:20,938 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:12:20,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:12:20,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:12:20,938 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:12:20,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:12:20,938 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:12:20,938 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:12:20,938 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:12:20,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:12:20,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:12:20,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:12:20,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:12:20,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:12:20,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:12:20,939 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:12:20,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:12:20,939 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:12:20,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:12:20,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:12:20,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:12:20,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:12:20,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:12:20,940 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 -> 34c00af4b4663198525b0b7086d994deb20901b2017b1e6c2fe4ceb71d985d42 [2025-02-06 03:12:21,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:12:21,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:12:21,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:12:21,214 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:12:21,214 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:12:21,216 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-18.i [2025-02-06 03:12:22,442 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d93035fb0/b1b2c238fc764b78925b9e89ef1301ac/FLAG4918e9be1 [2025-02-06 03:12:22,767 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:12:22,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-18.i [2025-02-06 03:12:22,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d93035fb0/b1b2c238fc764b78925b9e89ef1301ac/FLAG4918e9be1 [2025-02-06 03:12:22,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d93035fb0/b1b2c238fc764b78925b9e89ef1301ac [2025-02-06 03:12:22,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:12:22,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:12:22,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:12:22,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:12:22,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:12:22,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:12:22" (1/1) ... [2025-02-06 03:12:22,835 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@91113e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:22, skipping insertion in model container [2025-02-06 03:12:22,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:12:22" (1/1) ... [2025-02-06 03:12:22,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:12:22,971 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-18.i[916,929] [2025-02-06 03:12:23,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:12:23,045 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:12:23,054 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-18.i[916,929] [2025-02-06 03:12:23,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:12:23,111 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:12:23,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:23 WrapperNode [2025-02-06 03:12:23,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:12:23,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:12:23,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:12:23,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:12:23,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:23" (1/1) ... [2025-02-06 03:12:23,129 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:23" (1/1) ... [2025-02-06 03:12:23,165 INFO L138 Inliner]: procedures = 29, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 478 [2025-02-06 03:12:23,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:12:23,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:12:23,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:12:23,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:12:23,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:23" (1/1) ... [2025-02-06 03:12:23,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:23" (1/1) ... [2025-02-06 03:12:23,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:23" (1/1) ... [2025-02-06 03:12:23,213 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 6, 29, 22, 46, 10]. 40 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 2, 3, 1]. The 13 writes are split as follows [0, 1, 4, 2, 4, 2]. [2025-02-06 03:12:23,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:23" (1/1) ... [2025-02-06 03:12:23,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:23" (1/1) ... [2025-02-06 03:12:23,236 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:23" (1/1) ... [2025-02-06 03:12:23,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:23" (1/1) ... [2025-02-06 03:12:23,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:23" (1/1) ... [2025-02-06 03:12:23,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:23" (1/1) ... [2025-02-06 03:12:23,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:12:23,254 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:12:23,254 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:12:23,254 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:12:23,255 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:23" (1/1) ... [2025-02-06 03:12:23,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:12:23,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:12:23,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:12:23,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:12:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:12:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:12:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:12:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:12:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:12:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:12:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:12:23,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:12:23,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:12:23,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:12:23,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:12:23,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:12:23,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:12:23,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:12:23,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:12:23,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:12:23,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:12:23,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:12:23,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:12:23,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:12:23,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:12:23,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:12:23,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:12:23,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:12:23,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:12:23,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:12:23,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:12:23,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:12:23,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:12:23,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:12:23,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:12:23,314 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:12:23,315 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:12:23,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:12:23,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:12:23,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:12:23,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:12:23,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:12:23,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:12:23,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:12:23,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:12:23,441 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:12:23,443 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:12:23,821 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~mem80#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~ite79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~bitwise81#1;havoc property_#t~mem82#1;havoc property_#t~ite95#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite91#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem94#1;havoc property_#t~mem96#1;havoc property_#t~ite108#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite107#1;havoc property_#t~mem104#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~bitwise112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite125#1;havoc property_#t~mem118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short119#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~short126#1; [2025-02-06 03:12:23,874 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2025-02-06 03:12:23,874 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:12:23,903 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:12:23,903 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:12:23,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:12:23 BoogieIcfgContainer [2025-02-06 03:12:23,905 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:12:23,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:12:23,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:12:23,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:12:23,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:12:22" (1/3) ... [2025-02-06 03:12:23,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa5a0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:12:23, skipping insertion in model container [2025-02-06 03:12:23,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:23" (2/3) ... [2025-02-06 03:12:23,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa5a0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:12:23, skipping insertion in model container [2025-02-06 03:12:23,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:12:23" (3/3) ... [2025-02-06 03:12:23,912 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-18.i [2025-02-06 03:12:23,923 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:12:23,924 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-18.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:12:23,962 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:12:23,971 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;@34d047cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:12:23,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:12:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 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-02-06 03:12:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 03:12:23,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:23,982 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-02-06 03:12:23,982 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:23,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:23,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1492351654, now seen corresponding path program 1 times [2025-02-06 03:12:23,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:23,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447100988] [2025-02-06 03:12:23,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:23,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:24,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 03:12:24,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 03:12:24,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:24,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:24,224 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-06 03:12:24,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:24,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447100988] [2025-02-06 03:12:24,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447100988] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:12:24,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785370737] [2025-02-06 03:12:24,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:24,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:12:24,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:12:24,227 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:12:24,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:12:24,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 03:12:24,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 03:12:24,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:24,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:24,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:12:24,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:12:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-06 03:12:24,427 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:12:24,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785370737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:24,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:12:24,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:12:24,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502599066] [2025-02-06 03:12:24,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:24,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:12:24,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:24,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:12:24,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:12:24,443 INFO L87 Difference]: Start difference. First operand has 107 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 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), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:24,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:24,468 INFO L93 Difference]: Finished difference Result 208 states and 323 transitions. [2025-02-06 03:12:24,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:12:24,469 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), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2025-02-06 03:12:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:24,473 INFO L225 Difference]: With dead ends: 208 [2025-02-06 03:12:24,473 INFO L226 Difference]: Without dead ends: 104 [2025-02-06 03:12:24,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:12:24,477 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:24,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:12:24,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-06 03:12:24,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-02-06 03:12:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 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-02-06 03:12:24,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2025-02-06 03:12:24,501 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 153 transitions. Word has length 107 [2025-02-06 03:12:24,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:24,501 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 153 transitions. [2025-02-06 03:12:24,501 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), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:24,502 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 153 transitions. [2025-02-06 03:12:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 03:12:24,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:24,504 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-02-06 03:12:24,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:12:24,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:12:24,705 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:24,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:24,706 INFO L85 PathProgramCache]: Analyzing trace with hash -638946256, now seen corresponding path program 1 times [2025-02-06 03:12:24,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:24,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735256465] [2025-02-06 03:12:24,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:24,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:24,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 03:12:24,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 03:12:24,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:24,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:25,390 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:25,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:25,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735256465] [2025-02-06 03:12:25,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735256465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:25,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:25,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:12:25,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52095996] [2025-02-06 03:12:25,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:25,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:12:25,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:25,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:12:25,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:12:25,395 INFO L87 Difference]: Start difference. First operand 104 states and 153 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-02-06 03:12:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:25,632 INFO L93 Difference]: Finished difference Result 306 states and 453 transitions. [2025-02-06 03:12:25,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:12:25,633 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-02-06 03:12:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:25,634 INFO L225 Difference]: With dead ends: 306 [2025-02-06 03:12:25,636 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 03:12:25,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-02-06 03:12:25,637 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 115 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:25,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 553 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:12:25,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 03:12:25,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2025-02-06 03:12:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 173 states have (on average 1.4335260115606936) internal successors, (248), 173 states have internal predecessors, (248), 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-02-06 03:12:25,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 296 transitions. [2025-02-06 03:12:25,665 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 296 transitions. Word has length 107 [2025-02-06 03:12:25,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:25,665 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 296 transitions. [2025-02-06 03:12:25,665 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-02-06 03:12:25,665 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 296 transitions. [2025-02-06 03:12:25,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:12:25,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:25,669 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-02-06 03:12:25,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:12:25,670 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:25,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:25,670 INFO L85 PathProgramCache]: Analyzing trace with hash 888590489, now seen corresponding path program 1 times [2025-02-06 03:12:25,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:25,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424812464] [2025-02-06 03:12:25,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:25,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:25,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:12:25,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:12:25,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:25,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:26,022 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:26,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:26,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424812464] [2025-02-06 03:12:26,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424812464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:26,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:26,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:12:26,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988396364] [2025-02-06 03:12:26,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:26,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:12:26,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:26,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:12:26,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:12:26,024 INFO L87 Difference]: Start difference. First operand 200 states and 296 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-02-06 03:12:26,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:26,101 INFO L93 Difference]: Finished difference Result 303 states and 449 transitions. [2025-02-06 03:12:26,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:12:26,101 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-02-06 03:12:26,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:26,103 INFO L225 Difference]: With dead ends: 303 [2025-02-06 03:12:26,103 INFO L226 Difference]: Without dead ends: 202 [2025-02-06 03:12:26,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:12:26,104 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 5 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:26,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 516 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:26,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-06 03:12:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2025-02-06 03:12:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 174 states have (on average 1.4310344827586208) internal successors, (249), 174 states have internal predecessors, (249), 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-02-06 03:12:26,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 297 transitions. [2025-02-06 03:12:26,131 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 297 transitions. Word has length 108 [2025-02-06 03:12:26,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:26,131 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 297 transitions. [2025-02-06 03:12:26,131 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-02-06 03:12:26,132 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 297 transitions. [2025-02-06 03:12:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:12:26,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:26,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] [2025-02-06 03:12:26,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:12:26,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:26,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:26,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2053067110, now seen corresponding path program 1 times [2025-02-06 03:12:26,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:26,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615522991] [2025-02-06 03:12:26,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:26,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:26,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:12:26,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:12:26,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:26,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:27,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:27,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615522991] [2025-02-06 03:12:27,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615522991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:27,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:27,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:12:27,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365930312] [2025-02-06 03:12:27,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:27,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:12:27,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:27,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:12:27,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:12:27,474 INFO L87 Difference]: Start difference. First operand 201 states and 297 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:29,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:29,131 INFO L93 Difference]: Finished difference Result 533 states and 789 transitions. [2025-02-06 03:12:29,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 03:12:29,131 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2025-02-06 03:12:29,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:29,133 INFO L225 Difference]: With dead ends: 533 [2025-02-06 03:12:29,133 INFO L226 Difference]: Without dead ends: 431 [2025-02-06 03:12:29,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:12:29,137 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1065 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:29,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 936 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 03:12:29,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-02-06 03:12:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 397. [2025-02-06 03:12:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 344 states have (on average 1.433139534883721) internal successors, (493), 344 states have internal predecessors, (493), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 03:12:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 589 transitions. [2025-02-06 03:12:29,179 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 589 transitions. Word has length 108 [2025-02-06 03:12:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:29,180 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 589 transitions. [2025-02-06 03:12:29,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 589 transitions. [2025-02-06 03:12:29,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:12:29,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:29,181 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-02-06 03:12:29,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:12:29,183 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:29,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:29,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1923984391, now seen corresponding path program 1 times [2025-02-06 03:12:29,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:29,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591046166] [2025-02-06 03:12:29,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:29,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:29,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:12:29,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:12:29,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:29,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-02-06 03:12:29,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:29,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591046166] [2025-02-06 03:12:29,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591046166] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:12:29,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502326766] [2025-02-06 03:12:29,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:29,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:12:29,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:12:29,676 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:12:29,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:12:29,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:12:29,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:12:29,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:29,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:29,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 03:12:29,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:12:29,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:12:30,037 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-02-06 03:12:30,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:12:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-06 03:12:30,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:12:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-02-06 03:12:30,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502326766] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:12:30,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:12:30,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 26 [2025-02-06 03:12:30,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049817223] [2025-02-06 03:12:30,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:12:30,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 03:12:30,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:30,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 03:12:30,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2025-02-06 03:12:30,366 INFO L87 Difference]: Start difference. First operand 397 states and 589 transitions. Second operand has 26 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 25 states have internal predecessors, (88), 6 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:12:31,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:31,446 INFO L93 Difference]: Finished difference Result 931 states and 1365 transitions. [2025-02-06 03:12:31,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 03:12:31,447 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 25 states have internal predecessors, (88), 6 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 6 states have call successors, (24) Word has length 108 [2025-02-06 03:12:31,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:31,450 INFO L225 Difference]: With dead ends: 931 [2025-02-06 03:12:31,450 INFO L226 Difference]: Without dead ends: 537 [2025-02-06 03:12:31,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=433, Invalid=2117, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 03:12:31,452 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 692 mSDsluCounter, 2114 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:31,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 2278 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:12:31,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-02-06 03:12:31,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 421. [2025-02-06 03:12:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 364 states have (on average 1.3956043956043955) internal successors, (508), 364 states have internal predecessors, (508), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 03:12:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 604 transitions. [2025-02-06 03:12:31,482 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 604 transitions. Word has length 108 [2025-02-06 03:12:31,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:31,482 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 604 transitions. [2025-02-06 03:12:31,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 25 states have internal predecessors, (88), 6 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:12:31,483 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 604 transitions. [2025-02-06 03:12:31,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:12:31,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:31,484 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-02-06 03:12:31,490 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-02-06 03:12:31,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:12:31,688 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:31,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:31,692 INFO L85 PathProgramCache]: Analyzing trace with hash 876545028, now seen corresponding path program 1 times [2025-02-06 03:12:31,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:31,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338222776] [2025-02-06 03:12:31,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:31,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:31,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:12:31,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:12:31,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:31,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:32,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-02-06 03:12:32,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:32,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338222776] [2025-02-06 03:12:32,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338222776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:32,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:32,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:12:32,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638540968] [2025-02-06 03:12:32,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:32,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:12:32,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:32,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:12:32,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:32,015 INFO L87 Difference]: Start difference. First operand 421 states and 604 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 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-02-06 03:12:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:32,289 INFO L93 Difference]: Finished difference Result 843 states and 1212 transitions. [2025-02-06 03:12:32,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:12:32,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 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-02-06 03:12:32,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:32,292 INFO L225 Difference]: With dead ends: 843 [2025-02-06 03:12:32,294 INFO L226 Difference]: Without dead ends: 628 [2025-02-06 03:12:32,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:12:32,297 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 250 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:32,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 793 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:12:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-02-06 03:12:32,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 620. [2025-02-06 03:12:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 535 states have (on average 1.3906542056074767) internal successors, (744), 535 states have internal predecessors, (744), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-06 03:12:32,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 888 transitions. [2025-02-06 03:12:32,356 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 888 transitions. Word has length 109 [2025-02-06 03:12:32,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:32,356 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 888 transitions. [2025-02-06 03:12:32,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 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-02-06 03:12:32,357 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 888 transitions. [2025-02-06 03:12:32,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:12:32,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:32,358 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-02-06 03:12:32,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:12:32,359 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:32,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:32,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1005627747, now seen corresponding path program 1 times [2025-02-06 03:12:32,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:32,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523277898] [2025-02-06 03:12:32,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:32,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:32,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:12:32,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:12:32,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:32,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:32,920 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:32,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:32,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523277898] [2025-02-06 03:12:32,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523277898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:32,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:32,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:12:32,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760655016] [2025-02-06 03:12:32,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:32,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:12:32,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:32,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:12:32,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:12:32,922 INFO L87 Difference]: Start difference. First operand 620 states and 888 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 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-02-06 03:12:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:33,535 INFO L93 Difference]: Finished difference Result 1357 states and 1943 transitions. [2025-02-06 03:12:33,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 03:12:33,536 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 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-02-06 03:12:33,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:33,539 INFO L225 Difference]: With dead ends: 1357 [2025-02-06 03:12:33,539 INFO L226 Difference]: Without dead ends: 740 [2025-02-06 03:12:33,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:12:33,541 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 163 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:33,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 847 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:12:33,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-02-06 03:12:33,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 726. [2025-02-06 03:12:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 627 states have (on average 1.3811802232854864) internal successors, (866), 627 states have internal predecessors, (866), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 03:12:33,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1034 transitions. [2025-02-06 03:12:33,587 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1034 transitions. Word has length 109 [2025-02-06 03:12:33,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:33,587 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1034 transitions. [2025-02-06 03:12:33,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 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-02-06 03:12:33,588 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1034 transitions. [2025-02-06 03:12:33,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:12:33,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:33,589 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-02-06 03:12:33,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:12:33,589 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:33,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:33,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1501473013, now seen corresponding path program 1 times [2025-02-06 03:12:33,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:33,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366171713] [2025-02-06 03:12:33,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:33,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:33,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:12:33,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:12:33,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:33,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:33,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:33,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366171713] [2025-02-06 03:12:33,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366171713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:33,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:33,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:12:33,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367221967] [2025-02-06 03:12:33,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:33,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:12:33,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:33,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:12:33,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:12:33,834 INFO L87 Difference]: Start difference. First operand 726 states and 1034 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-02-06 03:12:34,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:34,014 INFO L93 Difference]: Finished difference Result 1455 states and 2074 transitions. [2025-02-06 03:12:34,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:12:34,015 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-02-06 03:12:34,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:34,019 INFO L225 Difference]: With dead ends: 1455 [2025-02-06 03:12:34,020 INFO L226 Difference]: Without dead ends: 732 [2025-02-06 03:12:34,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-02-06 03:12:34,023 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 106 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:34,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 537 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:34,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-02-06 03:12:34,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 724. [2025-02-06 03:12:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 625 states have (on average 1.3776) internal successors, (861), 625 states have internal predecessors, (861), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 03:12:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1029 transitions. [2025-02-06 03:12:34,071 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1029 transitions. Word has length 110 [2025-02-06 03:12:34,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:34,072 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1029 transitions. [2025-02-06 03:12:34,072 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-02-06 03:12:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1029 transitions. [2025-02-06 03:12:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 03:12:34,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:34,073 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-02-06 03:12:34,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:12:34,073 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:34,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:34,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1124825108, now seen corresponding path program 1 times [2025-02-06 03:12:34,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:34,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948796279] [2025-02-06 03:12:34,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:34,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:34,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:12:34,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:12:34,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:34,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:34,163 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:34,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:34,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948796279] [2025-02-06 03:12:34,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948796279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:34,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:34,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:12:34,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249529815] [2025-02-06 03:12:34,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:34,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:12:34,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:34,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:12:34,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:12:34,164 INFO L87 Difference]: Start difference. First operand 724 states and 1029 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-02-06 03:12:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:34,254 INFO L93 Difference]: Finished difference Result 1438 states and 2041 transitions. [2025-02-06 03:12:34,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:12:34,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-02-06 03:12:34,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:34,257 INFO L225 Difference]: With dead ends: 1438 [2025-02-06 03:12:34,257 INFO L226 Difference]: Without dead ends: 717 [2025-02-06 03:12:34,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:12:34,260 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 104 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:34,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 534 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:12:34,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-02-06 03:12:34,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 510. [2025-02-06 03:12:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 439 states have (on average 1.366742596810934) internal successors, (600), 439 states have internal predecessors, (600), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:12:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 720 transitions. [2025-02-06 03:12:34,323 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 720 transitions. Word has length 111 [2025-02-06 03:12:34,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:34,323 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 720 transitions. [2025-02-06 03:12:34,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-02-06 03:12:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 720 transitions. [2025-02-06 03:12:34,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 03:12:34,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:34,324 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-02-06 03:12:34,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:12:34,325 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:34,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:34,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1989499904, now seen corresponding path program 1 times [2025-02-06 03:12:34,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:34,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364057509] [2025-02-06 03:12:34,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:34,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:34,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:12:34,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:12:34,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:34,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:34,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:34,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364057509] [2025-02-06 03:12:34,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364057509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:34,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:34,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:12:34,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123979008] [2025-02-06 03:12:34,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:34,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:12:34,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:34,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:12:34,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:12:34,750 INFO L87 Difference]: Start difference. First operand 510 states and 720 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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-02-06 03:12:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:35,265 INFO L93 Difference]: Finished difference Result 1244 states and 1754 transitions. [2025-02-06 03:12:35,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:12:35,265 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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-02-06 03:12:35,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:35,270 INFO L225 Difference]: With dead ends: 1244 [2025-02-06 03:12:35,270 INFO L226 Difference]: Without dead ends: 832 [2025-02-06 03:12:35,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:12:35,273 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 324 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:35,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 921 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:12:35,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-02-06 03:12:35,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 815. [2025-02-06 03:12:35,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 715 states have (on average 1.3734265734265734) internal successors, (982), 719 states have internal predecessors, (982), 84 states have call successors, (84), 15 states have call predecessors, (84), 15 states have return successors, (84), 80 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 03:12:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1150 transitions. [2025-02-06 03:12:35,324 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1150 transitions. Word has length 111 [2025-02-06 03:12:35,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:35,324 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1150 transitions. [2025-02-06 03:12:35,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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-02-06 03:12:35,325 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1150 transitions. [2025-02-06 03:12:35,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 03:12:35,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:35,326 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-02-06 03:12:35,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:12:35,327 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:35,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:35,327 INFO L85 PathProgramCache]: Analyzing trace with hash -923470883, now seen corresponding path program 1 times [2025-02-06 03:12:35,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:35,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61229087] [2025-02-06 03:12:35,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:35,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:35,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:12:35,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:12:35,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:35,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-02-06 03:12:35,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:35,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61229087] [2025-02-06 03:12:35,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61229087] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:12:35,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413500483] [2025-02-06 03:12:35,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:35,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:12:35,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:12:35,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:12:35,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:12:35,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:12:35,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:12:35,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:35,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:35,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:12:35,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:12:35,610 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:35,610 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:12:35,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413500483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:35,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:12:35,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-02-06 03:12:35,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824765751] [2025-02-06 03:12:35,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:35,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:12:35,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:35,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:12:35,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:12:35,612 INFO L87 Difference]: Start difference. First operand 815 states and 1150 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-02-06 03:12:35,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:35,702 INFO L93 Difference]: Finished difference Result 1654 states and 2333 transitions. [2025-02-06 03:12:35,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:12:35,702 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-02-06 03:12:35,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:35,709 INFO L225 Difference]: With dead ends: 1654 [2025-02-06 03:12:35,710 INFO L226 Difference]: Without dead ends: 842 [2025-02-06 03:12:35,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:12:35,712 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:35,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 557 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:12:35,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-02-06 03:12:35,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2025-02-06 03:12:35,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 742 states have (on average 1.3598382749326146) internal successors, (1009), 746 states have internal predecessors, (1009), 84 states have call successors, (84), 15 states have call predecessors, (84), 15 states have return successors, (84), 80 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 03:12:35,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1177 transitions. [2025-02-06 03:12:35,763 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1177 transitions. Word has length 111 [2025-02-06 03:12:35,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:35,763 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1177 transitions. [2025-02-06 03:12:35,763 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-02-06 03:12:35,763 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1177 transitions. [2025-02-06 03:12:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 03:12:35,764 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:35,764 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-02-06 03:12:35,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:12:35,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:12:35,965 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:35,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:35,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1469612326, now seen corresponding path program 1 times [2025-02-06 03:12:35,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:35,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716838190] [2025-02-06 03:12:35,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:35,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:35,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:12:35,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:12:35,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:35,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:36,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:36,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716838190] [2025-02-06 03:12:36,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716838190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:36,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:36,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:12:36,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690197791] [2025-02-06 03:12:36,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:36,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:12:36,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:36,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:12:36,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:12:36,108 INFO L87 Difference]: Start difference. First operand 842 states and 1177 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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-02-06 03:12:36,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:36,362 INFO L93 Difference]: Finished difference Result 1299 states and 1815 transitions. [2025-02-06 03:12:36,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:12:36,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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-02-06 03:12:36,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:36,366 INFO L225 Difference]: With dead ends: 1299 [2025-02-06 03:12:36,367 INFO L226 Difference]: Without dead ends: 830 [2025-02-06 03:12:36,368 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-02-06 03:12:36,368 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 127 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:36,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 860 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:12:36,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2025-02-06 03:12:36,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 822. [2025-02-06 03:12:36,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 722 states have (on average 1.3545706371191135) internal successors, (978), 726 states have internal predecessors, (978), 84 states have call successors, (84), 15 states have call predecessors, (84), 15 states have return successors, (84), 80 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 03:12:36,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1146 transitions. [2025-02-06 03:12:36,419 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1146 transitions. Word has length 111 [2025-02-06 03:12:36,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:36,420 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1146 transitions. [2025-02-06 03:12:36,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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-02-06 03:12:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1146 transitions. [2025-02-06 03:12:36,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 03:12:36,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:36,421 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-02-06 03:12:36,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:12:36,421 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:36,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:36,422 INFO L85 PathProgramCache]: Analyzing trace with hash 700387053, now seen corresponding path program 1 times [2025-02-06 03:12:36,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:36,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059219399] [2025-02-06 03:12:36,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:36,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:36,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:12:36,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:12:36,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:36,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:36,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:36,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059219399] [2025-02-06 03:12:36,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059219399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:36,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:36,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:12:36,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908855382] [2025-02-06 03:12:36,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:36,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:12:36,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:36,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:12:36,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:12:36,602 INFO L87 Difference]: Start difference. First operand 822 states and 1146 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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-02-06 03:12:36,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:36,844 INFO L93 Difference]: Finished difference Result 1345 states and 1867 transitions. [2025-02-06 03:12:36,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:12:36,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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-02-06 03:12:36,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:36,848 INFO L225 Difference]: With dead ends: 1345 [2025-02-06 03:12:36,849 INFO L226 Difference]: Without dead ends: 869 [2025-02-06 03:12:36,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:36,850 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 137 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:36,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 612 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:12:36,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-02-06 03:12:36,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 582. [2025-02-06 03:12:36,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 509 states have (on average 1.349705304518664) internal successors, (687), 511 states have internal predecessors, (687), 60 states have call successors, (60), 12 states have call predecessors, (60), 12 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:12:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 807 transitions. [2025-02-06 03:12:36,889 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 807 transitions. Word has length 112 [2025-02-06 03:12:36,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:36,891 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 807 transitions. [2025-02-06 03:12:36,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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-02-06 03:12:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 807 transitions. [2025-02-06 03:12:36,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 03:12:36,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:36,893 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-02-06 03:12:36,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:12:36,893 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:36,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:36,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1462119264, now seen corresponding path program 1 times [2025-02-06 03:12:36,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:36,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737402865] [2025-02-06 03:12:36,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:36,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:36,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:12:36,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:12:36,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:36,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:37,221 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:37,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:37,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737402865] [2025-02-06 03:12:37,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737402865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:37,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:37,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:12:37,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343750529] [2025-02-06 03:12:37,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:37,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:12:37,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:37,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:12:37,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:37,222 INFO L87 Difference]: Start difference. First operand 582 states and 807 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-02-06 03:12:37,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:37,536 INFO L93 Difference]: Finished difference Result 1347 states and 1870 transitions. [2025-02-06 03:12:37,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:12:37,537 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-02-06 03:12:37,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:37,540 INFO L225 Difference]: With dead ends: 1347 [2025-02-06 03:12:37,540 INFO L226 Difference]: Without dead ends: 768 [2025-02-06 03:12:37,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:12:37,541 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 200 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:37,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 721 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:12:37,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-02-06 03:12:37,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 761. [2025-02-06 03:12:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 667 states have (on average 1.3463268365817092) internal successors, (898), 670 states have internal predecessors, (898), 78 states have call successors, (78), 15 states have call predecessors, (78), 15 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-06 03:12:37,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1054 transitions. [2025-02-06 03:12:37,588 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1054 transitions. Word has length 112 [2025-02-06 03:12:37,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:37,588 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1054 transitions. [2025-02-06 03:12:37,588 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-02-06 03:12:37,588 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1054 transitions. [2025-02-06 03:12:37,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 03:12:37,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:37,589 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-02-06 03:12:37,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:12:37,590 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:37,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:37,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1168716257, now seen corresponding path program 1 times [2025-02-06 03:12:37,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:37,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957786284] [2025-02-06 03:12:37,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:37,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:37,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:12:37,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:12:37,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:37,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:37,850 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:37,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:37,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957786284] [2025-02-06 03:12:37,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957786284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:37,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:37,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:12:37,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525641394] [2025-02-06 03:12:37,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:37,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:12:37,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:37,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:12:37,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:12:37,852 INFO L87 Difference]: Start difference. First operand 761 states and 1054 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 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-02-06 03:12:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:38,326 INFO L93 Difference]: Finished difference Result 2336 states and 3248 transitions. [2025-02-06 03:12:38,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:12:38,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 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-02-06 03:12:38,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:38,333 INFO L225 Difference]: With dead ends: 2336 [2025-02-06 03:12:38,333 INFO L226 Difference]: Without dead ends: 1761 [2025-02-06 03:12:38,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:12:38,335 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 441 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:38,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1432 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:12:38,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2025-02-06 03:12:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1360. [2025-02-06 03:12:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1194 states have (on average 1.3525963149078728) internal successors, (1615), 1199 states have internal predecessors, (1615), 138 states have call successors, (138), 27 states have call predecessors, (138), 27 states have return successors, (138), 133 states have call predecessors, (138), 138 states have call successors, (138) [2025-02-06 03:12:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1891 transitions. [2025-02-06 03:12:38,420 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1891 transitions. Word has length 112 [2025-02-06 03:12:38,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:38,420 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1891 transitions. [2025-02-06 03:12:38,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 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-02-06 03:12:38,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1891 transitions. [2025-02-06 03:12:38,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:12:38,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:38,422 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, 1] [2025-02-06 03:12:38,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:12:38,422 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:38,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:38,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1264572265, now seen corresponding path program 1 times [2025-02-06 03:12:38,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:38,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722652923] [2025-02-06 03:12:38,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:38,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:38,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:12:38,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:12:38,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:38,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:38,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:38,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722652923] [2025-02-06 03:12:38,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722652923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:38,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:38,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:12:38,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091815927] [2025-02-06 03:12:38,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:38,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:12:38,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:38,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:12:38,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:12:38,879 INFO L87 Difference]: Start difference. First operand 1360 states and 1891 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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-02-06 03:12:40,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:40,029 INFO L93 Difference]: Finished difference Result 2823 states and 3918 transitions. [2025-02-06 03:12:40,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 03:12:40,030 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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 113 [2025-02-06 03:12:40,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:40,037 INFO L225 Difference]: With dead ends: 2823 [2025-02-06 03:12:40,037 INFO L226 Difference]: Without dead ends: 2027 [2025-02-06 03:12:40,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:12:40,040 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 658 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:40,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1565 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:12:40,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2025-02-06 03:12:40,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1547. [2025-02-06 03:12:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1360 states have (on average 1.3522058823529413) internal successors, (1839), 1366 states have internal predecessors, (1839), 156 states have call successors, (156), 30 states have call predecessors, (156), 30 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2025-02-06 03:12:40,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2151 transitions. [2025-02-06 03:12:40,140 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2151 transitions. Word has length 113 [2025-02-06 03:12:40,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:40,141 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 2151 transitions. [2025-02-06 03:12:40,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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-02-06 03:12:40,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2151 transitions. [2025-02-06 03:12:40,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:12:40,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:40,143 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, 1] [2025-02-06 03:12:40,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:12:40,143 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:40,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:40,143 INFO L85 PathProgramCache]: Analyzing trace with hash 39285762, now seen corresponding path program 1 times [2025-02-06 03:12:40,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:40,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561533494] [2025-02-06 03:12:40,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:40,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:40,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:12:40,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:12:40,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:40,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:40,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:40,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561533494] [2025-02-06 03:12:40,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561533494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:40,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:40,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:12:40,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561992535] [2025-02-06 03:12:40,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:40,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:12:40,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:40,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:12:40,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:12:40,221 INFO L87 Difference]: Start difference. First operand 1547 states and 2151 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-02-06 03:12:40,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:40,368 INFO L93 Difference]: Finished difference Result 2926 states and 4067 transitions. [2025-02-06 03:12:40,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:12:40,373 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), 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 113 [2025-02-06 03:12:40,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:40,388 INFO L225 Difference]: With dead ends: 2926 [2025-02-06 03:12:40,388 INFO L226 Difference]: Without dead ends: 1943 [2025-02-06 03:12:40,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:12:40,390 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 95 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 485 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.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:40,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 485 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:12:40,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2025-02-06 03:12:40,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1941. [2025-02-06 03:12:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1703 states have (on average 1.3511450381679388) internal successors, (2301), 1710 states have internal predecessors, (2301), 198 states have call successors, (198), 39 states have call predecessors, (198), 39 states have return successors, (198), 191 states have call predecessors, (198), 198 states have call successors, (198) [2025-02-06 03:12:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2697 transitions. [2025-02-06 03:12:40,647 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2697 transitions. Word has length 113 [2025-02-06 03:12:40,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:40,648 INFO L471 AbstractCegarLoop]: Abstraction has 1941 states and 2697 transitions. [2025-02-06 03:12:40,648 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), 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-02-06 03:12:40,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2697 transitions. [2025-02-06 03:12:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:12:40,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:40,653 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, 1] [2025-02-06 03:12:40,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:12:40,653 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:40,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:40,654 INFO L85 PathProgramCache]: Analyzing trace with hash 168368481, now seen corresponding path program 1 times [2025-02-06 03:12:40,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:40,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658346123] [2025-02-06 03:12:40,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:40,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:40,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:12:40,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:12:40,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:40,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:40,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:40,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658346123] [2025-02-06 03:12:40,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658346123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:40,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:40,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:12:40,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665827024] [2025-02-06 03:12:40,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:40,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:12:40,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:40,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:12:40,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:12:40,745 INFO L87 Difference]: Start difference. First operand 1941 states and 2697 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-02-06 03:12:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:40,905 INFO L93 Difference]: Finished difference Result 3883 states and 5395 transitions. [2025-02-06 03:12:40,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:12:40,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 113 [2025-02-06 03:12:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:40,912 INFO L225 Difference]: With dead ends: 3883 [2025-02-06 03:12:40,912 INFO L226 Difference]: Without dead ends: 1945 [2025-02-06 03:12:40,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:40,916 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 97 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:40,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 698 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:40,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2025-02-06 03:12:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1943. [2025-02-06 03:12:41,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1943 states, 1705 states have (on average 1.346041055718475) internal successors, (2295), 1712 states have internal predecessors, (2295), 198 states have call successors, (198), 39 states have call predecessors, (198), 39 states have return successors, (198), 191 states have call predecessors, (198), 198 states have call successors, (198) [2025-02-06 03:12:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 2691 transitions. [2025-02-06 03:12:41,053 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 2691 transitions. Word has length 113 [2025-02-06 03:12:41,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:41,054 INFO L471 AbstractCegarLoop]: Abstraction has 1943 states and 2691 transitions. [2025-02-06 03:12:41,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-02-06 03:12:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2691 transitions. [2025-02-06 03:12:41,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:12:41,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:41,055 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, 1] [2025-02-06 03:12:41,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 03:12:41,056 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:41,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:41,056 INFO L85 PathProgramCache]: Analyzing trace with hash 199702079, now seen corresponding path program 1 times [2025-02-06 03:12:41,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:41,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060543806] [2025-02-06 03:12:41,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:41,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:41,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:12:41,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:12:41,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:41,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:42,433 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:42,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:42,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060543806] [2025-02-06 03:12:42,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060543806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:42,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:42,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 03:12:42,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296604745] [2025-02-06 03:12:42,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:42,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:12:42,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:42,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:12:42,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:12:42,434 INFO L87 Difference]: Start difference. First operand 1943 states and 2691 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 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-02-06 03:12:44,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:44,548 INFO L93 Difference]: Finished difference Result 3592 states and 4969 transitions. [2025-02-06 03:12:44,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 03:12:44,549 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 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 113 [2025-02-06 03:12:44,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:44,556 INFO L225 Difference]: With dead ends: 3592 [2025-02-06 03:12:44,556 INFO L226 Difference]: Without dead ends: 2609 [2025-02-06 03:12:44,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2025-02-06 03:12:44,559 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 550 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:44,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1599 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 03:12:44,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2025-02-06 03:12:44,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1957. [2025-02-06 03:12:44,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1957 states, 1719 states have (on average 1.3443862710878418) internal successors, (2311), 1726 states have internal predecessors, (2311), 198 states have call successors, (198), 39 states have call predecessors, (198), 39 states have return successors, (198), 191 states have call predecessors, (198), 198 states have call successors, (198) [2025-02-06 03:12:44,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 2707 transitions. [2025-02-06 03:12:44,667 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 2707 transitions. Word has length 113 [2025-02-06 03:12:44,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:44,667 INFO L471 AbstractCegarLoop]: Abstraction has 1957 states and 2707 transitions. [2025-02-06 03:12:44,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 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-02-06 03:12:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 2707 transitions. [2025-02-06 03:12:44,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:12:44,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:44,669 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, 1] [2025-02-06 03:12:44,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:12:44,669 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:44,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:44,669 INFO L85 PathProgramCache]: Analyzing trace with hash -70422604, now seen corresponding path program 1 times [2025-02-06 03:12:44,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:44,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623121346] [2025-02-06 03:12:44,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:44,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:44,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:12:44,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:12:44,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:44,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-02-06 03:12:44,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:44,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623121346] [2025-02-06 03:12:44,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623121346] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:12:44,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343250232] [2025-02-06 03:12:44,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:44,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:12:44,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:12:44,752 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:12:44,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 03:12:44,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:12:44,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:12:44,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:44,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:44,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:12:44,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:12:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:44,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:12:44,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343250232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:44,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:12:44,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:12:44,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39990341] [2025-02-06 03:12:44,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:44,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:12:44,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:44,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:12:44,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:12:44,908 INFO L87 Difference]: Start difference. First operand 1957 states and 2707 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-02-06 03:12:45,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:45,017 INFO L93 Difference]: Finished difference Result 3971 states and 5491 transitions. [2025-02-06 03:12:45,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:12:45,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 113 [2025-02-06 03:12:45,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:45,024 INFO L225 Difference]: With dead ends: 3971 [2025-02-06 03:12:45,024 INFO L226 Difference]: Without dead ends: 2017 [2025-02-06 03:12:45,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:12:45,029 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:45,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 556 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:12:45,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2025-02-06 03:12:45,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 2017. [2025-02-06 03:12:45,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1779 states have (on average 1.3327712197863968) internal successors, (2371), 1786 states have internal predecessors, (2371), 198 states have call successors, (198), 39 states have call predecessors, (198), 39 states have return successors, (198), 191 states have call predecessors, (198), 198 states have call successors, (198) [2025-02-06 03:12:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2767 transitions. [2025-02-06 03:12:45,172 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2767 transitions. Word has length 113 [2025-02-06 03:12:45,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:45,172 INFO L471 AbstractCegarLoop]: Abstraction has 2017 states and 2767 transitions. [2025-02-06 03:12:45,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-02-06 03:12:45,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2767 transitions. [2025-02-06 03:12:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:12:45,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:45,174 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, 1] [2025-02-06 03:12:45,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 03:12:45,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:12:45,379 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:45,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:45,380 INFO L85 PathProgramCache]: Analyzing trace with hash -912411083, now seen corresponding path program 1 times [2025-02-06 03:12:45,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:45,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991578760] [2025-02-06 03:12:45,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:45,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:45,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:12:45,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:12:45,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:45,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:45,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:45,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991578760] [2025-02-06 03:12:45,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991578760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:45,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:45,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:12:45,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729506620] [2025-02-06 03:12:45,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:45,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:12:45,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:45,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:12:45,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:12:45,771 INFO L87 Difference]: Start difference. First operand 2017 states and 2767 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:46,506 INFO L93 Difference]: Finished difference Result 4283 states and 5891 transitions. [2025-02-06 03:12:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:12:46,507 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2025-02-06 03:12:46,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:46,515 INFO L225 Difference]: With dead ends: 4283 [2025-02-06 03:12:46,516 INFO L226 Difference]: Without dead ends: 2870 [2025-02-06 03:12:46,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:12:46,518 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 451 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:46,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 1121 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:12:46,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2025-02-06 03:12:46,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 1824. [2025-02-06 03:12:46,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1607 states have (on average 1.3310516490354698) internal successors, (2139), 1613 states have internal predecessors, (2139), 180 states have call successors, (180), 36 states have call predecessors, (180), 36 states have return successors, (180), 174 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-06 03:12:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2499 transitions. [2025-02-06 03:12:46,634 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2499 transitions. Word has length 113 [2025-02-06 03:12:46,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:46,635 INFO L471 AbstractCegarLoop]: Abstraction has 1824 states and 2499 transitions. [2025-02-06 03:12:46,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2499 transitions. [2025-02-06 03:12:46,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:12:46,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:46,637 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, 1] [2025-02-06 03:12:46,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:12:46,637 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:46,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:46,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1686385626, now seen corresponding path program 1 times [2025-02-06 03:12:46,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:46,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315849198] [2025-02-06 03:12:46,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:46,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:46,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:12:46,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:12:46,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:46,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:46,800 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:46,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:46,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315849198] [2025-02-06 03:12:46,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315849198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:46,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:46,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:12:46,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633007336] [2025-02-06 03:12:46,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:46,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:12:46,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:46,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:12:46,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:12:46,802 INFO L87 Difference]: Start difference. First operand 1824 states and 2499 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-02-06 03:12:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:47,035 INFO L93 Difference]: Finished difference Result 3056 states and 4194 transitions. [2025-02-06 03:12:47,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:12:47,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 113 [2025-02-06 03:12:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:47,044 INFO L225 Difference]: With dead ends: 3056 [2025-02-06 03:12:47,047 INFO L226 Difference]: Without dead ends: 1836 [2025-02-06 03:12:47,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:47,050 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 92 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:47,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 671 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2025-02-06 03:12:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1828. [2025-02-06 03:12:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1611 states have (on average 1.330229671011794) internal successors, (2143), 1617 states have internal predecessors, (2143), 180 states have call successors, (180), 36 states have call predecessors, (180), 36 states have return successors, (180), 174 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-06 03:12:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2503 transitions. [2025-02-06 03:12:47,152 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 2503 transitions. Word has length 113 [2025-02-06 03:12:47,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:47,153 INFO L471 AbstractCegarLoop]: Abstraction has 1828 states and 2503 transitions. [2025-02-06 03:12:47,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-02-06 03:12:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2503 transitions. [2025-02-06 03:12:47,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 03:12:47,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:47,156 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, 1, 1] [2025-02-06 03:12:47,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 03:12:47,156 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:47,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:47,157 INFO L85 PathProgramCache]: Analyzing trace with hash 752900445, now seen corresponding path program 1 times [2025-02-06 03:12:47,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:47,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983575181] [2025-02-06 03:12:47,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:47,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:47,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:12:47,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:12:47,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:47,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:47,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:47,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983575181] [2025-02-06 03:12:47,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983575181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:47,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:47,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:12:47,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639069141] [2025-02-06 03:12:47,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:47,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:12:47,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:47,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:12:47,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:12:47,381 INFO L87 Difference]: Start difference. First operand 1828 states and 2503 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-02-06 03:12:47,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:47,694 INFO L93 Difference]: Finished difference Result 2921 states and 4010 transitions. [2025-02-06 03:12:47,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:12:47,695 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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 114 [2025-02-06 03:12:47,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:47,703 INFO L225 Difference]: With dead ends: 2921 [2025-02-06 03:12:47,703 INFO L226 Difference]: Without dead ends: 1894 [2025-02-06 03:12:47,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:12:47,709 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 137 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:47,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 469 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:12:47,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2025-02-06 03:12:47,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1629. [2025-02-06 03:12:47,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1433 states have (on average 1.3237962316817864) internal successors, (1897), 1438 states have internal predecessors, (1897), 162 states have call successors, (162), 33 states have call predecessors, (162), 33 states have return successors, (162), 157 states have call predecessors, (162), 162 states have call successors, (162) [2025-02-06 03:12:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2221 transitions. [2025-02-06 03:12:47,842 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2221 transitions. Word has length 114 [2025-02-06 03:12:47,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:47,843 INFO L471 AbstractCegarLoop]: Abstraction has 1629 states and 2221 transitions. [2025-02-06 03:12:47,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-02-06 03:12:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2221 transitions. [2025-02-06 03:12:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 03:12:47,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:47,845 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, 1, 1] [2025-02-06 03:12:47,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 03:12:47,845 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:47,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:47,845 INFO L85 PathProgramCache]: Analyzing trace with hash 459497438, now seen corresponding path program 1 times [2025-02-06 03:12:47,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:47,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104395314] [2025-02-06 03:12:47,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:47,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:47,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:12:47,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:12:47,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:47,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:48,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-02-06 03:12:48,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:48,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104395314] [2025-02-06 03:12:48,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104395314] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:48,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:48,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:12:48,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017519060] [2025-02-06 03:12:48,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:48,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:12:48,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:48,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:12:48,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:48,006 INFO L87 Difference]: Start difference. First operand 1629 states and 2221 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-02-06 03:12:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:48,344 INFO L93 Difference]: Finished difference Result 2604 states and 3545 transitions. [2025-02-06 03:12:48,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:12:48,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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 114 [2025-02-06 03:12:48,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:48,354 INFO L225 Difference]: With dead ends: 2604 [2025-02-06 03:12:48,354 INFO L226 Difference]: Without dead ends: 1776 [2025-02-06 03:12:48,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:12:48,356 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 142 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:48,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 865 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:12:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2025-02-06 03:12:48,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1223. [2025-02-06 03:12:48,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 1078 states have (on average 1.3200371057513915) internal successors, (1423), 1082 states have internal predecessors, (1423), 120 states have call successors, (120), 24 states have call predecessors, (120), 24 states have return successors, (120), 116 states have call predecessors, (120), 120 states have call successors, (120) [2025-02-06 03:12:48,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1663 transitions. [2025-02-06 03:12:48,463 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1663 transitions. Word has length 114 [2025-02-06 03:12:48,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:48,463 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1663 transitions. [2025-02-06 03:12:48,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-02-06 03:12:48,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1663 transitions. [2025-02-06 03:12:48,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 03:12:48,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:48,465 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, 1, 1] [2025-02-06 03:12:48,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 03:12:48,465 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:48,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:48,465 INFO L85 PathProgramCache]: Analyzing trace with hash -314477105, now seen corresponding path program 1 times [2025-02-06 03:12:48,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:48,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910297410] [2025-02-06 03:12:48,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:48,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:48,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:12:48,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:12:48,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:48,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:48,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-02-06 03:12:48,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:48,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910297410] [2025-02-06 03:12:48,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910297410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:48,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:48,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:12:48,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945667640] [2025-02-06 03:12:48,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:48,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:12:48,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:48,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:12:48,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:48,585 INFO L87 Difference]: Start difference. First operand 1223 states and 1663 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-02-06 03:12:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:48,812 INFO L93 Difference]: Finished difference Result 1657 states and 2252 transitions. [2025-02-06 03:12:48,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:12:48,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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 114 [2025-02-06 03:12:48,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:48,816 INFO L225 Difference]: With dead ends: 1657 [2025-02-06 03:12:48,816 INFO L226 Difference]: Without dead ends: 1235 [2025-02-06 03:12:48,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:12:48,817 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 126 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:48,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 674 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:48,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2025-02-06 03:12:48,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 837. [2025-02-06 03:12:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 734 states have (on average 1.3147138964577656) internal successors, (965), 736 states have internal predecessors, (965), 84 states have call successors, (84), 18 states have call predecessors, (84), 18 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 03:12:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1133 transitions. [2025-02-06 03:12:48,893 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1133 transitions. Word has length 114 [2025-02-06 03:12:48,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:48,893 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1133 transitions. [2025-02-06 03:12:48,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-02-06 03:12:48,894 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1133 transitions. [2025-02-06 03:12:48,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 03:12:48,894 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:48,894 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, 1, 1] [2025-02-06 03:12:48,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 03:12:48,895 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:48,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:48,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1353821436, now seen corresponding path program 1 times [2025-02-06 03:12:48,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:48,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530709662] [2025-02-06 03:12:48,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:48,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:48,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:12:48,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:12:48,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:48,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:49,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:49,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530709662] [2025-02-06 03:12:49,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530709662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:49,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:49,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:12:49,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003792058] [2025-02-06 03:12:49,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:49,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:12:49,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:49,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:12:49,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:12:49,362 INFO L87 Difference]: Start difference. First operand 837 states and 1133 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 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-02-06 03:12:49,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:49,892 INFO L93 Difference]: Finished difference Result 1830 states and 2479 transitions. [2025-02-06 03:12:49,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:12:49,893 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 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 114 [2025-02-06 03:12:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:49,896 INFO L225 Difference]: With dead ends: 1830 [2025-02-06 03:12:49,896 INFO L226 Difference]: Without dead ends: 1399 [2025-02-06 03:12:49,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:12:49,897 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 225 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:49,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1322 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:12:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-02-06 03:12:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1219. [2025-02-06 03:12:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1074 states have (on average 1.3156424581005586) internal successors, (1413), 1078 states have internal predecessors, (1413), 120 states have call successors, (120), 24 states have call predecessors, (120), 24 states have return successors, (120), 116 states have call predecessors, (120), 120 states have call successors, (120) [2025-02-06 03:12:49,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1653 transitions. [2025-02-06 03:12:49,997 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1653 transitions. Word has length 114 [2025-02-06 03:12:49,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:49,997 INFO L471 AbstractCegarLoop]: Abstraction has 1219 states and 1653 transitions. [2025-02-06 03:12:49,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 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-02-06 03:12:49,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1653 transitions. [2025-02-06 03:12:49,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 03:12:49,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:49,999 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, 1, 1, 1] [2025-02-06 03:12:49,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 03:12:50,000 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:50,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:50,002 INFO L85 PathProgramCache]: Analyzing trace with hash 933312627, now seen corresponding path program 1 times [2025-02-06 03:12:50,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:50,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036071086] [2025-02-06 03:12:50,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:50,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:50,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:12:50,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:12:50,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:50,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:50,350 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:50,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:50,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036071086] [2025-02-06 03:12:50,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036071086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:50,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:50,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:12:50,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849735754] [2025-02-06 03:12:50,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:50,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:12:50,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:50,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:12:50,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:50,351 INFO L87 Difference]: Start difference. First operand 1219 states and 1653 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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-02-06 03:12:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:50,767 INFO L93 Difference]: Finished difference Result 1984 states and 2683 transitions. [2025-02-06 03:12:50,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:12:50,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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 115 [2025-02-06 03:12:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:50,772 INFO L225 Difference]: With dead ends: 1984 [2025-02-06 03:12:50,773 INFO L226 Difference]: Without dead ends: 1553 [2025-02-06 03:12:50,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:12:50,775 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 117 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:50,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1088 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:12:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2025-02-06 03:12:50,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 829. [2025-02-06 03:12:50,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 726 states have (on average 1.3099173553719008) internal successors, (951), 728 states have internal predecessors, (951), 84 states have call successors, (84), 18 states have call predecessors, (84), 18 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 03:12:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1119 transitions. [2025-02-06 03:12:50,853 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1119 transitions. Word has length 115 [2025-02-06 03:12:50,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:50,853 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1119 transitions. [2025-02-06 03:12:50,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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-02-06 03:12:50,854 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1119 transitions. [2025-02-06 03:12:50,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 03:12:50,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:50,854 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, 1, 1, 1] [2025-02-06 03:12:50,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 03:12:50,855 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:50,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:50,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1350347327, now seen corresponding path program 1 times [2025-02-06 03:12:50,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:50,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985207099] [2025-02-06 03:12:50,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:50,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:50,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:12:50,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:12:50,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:50,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:50,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:50,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985207099] [2025-02-06 03:12:50,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985207099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:50,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:50,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:12:50,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220668773] [2025-02-06 03:12:50,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:50,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:12:50,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:50,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:12:50,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:12:50,914 INFO L87 Difference]: Start difference. First operand 829 states and 1119 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-02-06 03:12:50,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:50,961 INFO L93 Difference]: Finished difference Result 1326 states and 1790 transitions. [2025-02-06 03:12:50,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:12:50,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 115 [2025-02-06 03:12:50,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:50,964 INFO L225 Difference]: With dead ends: 1326 [2025-02-06 03:12:50,964 INFO L226 Difference]: Without dead ends: 496 [2025-02-06 03:12:50,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:12:50,966 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:50,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:12:50,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-02-06 03:12:51,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 492. [2025-02-06 03:12:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 434 states have (on average 1.3018433179723503) internal successors, (565), 436 states have internal predecessors, (565), 48 states have call successors, (48), 9 states have call predecessors, (48), 9 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 03:12:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 661 transitions. [2025-02-06 03:12:51,005 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 661 transitions. Word has length 115 [2025-02-06 03:12:51,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:51,005 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 661 transitions. [2025-02-06 03:12:51,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-02-06 03:12:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 661 transitions. [2025-02-06 03:12:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 03:12:51,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:51,006 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, 1, 1, 1] [2025-02-06 03:12:51,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 03:12:51,006 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:51,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:51,007 INFO L85 PathProgramCache]: Analyzing trace with hash 484683674, now seen corresponding path program 1 times [2025-02-06 03:12:51,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:51,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377479611] [2025-02-06 03:12:51,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:51,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:51,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:12:51,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:12:51,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:51,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:51,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:51,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377479611] [2025-02-06 03:12:51,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377479611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:51,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:51,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 03:12:51,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450065788] [2025-02-06 03:12:51,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:51,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:12:51,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:51,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:12:51,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:12:51,911 INFO L87 Difference]: Start difference. First operand 492 states and 661 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 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-02-06 03:12:52,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:52,700 INFO L93 Difference]: Finished difference Result 1450 states and 1942 transitions. [2025-02-06 03:12:52,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 03:12:52,701 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 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 115 [2025-02-06 03:12:52,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:52,704 INFO L225 Difference]: With dead ends: 1450 [2025-02-06 03:12:52,704 INFO L226 Difference]: Without dead ends: 961 [2025-02-06 03:12:52,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2025-02-06 03:12:52,705 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 244 mSDsluCounter, 2467 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:52,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 2710 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:12:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2025-02-06 03:12:52,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 939. [2025-02-06 03:12:52,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 836 states have (on average 1.305023923444976) internal successors, (1091), 843 states have internal predecessors, (1091), 84 states have call successors, (84), 18 states have call predecessors, (84), 18 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 03:12:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1259 transitions. [2025-02-06 03:12:52,832 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1259 transitions. Word has length 115 [2025-02-06 03:12:52,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:52,832 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1259 transitions. [2025-02-06 03:12:52,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 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-02-06 03:12:52,832 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1259 transitions. [2025-02-06 03:12:52,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 03:12:52,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:52,833 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, 1, 1, 1] [2025-02-06 03:12:52,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 03:12:52,833 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:52,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1449759664, now seen corresponding path program 1 times [2025-02-06 03:12:52,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:52,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343579859] [2025-02-06 03:12:52,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:52,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:52,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:12:52,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:12:52,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:52,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:12:52,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [489442582] [2025-02-06 03:12:52,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:52,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:12:52,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:12:52,934 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:12:52,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 03:12:53,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:12:53,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:12:53,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:53,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:12:53,189 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:12:53,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:12:53,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:12:53,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:53,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:12:53,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:12:53,330 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:12:53,331 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:12:53,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 03:12:53,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:12:53,535 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:53,613 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:12:53,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:12:53 BoogieIcfgContainer [2025-02-06 03:12:53,618 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:12:53,618 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:12:53,618 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:12:53,618 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:12:53,619 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:12:23" (3/4) ... [2025-02-06 03:12:53,621 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:12:53,622 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:12:53,623 INFO L158 Benchmark]: Toolchain (without parser) took 30798.93ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 115.7MB in the end (delta: 7.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2025-02-06 03:12:53,623 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:12:53,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.18ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 108.6MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:12:53,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.70ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 104.8MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:12:53,624 INFO L158 Benchmark]: Boogie Preprocessor took 87.21ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 100.9MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:12:53,625 INFO L158 Benchmark]: IcfgBuilder took 651.22ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 63.0MB in the end (delta: 37.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:12:53,625 INFO L158 Benchmark]: TraceAbstraction took 29710.93ms. Allocated memory is still 167.8MB. Free memory was 62.4MB in the beginning and 115.8MB in the end (delta: -53.4MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2025-02-06 03:12:53,625 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 167.8MB. Free memory was 115.8MB in the beginning and 115.7MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:12:53,626 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.28ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.18ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 108.6MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.70ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 104.8MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 87.21ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 100.9MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 651.22ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 63.0MB in the end (delta: 37.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 29710.93ms. Allocated memory is still 167.8MB. Free memory was 62.4MB in the beginning and 115.8MB in the end (delta: -53.4MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 167.8MB. Free memory was 115.8MB in the beginning and 115.7MB in the end (delta: 30.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 73, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of bitwiseOr at line 59, overapproximation of bitwiseOr at line 94, overapproximation of bitwiseAnd at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L25-L27] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L25-L27] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L25-L27] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { 5, 18477 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { 5, 18477 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { 5, 18477 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 256 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 256 }; [L37] unsigned char last_1_unsigned_char_Array_0_2_ = 16; [L38] unsigned long int last_1_unsigned_long_int_Array_0_0_ = 256; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L90] EXPR unsigned_char_Array_0[2] [L90] last_1_unsigned_char_Array_0_2_ = unsigned_char_Array_0[2] [L91] EXPR unsigned_long_int_Array_0[0] [L91] last_1_unsigned_long_int_Array_0_0_ = unsigned_long_int_Array_0[0] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] float_Array_0[0] = __VERIFIER_nondet_float() [L73] EXPR float_Array_0[0] [L73] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L73] EXPR float_Array_0[0] [L73] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] float_Array_0[1] = __VERIFIER_nondet_float() [L75] EXPR float_Array_0[1] [L75] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L75] EXPR float_Array_0[1] [L75] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L77] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L80] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not(signed_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L83] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L86] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] RET updateVariables() [L103] CALL step() [L42] EXPR signed_short_int_Array_0[0] [L42] signed short int stepLocal_3 = signed_short_int_Array_0[0]; [L43] unsigned long int stepLocal_2 = last_1_unsigned_long_int_Array_0_0_; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, stepLocal_2=256, stepLocal_3=256, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L44] COND FALSE !(last_1_unsigned_long_int_Array_0_0_ > stepLocal_3) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L51] EXPR unsigned_char_Array_0[2] [L51] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L51] EXPR unsigned_char_Array_0[2] & signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, stepLocal_2=256, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L51] EXPR unsigned_char_Array_0[0] [L51] EXPR unsigned_char_Array_0[2] [L51] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L51] COND FALSE !((unsigned_char_Array_0[2] & signed_short_int_Array_0[1]) > ((unsigned_char_Array_0[0] * last_1_unsigned_long_int_Array_0_0_) * (unsigned_char_Array_0[2] + unsigned_char_Array_0[2]))) [L56] EXPR signed_short_int_Array_0[1] [L56] unsigned_long_int_Array_0[0] = signed_short_int_Array_0[1] [L58] EXPR unsigned_char_Array_0[2] [L58] unsigned char stepLocal_1 = unsigned_char_Array_0[2]; [L59] EXPR unsigned_char_Array_0[2] [L59] EXPR unsigned_char_Array_0[2] [L59] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] EXPR ((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]) [L59] EXPR unsigned_long_int_Array_0[0] [L59] EXPR ((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, stepLocal_1=16, stepLocal_2=256, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] EXPR unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, stepLocal_1=16, stepLocal_2=256, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] unsigned long int stepLocal_0 = unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]))); [L60] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] COND FALSE !(stepLocal_0 != unsigned_char_Array_0[2]) [L65] float_Array_0[2] = 10.5f VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR unsigned_char_Array_0[2] [L94] EXPR unsigned_char_Array_0[2] [L94] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]) [L94] EXPR unsigned_long_int_Array_0[0] [L94] EXPR ((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f)) [L94] EXPR float_Array_0[2] [L94] EXPR ((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > signed_short_int_Array_0[0]) ? ((((last_1_unsigned_char_Array_0_2_ - signed_short_int_Array_0[0]) + signed_short_int_Array_0[1]) > last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[2] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]))))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > signed_short_int_Array_0[0]) ? ((((last_1_unsigned_char_Array_0_2_ - signed_short_int_Array_0[0]) + signed_short_int_Array_0[1]) > last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[2] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]))))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > signed_short_int_Array_0[0]) ? ((((last_1_unsigned_char_Array_0_2_ - signed_short_int_Array_0[0]) + signed_short_int_Array_0[1]) > last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[2] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]))))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[0]))) : 1)) && (((unsigned_char_Array_0[2] & signed_short_int_Array_0[1]) > ((unsigned_char_Array_0[0] * last_1_unsigned_long_int_Array_0_0_) * (unsigned_char_Array_0[2] + unsigned_char_Array_0[2]))) ? ((BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] > float_Array_0[1])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1])) : 1) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > signed_short_int_Array_0[0]) ? ((((last_1_unsigned_char_Array_0_2_ - signed_short_int_Array_0[0]) + signed_short_int_Array_0[1]) > last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[2] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]))))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[0]))) : 1)) && (((unsigned_char_Array_0[2] & signed_short_int_Array_0[1]) > ((unsigned_char_Array_0[0] * last_1_unsigned_long_int_Array_0_0_) * (unsigned_char_Array_0[2] + unsigned_char_Array_0[2]))) ? ((BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] > float_Array_0[1])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1])) : 1) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94-L95] return ((((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > signed_short_int_Array_0[0]) ? ((((last_1_unsigned_char_Array_0_2_ - signed_short_int_Array_0[0]) + signed_short_int_Array_0[1]) > last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[2] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]))))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[0]))) : 1)) && (((unsigned_char_Array_0[2] & signed_short_int_Array_0[1]) > ((unsigned_char_Array_0[0] * last_1_unsigned_long_int_Array_0_0_) * (unsigned_char_Array_0[2] + unsigned_char_Array_0[2]))) ? ((BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] > float_Array_0[1])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1])) : 1) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1]))) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.6s, OverallIterations: 30, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6663 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6663 mSDsluCounter, 26350 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21275 mSDsCounter, 664 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11223 IncrementalHoareTripleChecker+Invalid, 11887 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 664 mSolverCounterUnsat, 5075 mSDtfsCounter, 11223 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 951 GetRequests, 640 SyntacticMatches, 0 SemanticMatches, 311 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2017occurred in iteration=20, InterpolantAutomatonStates: 269, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 5449 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 3907 NumberOfCodeBlocks, 3907 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3751 ConstructedInterpolants, 0 QuantifiedInterpolants, 14721 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1637 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 34 InterpolantComputations, 28 PerfectInterpolantSequences, 8843/8976 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 03:12:53,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-18.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 34c00af4b4663198525b0b7086d994deb20901b2017b1e6c2fe4ceb71d985d42 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:12:55,576 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:12:55,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:12:55,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:12:55,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:12:55,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:12:55,696 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:12:55,696 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:12:55,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:12:55,697 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:12:55,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:12:55,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:12:55,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:12:55,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:12:55,697 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:12:55,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:12:55,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:12:55,697 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:12:55,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:12:55,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:12:55,697 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:12:55,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:12:55,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:12:55,698 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:12:55,698 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:12:55,698 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:12:55,698 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:12:55,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:12:55,698 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:12:55,698 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:12:55,698 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:12:55,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:12:55,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:12:55,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:12:55,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:12:55,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:12:55,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:12:55,698 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:12:55,698 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:12:55,698 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:12:55,699 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:12:55,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:12:55,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:12:55,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:12:55,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:12:55,699 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 -> 34c00af4b4663198525b0b7086d994deb20901b2017b1e6c2fe4ceb71d985d42 [2025-02-06 03:12:55,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:12:55,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:12:55,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:12:55,971 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:12:55,971 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:12:55,974 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-18.i [2025-02-06 03:12:57,163 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0be58f90f/968510547c0c49319155d24feb9782f9/FLAGa640d680a [2025-02-06 03:12:57,377 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:12:57,378 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-18.i [2025-02-06 03:12:57,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0be58f90f/968510547c0c49319155d24feb9782f9/FLAGa640d680a [2025-02-06 03:12:57,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0be58f90f/968510547c0c49319155d24feb9782f9 [2025-02-06 03:12:57,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:12:57,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:12:57,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:12:57,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:12:57,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:12:57,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:12:57" (1/1) ... [2025-02-06 03:12:57,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b05f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:57, skipping insertion in model container [2025-02-06 03:12:57,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:12:57" (1/1) ... [2025-02-06 03:12:57,768 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:12:57,874 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-18.i[916,929] [2025-02-06 03:12:57,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:12:57,943 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:12:57,950 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-18.i[916,929] [2025-02-06 03:12:57,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:12:57,988 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:12:57,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:57 WrapperNode [2025-02-06 03:12:57,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:12:57,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:12:57,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:12:57,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:12:57,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:57" (1/1) ... [2025-02-06 03:12:58,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:57" (1/1) ... [2025-02-06 03:12:58,031 INFO L138 Inliner]: procedures = 36, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 437 [2025-02-06 03:12:58,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:12:58,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:12:58,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:12:58,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:12:58,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:57" (1/1) ... [2025-02-06 03:12:58,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:57" (1/1) ... [2025-02-06 03:12:58,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:57" (1/1) ... [2025-02-06 03:12:58,068 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 6, 29, 22, 46, 10]. 40 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 2, 3, 1]. The 13 writes are split as follows [0, 1, 4, 2, 4, 2]. [2025-02-06 03:12:58,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:57" (1/1) ... [2025-02-06 03:12:58,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:57" (1/1) ... [2025-02-06 03:12:58,083 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:57" (1/1) ... [2025-02-06 03:12:58,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:57" (1/1) ... [2025-02-06 03:12:58,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:57" (1/1) ... [2025-02-06 03:12:58,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:57" (1/1) ... [2025-02-06 03:12:58,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:12:58,097 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:12:58,097 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:12:58,097 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:12:58,098 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:57" (1/1) ... [2025-02-06 03:12:58,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:12:58,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:12:58,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:12:58,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:12:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:12:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:12:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:12:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:12:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:12:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:12:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:12:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:12:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:12:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:12:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:12:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:12:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-06 03:12:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:12:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:12:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:12:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:12:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:12:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-02-06 03:12:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:12:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:12:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-06 03:12:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-06 03:12:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-02-06 03:12:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:12:58,158 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:12:58,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:12:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:12:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:12:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:12:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:12:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-02-06 03:12:58,304 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:12:58,306 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:12:58,757 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~mem78#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~ite77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem79#1;havoc property_#t~ite92#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite88#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~ite105#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite104#1;havoc property_#t~mem101#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short106#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite121#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short115#1;havoc property_#t~ite118#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short122#1; [2025-02-06 03:12:58,787 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-02-06 03:12:58,787 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:12:58,794 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:12:58,794 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:12:58,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:12:58 BoogieIcfgContainer [2025-02-06 03:12:58,795 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:12:58,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:12:58,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:12:58,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:12:58,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:12:57" (1/3) ... [2025-02-06 03:12:58,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e7e3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:12:58, skipping insertion in model container [2025-02-06 03:12:58,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:57" (2/3) ... [2025-02-06 03:12:58,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e7e3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:12:58, skipping insertion in model container [2025-02-06 03:12:58,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:12:58" (3/3) ... [2025-02-06 03:12:58,802 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-18.i [2025-02-06 03:12:58,813 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:12:58,814 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-18.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:12:58,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:12:58,858 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;@4d84b8a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:12:58,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:12:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 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-02-06 03:12:58,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:12:58,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:58,868 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] [2025-02-06 03:12:58,868 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:58,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:58,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1341913275, now seen corresponding path program 1 times [2025-02-06 03:12:58,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:12:58,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548769571] [2025-02-06 03:12:58,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:58,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:12:58,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:12:58,890 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:12:58,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 03:12:59,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:12:59,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:12:59,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:59,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:59,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:12:59,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:12:59,184 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-02-06 03:12:59,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:12:59,185 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:12:59,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548769571] [2025-02-06 03:12:59,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548769571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:59,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:59,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:12:59,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809495829] [2025-02-06 03:12:59,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:59,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:12:59,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:12:59,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:12:59,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:12:59,207 INFO L87 Difference]: Start difference. First operand has 91 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 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), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:59,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:59,229 INFO L93 Difference]: Finished difference Result 176 states and 271 transitions. [2025-02-06 03:12:59,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:12:59,230 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), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-02-06 03:12:59,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:59,234 INFO L225 Difference]: With dead ends: 176 [2025-02-06 03:12:59,234 INFO L226 Difference]: Without dead ends: 88 [2025-02-06 03:12:59,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:12:59,240 INFO L435 NwaCegarLoop]: 127 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, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:59,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:12:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-06 03:12:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-02-06 03:12:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 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-02-06 03:12:59,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2025-02-06 03:12:59,268 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 103 [2025-02-06 03:12:59,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:59,268 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2025-02-06 03:12:59,269 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), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:59,269 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2025-02-06 03:12:59,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:12:59,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:59,270 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] [2025-02-06 03:12:59,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:12:59,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:12:59,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:59,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:59,475 INFO L85 PathProgramCache]: Analyzing trace with hash 127845009, now seen corresponding path program 1 times [2025-02-06 03:12:59,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:12:59,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984935908] [2025-02-06 03:12:59,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:59,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:12:59,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:12:59,482 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:12:59,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 03:12:59,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:12:59,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:12:59,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:59,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:59,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:12:59,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:12:59,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-02-06 03:12:59,832 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 13 treesize of output 9 [2025-02-06 03:12:59,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:12:59,897 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-06 03:12:59,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:12:59,988 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:12:59,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984935908] [2025-02-06 03:12:59,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984935908] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:12:59,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1612918445] [2025-02-06 03:12:59,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:59,988 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:12:59,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:12:59,990 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:12:59,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-02-06 03:13:00,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:13:00,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:13:00,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:00,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:00,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 03:13:00,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:00,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-06 03:13:01,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-02-06 03:13:01,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-02-06 03:13:01,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:13:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-06 03:13:01,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:13:01,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1612918445] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:13:01,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:13:01,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2025-02-06 03:13:01,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111370073] [2025-02-06 03:13:01,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:13:01,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:13:01,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:01,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:13:01,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:13:01,343 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:13:02,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:02,706 INFO L93 Difference]: Finished difference Result 270 states and 385 transitions. [2025-02-06 03:13:02,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 03:13:02,706 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 103 [2025-02-06 03:13:02,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:02,710 INFO L225 Difference]: With dead ends: 270 [2025-02-06 03:13:02,712 INFO L226 Difference]: Without dead ends: 185 [2025-02-06 03:13:02,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2025-02-06 03:13:02,714 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 249 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:02,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 839 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:13:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-06 03:13:02,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2025-02-06 03:13:02,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 150 states have (on average 1.38) internal successors, (207), 150 states have internal predecessors, (207), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:13:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 255 transitions. [2025-02-06 03:13:02,734 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 255 transitions. Word has length 103 [2025-02-06 03:13:02,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:02,734 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 255 transitions. [2025-02-06 03:13:02,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:13:02,735 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 255 transitions. [2025-02-06 03:13:02,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:13:02,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:02,736 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] [2025-02-06 03:13:02,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:13:02,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-02-06 03:13:03,140 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,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:13:03,141 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:03,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:03,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1635396818, now seen corresponding path program 1 times [2025-02-06 03:13:03,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:03,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160709379] [2025-02-06 03:13:03,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:03,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:03,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:03,145 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:13:03,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 03:13:03,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:13:03,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:13:03,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:03,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:03,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:13:03,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:03,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-02-06 03:13:03,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 03:13:03,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 17 treesize of output 9 [2025-02-06 03:13:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-06 03:13:03,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:13:03,657 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:03,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160709379] [2025-02-06 03:13:03,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160709379] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:13:03,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2028673923] [2025-02-06 03:13:03,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:03,658 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:13:03,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:13:03,660 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:13:03,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-02-06 03:13:03,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:13:04,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:13:04,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:04,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:04,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 03:13:04,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:04,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:13:04,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-02-06 03:13:04,458 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 15 [2025-02-06 03:13:04,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:13:04,523 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-06 03:13:04,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:13:04,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2028673923] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:13:04,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:13:04,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2025-02-06 03:13:04,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126569935] [2025-02-06 03:13:04,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:13:04,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:13:04,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:04,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:13:04,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:13:04,565 INFO L87 Difference]: Start difference. First operand 179 states and 255 transitions. Second operand has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 14 states have internal predecessors, (88), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:13:05,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:05,927 INFO L93 Difference]: Finished difference Result 274 states and 386 transitions. [2025-02-06 03:13:05,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 03:13:05,928 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 14 states have internal predecessors, (88), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 103 [2025-02-06 03:13:05,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:05,929 INFO L225 Difference]: With dead ends: 274 [2025-02-06 03:13:05,929 INFO L226 Difference]: Without dead ends: 185 [2025-02-06 03:13:05,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 233 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=849, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 03:13:05,931 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 245 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:05,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1088 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 03:13:05,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-06 03:13:05,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2025-02-06 03:13:05,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 150 states have (on average 1.3733333333333333) internal successors, (206), 150 states have internal predecessors, (206), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:13:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 254 transitions. [2025-02-06 03:13:05,943 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 254 transitions. Word has length 103 [2025-02-06 03:13:05,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:05,943 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 254 transitions. [2025-02-06 03:13:05,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 14 states have internal predecessors, (88), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:13:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 254 transitions. [2025-02-06 03:13:05,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 03:13:05,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:05,948 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] [2025-02-06 03:13:05,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-02-06 03:13:06,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 03:13:06,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:06,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:06,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:06,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2134543381, now seen corresponding path program 1 times [2025-02-06 03:13:06,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:06,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054963271] [2025-02-06 03:13:06,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:06,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:06,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:06,353 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:13:06,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 03:13:06,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 03:13:06,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 03:13:06,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:06,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:06,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:13:06,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:06,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-02-06 03:13:06,641 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 13 treesize of output 9 [2025-02-06 03:13:06,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:13:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-06 03:13:06,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:13:06,815 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054963271] [2025-02-06 03:13:06,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054963271] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:13:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1292304116] [2025-02-06 03:13:06,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:06,816 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:13:06,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:13:06,822 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:13:06,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-02-06 03:13:06,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 03:13:07,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 03:13:07,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:07,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:07,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 03:13:07,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:07,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:13:07,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-02-06 03:13:07,490 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 15 [2025-02-06 03:13:07,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:13:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-06 03:13:07,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:13:07,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1292304116] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:13:07,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:13:07,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-02-06 03:13:07,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164748607] [2025-02-06 03:13:07,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:13:07,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:13:07,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:07,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:13:07,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:13:07,568 INFO L87 Difference]: Start difference. First operand 179 states and 254 transitions. Second operand has 13 states, 11 states have (on average 8.090909090909092) internal successors, (89), 13 states have internal predecessors, (89), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:13:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:08,405 INFO L93 Difference]: Finished difference Result 274 states and 384 transitions. [2025-02-06 03:13:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 03:13:08,406 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.090909090909092) internal successors, (89), 13 states have internal predecessors, (89), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 104 [2025-02-06 03:13:08,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:08,408 INFO L225 Difference]: With dead ends: 274 [2025-02-06 03:13:08,408 INFO L226 Difference]: Without dead ends: 185 [2025-02-06 03:13:08,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=680, Unknown=0, NotChecked=0, Total=870 [2025-02-06 03:13:08,409 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 500 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:08,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 720 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:13:08,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-06 03:13:08,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2025-02-06 03:13:08,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 150 states have (on average 1.3666666666666667) internal successors, (205), 150 states have internal predecessors, (205), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:13:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 253 transitions. [2025-02-06 03:13:08,428 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 253 transitions. Word has length 104 [2025-02-06 03:13:08,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:08,430 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 253 transitions. [2025-02-06 03:13:08,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.090909090909092) internal successors, (89), 13 states have internal predecessors, (89), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:13:08,430 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 253 transitions. [2025-02-06 03:13:08,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 03:13:08,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:08,431 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] [2025-02-06 03:13:08,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-06 03:13:08,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2025-02-06 03:13:08,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:13:08,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:08,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:08,836 INFO L85 PathProgramCache]: Analyzing trace with hash 337592022, now seen corresponding path program 1 times [2025-02-06 03:13:08,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:08,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078562445] [2025-02-06 03:13:08,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:08,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:08,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:08,839 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:13:08,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-06 03:13:08,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 03:13:09,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 03:13:09,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:09,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:09,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:13:09,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:09,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-02-06 03:13:09,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 03:13:09,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:13:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-06 03:13:09,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:13:09,251 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:09,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078562445] [2025-02-06 03:13:09,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078562445] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:13:09,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [800270110] [2025-02-06 03:13:09,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:09,251 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:13:09,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:13:09,253 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:13:09,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-02-06 03:13:09,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 03:13:09,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 03:13:09,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:09,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:09,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 03:13:09,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:09,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:13:09,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-02-06 03:13:09,892 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 15 [2025-02-06 03:13:09,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:13:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-06 03:13:09,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:13:09,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [800270110] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:13:09,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:13:09,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-02-06 03:13:09,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923183765] [2025-02-06 03:13:09,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:13:09,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:13:09,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:09,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:13:09,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:13:09,997 INFO L87 Difference]: Start difference. First operand 179 states and 253 transitions. Second operand has 13 states, 11 states have (on average 8.090909090909092) internal successors, (89), 13 states have internal predecessors, (89), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:13:11,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:11,024 INFO L93 Difference]: Finished difference Result 274 states and 382 transitions. [2025-02-06 03:13:11,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 03:13:11,025 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.090909090909092) internal successors, (89), 13 states have internal predecessors, (89), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 104 [2025-02-06 03:13:11,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:11,026 INFO L225 Difference]: With dead ends: 274 [2025-02-06 03:13:11,026 INFO L226 Difference]: Without dead ends: 185 [2025-02-06 03:13:11,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=680, Unknown=0, NotChecked=0, Total=870 [2025-02-06 03:13:11,028 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 208 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:11,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1119 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:13:11,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-06 03:13:11,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2025-02-06 03:13:11,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 150 states have (on average 1.36) internal successors, (204), 150 states have internal predecessors, (204), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:13:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 252 transitions. [2025-02-06 03:13:11,048 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 252 transitions. Word has length 104 [2025-02-06 03:13:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:11,048 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 252 transitions. [2025-02-06 03:13:11,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.090909090909092) internal successors, (89), 13 states have internal predecessors, (89), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:13:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 252 transitions. [2025-02-06 03:13:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 03:13:11,049 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:11,049 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-02-06 03:13:11,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-06 03:13:11,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-02-06 03:13:11,449 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,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:13:11,450 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:11,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:11,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1571553361, now seen corresponding path program 1 times [2025-02-06 03:13:11,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:11,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24512316] [2025-02-06 03:13:11,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:11,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:11,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:11,453 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:13:11,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-02-06 03:13:11,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:13:11,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:13:11,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:11,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:11,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:13:11,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:13:11,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:11,771 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:11,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24512316] [2025-02-06 03:13:11,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24512316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:11,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:11,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:13:11,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724246554] [2025-02-06 03:13:11,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:11,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:13:11,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:11,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:13:11,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:13:11,772 INFO L87 Difference]: Start difference. First operand 179 states and 252 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 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-02-06 03:13:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:11,896 INFO L93 Difference]: Finished difference Result 357 states and 502 transitions. [2025-02-06 03:13:11,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:13:11,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 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-02-06 03:13:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:11,901 INFO L225 Difference]: With dead ends: 357 [2025-02-06 03:13:11,901 INFO L226 Difference]: Without dead ends: 181 [2025-02-06 03:13:11,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:13:11,902 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 68 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:11,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 377 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:13:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-02-06 03:13:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2025-02-06 03:13:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 150 states have (on average 1.3533333333333333) internal successors, (203), 150 states have internal predecessors, (203), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:13:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 251 transitions. [2025-02-06 03:13:11,916 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 251 transitions. Word has length 105 [2025-02-06 03:13:11,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:11,917 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 251 transitions. [2025-02-06 03:13:11,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 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-02-06 03:13:11,917 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 251 transitions. [2025-02-06 03:13:11,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 03:13:11,919 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:11,919 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-02-06 03:13:11,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-02-06 03:13:12,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:12,120 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:12,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:12,121 INFO L85 PathProgramCache]: Analyzing trace with hash -64001552, now seen corresponding path program 1 times [2025-02-06 03:13:12,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:12,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928149059] [2025-02-06 03:13:12,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:12,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:12,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:12,126 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:13:12,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-02-06 03:13:12,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:13:12,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:13:12,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:12,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:12,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:13:12,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:13:12,468 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:12,468 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:12,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928149059] [2025-02-06 03:13:12,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928149059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:12,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:12,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:13:12,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164953088] [2025-02-06 03:13:12,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:12,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:13:12,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:12,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:13:12,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:13:12,469 INFO L87 Difference]: Start difference. First operand 179 states and 251 transitions. Second operand has 5 states, 5 states have (on average 9.6) 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-02-06 03:13:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:12,618 INFO L93 Difference]: Finished difference Result 357 states and 500 transitions. [2025-02-06 03:13:12,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:13:12,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) 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-02-06 03:13:12,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:12,620 INFO L225 Difference]: With dead ends: 357 [2025-02-06 03:13:12,620 INFO L226 Difference]: Without dead ends: 181 [2025-02-06 03:13:12,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:13:12,620 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 66 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:12,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 502 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:13:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-02-06 03:13:12,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2025-02-06 03:13:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 150 states have (on average 1.3466666666666667) internal successors, (202), 150 states have internal predecessors, (202), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:13:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 250 transitions. [2025-02-06 03:13:12,630 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 250 transitions. Word has length 105 [2025-02-06 03:13:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:12,630 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 250 transitions. [2025-02-06 03:13:12,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) 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-02-06 03:13:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 250 transitions. [2025-02-06 03:13:12,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 03:13:12,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:12,631 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] [2025-02-06 03:13:12,638 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 (12)] Forceful destruction successful, exit code 0 [2025-02-06 03:13:12,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:12,832 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:12,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:12,832 INFO L85 PathProgramCache]: Analyzing trace with hash 992801463, now seen corresponding path program 1 times [2025-02-06 03:13:12,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:12,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587459538] [2025-02-06 03:13:12,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:12,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:12,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:12,836 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:13:12,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-02-06 03:13:12,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 03:13:12,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 03:13:12,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:12,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:12,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:13:12,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:13:13,141 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:13,141 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:13,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587459538] [2025-02-06 03:13:13,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587459538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:13,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:13,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:13:13,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882242861] [2025-02-06 03:13:13,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:13,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:13:13,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:13,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:13:13,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:13:13,142 INFO L87 Difference]: Start difference. First operand 179 states and 250 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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-02-06 03:13:13,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:13,305 INFO L93 Difference]: Finished difference Result 357 states and 498 transitions. [2025-02-06 03:13:13,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:13:13,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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 106 [2025-02-06 03:13:13,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:13,307 INFO L225 Difference]: With dead ends: 357 [2025-02-06 03:13:13,307 INFO L226 Difference]: Without dead ends: 181 [2025-02-06 03:13:13,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:13:13,308 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 61 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:13,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 375 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:13:13,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-02-06 03:13:13,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2025-02-06 03:13:13,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 150 states have (on average 1.34) internal successors, (201), 150 states have internal predecessors, (201), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:13:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 249 transitions. [2025-02-06 03:13:13,325 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 249 transitions. Word has length 106 [2025-02-06 03:13:13,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:13,325 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 249 transitions. [2025-02-06 03:13:13,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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-02-06 03:13:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 249 transitions. [2025-02-06 03:13:13,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 03:13:13,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:13,326 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] [2025-02-06 03:13:13,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-02-06 03:13:13,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:13,527 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:13,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:13,527 INFO L85 PathProgramCache]: Analyzing trace with hash -804149896, now seen corresponding path program 1 times [2025-02-06 03:13:13,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:13,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155875694] [2025-02-06 03:13:13,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:13,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:13,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:13,531 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:13:13,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-02-06 03:13:13,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 03:13:13,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 03:13:13,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:13,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:13,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:13:13,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:13,843 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:13:13,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:13,844 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:13,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155875694] [2025-02-06 03:13:13,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155875694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:13,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:13,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:13:13,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634976385] [2025-02-06 03:13:13,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:13,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:13:13,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:13,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:13:13,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:13:13,845 INFO L87 Difference]: Start difference. First operand 179 states and 249 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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-02-06 03:13:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:14,022 INFO L93 Difference]: Finished difference Result 357 states and 496 transitions. [2025-02-06 03:13:14,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:13:14,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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 106 [2025-02-06 03:13:14,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:14,024 INFO L225 Difference]: With dead ends: 357 [2025-02-06 03:13:14,024 INFO L226 Difference]: Without dead ends: 181 [2025-02-06 03:13:14,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:13:14,025 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 59 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:14,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 425 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:13:14,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-02-06 03:13:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 92. [2025-02-06 03:13:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:13:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 126 transitions. [2025-02-06 03:13:14,031 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 126 transitions. Word has length 106 [2025-02-06 03:13:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:14,031 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 126 transitions. [2025-02-06 03:13:14,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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-02-06 03:13:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 126 transitions. [2025-02-06 03:13:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 03:13:14,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:14,032 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] [2025-02-06 03:13:14,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-02-06 03:13:14,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:14,236 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:14,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:14,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1132423088, now seen corresponding path program 1 times [2025-02-06 03:13:14,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:14,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035211230] [2025-02-06 03:13:14,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:14,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:14,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:14,240 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:13:14,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-02-06 03:13:14,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 03:13:14,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 03:13:14,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:14,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:14,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:13:14,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:14,431 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:13:14,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:14,431 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:14,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035211230] [2025-02-06 03:13:14,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035211230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:14,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:14,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:13:14,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196625616] [2025-02-06 03:13:14,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:14,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:13:14,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:14,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:13:14,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:13:14,432 INFO L87 Difference]: Start difference. First operand 92 states and 126 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-02-06 03:13:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:14,455 INFO L93 Difference]: Finished difference Result 184 states and 253 transitions. [2025-02-06 03:13:14,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:13:14,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 106 [2025-02-06 03:13:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:14,456 INFO L225 Difference]: With dead ends: 184 [2025-02-06 03:13:14,456 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 03:13:14,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:13:14,457 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:14,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 466 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:13:14,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 03:13:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-06 03:13:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:13:14,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2025-02-06 03:13:14,471 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 106 [2025-02-06 03:13:14,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:14,471 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2025-02-06 03:13:14,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-02-06 03:13:14,471 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2025-02-06 03:13:14,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:13:14,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:14,472 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-02-06 03:13:14,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-02-06 03:13:14,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:14,673 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:14,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:14,674 INFO L85 PathProgramCache]: Analyzing trace with hash 21983346, now seen corresponding path program 1 times [2025-02-06 03:13:14,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:14,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222875487] [2025-02-06 03:13:14,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:14,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:14,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:14,676 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:13:14,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-02-06 03:13:14,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:13:14,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:13:14,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:14,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:14,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:13:14,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:14,891 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 55 treesize of output 31 [2025-02-06 03:13:14,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-02-06 03:13:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:13:14,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:14,920 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:14,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222875487] [2025-02-06 03:13:14,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222875487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:14,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:14,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:13:14,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584359819] [2025-02-06 03:13:14,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:14,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:13:14,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:14,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:13:14,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:13:14,921 INFO L87 Difference]: Start difference. First operand 95 states and 129 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-02-06 03:13:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:15,233 INFO L93 Difference]: Finished difference Result 242 states and 329 transitions. [2025-02-06 03:13:15,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:13:15,234 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-02-06 03:13:15,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:15,235 INFO L225 Difference]: With dead ends: 242 [2025-02-06 03:13:15,235 INFO L226 Difference]: Without dead ends: 150 [2025-02-06 03:13:15,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:13:15,235 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 70 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:15,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 362 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:13:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-02-06 03:13:15,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2025-02-06 03:13:15,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 125 states have (on average 1.312) internal successors, (164), 126 states have internal predecessors, (164), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:13:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 200 transitions. [2025-02-06 03:13:15,243 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 200 transitions. Word has length 108 [2025-02-06 03:13:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:15,244 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 200 transitions. [2025-02-06 03:13:15,244 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-02-06 03:13:15,244 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 200 transitions. [2025-02-06 03:13:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:13:15,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:15,245 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-02-06 03:13:15,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-02-06 03:13:15,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:15,449 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:15,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:15,450 INFO L85 PathProgramCache]: Analyzing trace with hash -248141337, now seen corresponding path program 1 times [2025-02-06 03:13:15,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:15,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029284561] [2025-02-06 03:13:15,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:15,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:15,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:15,452 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:13:15,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-02-06 03:13:15,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:13:15,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:13:15,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:15,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:15,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:13:15,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:13:15,633 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:15,633 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:15,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029284561] [2025-02-06 03:13:15,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029284561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:15,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:15,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:13:15,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091888724] [2025-02-06 03:13:15,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:15,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:13:15,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:15,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:13:15,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:13:15,634 INFO L87 Difference]: Start difference. First operand 147 states and 200 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-02-06 03:13:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:15,660 INFO L93 Difference]: Finished difference Result 297 states and 405 transitions. [2025-02-06 03:13:15,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:13:15,661 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-02-06 03:13:15,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:15,662 INFO L225 Difference]: With dead ends: 297 [2025-02-06 03:13:15,662 INFO L226 Difference]: Without dead ends: 153 [2025-02-06 03:13:15,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:13:15,663 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 464 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.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:15,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 464 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:13:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-06 03:13:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-02-06 03:13:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 131 states have (on average 1.297709923664122) internal successors, (170), 132 states have internal predecessors, (170), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:13:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 206 transitions. [2025-02-06 03:13:15,683 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 206 transitions. Word has length 108 [2025-02-06 03:13:15,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:15,683 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 206 transitions. [2025-02-06 03:13:15,683 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-02-06 03:13:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 206 transitions. [2025-02-06 03:13:15,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:13:15,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:15,684 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-02-06 03:13:15,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2025-02-06 03:13:15,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:15,885 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:15,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:15,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1417316304, now seen corresponding path program 1 times [2025-02-06 03:13:15,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:15,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854415239] [2025-02-06 03:13:15,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:15,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:15,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:15,888 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:13:15,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-02-06 03:13:15,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:13:16,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:13:16,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:16,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:16,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:13:16,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:16,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 03:13:16,169 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-06 03:13:16,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:13:16,252 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:16,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854415239] [2025-02-06 03:13:16,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854415239] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:13:16,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1513936605] [2025-02-06 03:13:16,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:16,252 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:13:16,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:13:16,254 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:13:16,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2025-02-06 03:13:16,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:13:16,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:13:16,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:16,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:16,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:13:16,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:16,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-06 03:13:17,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-02-06 03:13:17,290 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-06 03:13:17,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:13:17,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1513936605] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:13:17,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:13:17,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2025-02-06 03:13:17,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061666202] [2025-02-06 03:13:17,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:13:17,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:13:17,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:17,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:13:17,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:13:17,337 INFO L87 Difference]: Start difference. First operand 153 states and 206 transitions. Second operand has 13 states, 11 states have (on average 9.0) internal successors, (99), 12 states have internal predecessors, (99), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:13:17,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:17,794 INFO L93 Difference]: Finished difference Result 249 states and 331 transitions. [2025-02-06 03:13:17,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:13:17,794 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 9.0) internal successors, (99), 12 states have internal predecessors, (99), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 110 [2025-02-06 03:13:17,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:17,795 INFO L225 Difference]: With dead ends: 249 [2025-02-06 03:13:17,795 INFO L226 Difference]: Without dead ends: 99 [2025-02-06 03:13:17,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:13:17,796 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 136 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:17,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 518 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:13:17,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-06 03:13:17,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2025-02-06 03:13:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:13:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2025-02-06 03:13:17,810 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 110 [2025-02-06 03:13:17,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:17,810 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2025-02-06 03:13:17,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 9.0) internal successors, (99), 12 states have internal predecessors, (99), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:13:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2025-02-06 03:13:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:13:17,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:17,811 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-02-06 03:13:17,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2025-02-06 03:13:18,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2025-02-06 03:13:18,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:18,215 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:18,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:18,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1288804397, now seen corresponding path program 1 times [2025-02-06 03:13:18,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:18,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861253542] [2025-02-06 03:13:18,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:18,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:18,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:18,218 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:13:18,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2025-02-06 03:13:18,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:13:18,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:13:18,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:18,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:18,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:13:18,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:18,541 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 19 treesize of output 11 [2025-02-06 03:13:19,891 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:13:19,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:19,891 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:19,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861253542] [2025-02-06 03:13:19,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861253542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:19,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:19,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:13:19,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462976688] [2025-02-06 03:13:19,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:19,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:13:19,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:19,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:13:19,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:13:19,892 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) 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-02-06 03:13:21,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:13:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:26,297 INFO L93 Difference]: Finished difference Result 400 states and 511 transitions. [2025-02-06 03:13:26,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:13:26,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) 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-02-06 03:13:26,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:26,302 INFO L225 Difference]: With dead ends: 400 [2025-02-06 03:13:26,302 INFO L226 Difference]: Without dead ends: 308 [2025-02-06 03:13:26,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:13:26,303 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 255 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:26,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 657 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2025-02-06 03:13:26,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-02-06 03:13:26,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 252. [2025-02-06 03:13:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 216 states have (on average 1.2453703703703705) internal successors, (269), 217 states have internal predecessors, (269), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:13:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 325 transitions. [2025-02-06 03:13:26,318 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 325 transitions. Word has length 110 [2025-02-06 03:13:26,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:26,318 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 325 transitions. [2025-02-06 03:13:26,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) 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-02-06 03:13:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 325 transitions. [2025-02-06 03:13:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:13:26,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:26,319 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-02-06 03:13:26,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2025-02-06 03:13:26,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:26,520 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:26,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:26,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1399719519, now seen corresponding path program 1 times [2025-02-06 03:13:26,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:26,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059751791] [2025-02-06 03:13:26,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:26,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:26,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:26,527 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:13:26,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2025-02-06 03:13:26,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:13:26,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:13:26,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:26,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:26,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 03:13:26,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:26,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-02-06 03:13:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:13:26,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:26,850 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:26,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059751791] [2025-02-06 03:13:26,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059751791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:26,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:26,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:13:26,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564108182] [2025-02-06 03:13:26,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:26,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:13:26,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:26,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:13:26,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:13:26,852 INFO L87 Difference]: Start difference. First operand 252 states and 325 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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-02-06 03:13:27,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:27,148 INFO L93 Difference]: Finished difference Result 321 states and 412 transitions. [2025-02-06 03:13:27,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:13:27,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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-02-06 03:13:27,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:27,152 INFO L225 Difference]: With dead ends: 321 [2025-02-06 03:13:27,152 INFO L226 Difference]: Without dead ends: 319 [2025-02-06 03:13:27,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:13:27,153 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 63 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:27,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 757 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:13:27,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-02-06 03:13:27,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 281. [2025-02-06 03:13:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 245 states have (on average 1.236734693877551) internal successors, (303), 246 states have internal predecessors, (303), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:13:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 359 transitions. [2025-02-06 03:13:27,185 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 359 transitions. Word has length 110 [2025-02-06 03:13:27,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:27,185 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 359 transitions. [2025-02-06 03:13:27,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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-02-06 03:13:27,185 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 359 transitions. [2025-02-06 03:13:27,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 03:13:27,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:27,186 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-02-06 03:13:27,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2025-02-06 03:13:27,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:27,387 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:27,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:27,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1921053406, now seen corresponding path program 1 times [2025-02-06 03:13:27,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:27,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518353464] [2025-02-06 03:13:27,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:27,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:27,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:27,390 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:13:27,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2025-02-06 03:13:27,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:13:27,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:13:27,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:27,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:27,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 03:13:27,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:27,643 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-02-06 03:13:28,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:13:28,146 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 39 treesize of output 19 [2025-02-06 03:13:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-06 03:13:28,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:13:28,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:13:28,628 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 45 treesize of output 25 [2025-02-06 03:13:28,819 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:28,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518353464] [2025-02-06 03:13:28,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518353464] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:13:28,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1651224289] [2025-02-06 03:13:28,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:28,819 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:13:28,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:13:28,821 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:13:28,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2025-02-06 03:13:28,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:13:29,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:13:29,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:29,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:29,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 03:13:29,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:29,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-06 03:13:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-06 03:13:30,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:13:30,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1651224289] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:13:30,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:13:30,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2025-02-06 03:13:30,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295967235] [2025-02-06 03:13:30,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:13:30,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 03:13:30,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:30,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 03:13:30,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2025-02-06 03:13:30,733 INFO L87 Difference]: Start difference. First operand 281 states and 359 transitions. Second operand has 19 states, 17 states have (on average 5.588235294117647) internal successors, (95), 17 states have internal predecessors, (95), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:13:33,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:33,857 INFO L93 Difference]: Finished difference Result 815 states and 1027 transitions. [2025-02-06 03:13:33,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 03:13:33,866 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.588235294117647) internal successors, (95), 17 states have internal predecessors, (95), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 111 [2025-02-06 03:13:33,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:33,868 INFO L225 Difference]: With dead ends: 815 [2025-02-06 03:13:33,868 INFO L226 Difference]: Without dead ends: 537 [2025-02-06 03:13:33,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=571, Invalid=2399, Unknown=0, NotChecked=0, Total=2970 [2025-02-06 03:13:33,869 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 610 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:33,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1261 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 03:13:33,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-02-06 03:13:33,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 281. [2025-02-06 03:13:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 245 states have (on average 1.2326530612244897) internal successors, (302), 246 states have internal predecessors, (302), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:13:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 358 transitions. [2025-02-06 03:13:33,914 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 358 transitions. Word has length 111 [2025-02-06 03:13:33,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:33,915 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 358 transitions. [2025-02-06 03:13:33,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.588235294117647) internal successors, (95), 17 states have internal predecessors, (95), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:13:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 358 transitions. [2025-02-06 03:13:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 03:13:33,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:33,916 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-02-06 03:13:33,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2025-02-06 03:13:34,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2025-02-06 03:13:34,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:13:34,321 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:34,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:34,322 INFO L85 PathProgramCache]: Analyzing trace with hash 120417153, now seen corresponding path program 1 times [2025-02-06 03:13:34,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:34,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377150642] [2025-02-06 03:13:34,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:34,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:34,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:34,324 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:13:34,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2025-02-06 03:13:34,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:13:34,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:13:34,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:34,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:34,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 03:13:34,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:34,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:13:34,980 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 80 treesize of output 42 [2025-02-06 03:13:34,986 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 24 [2025-02-06 03:13:35,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-02-06 03:13:35,070 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:35,070 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:35,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377150642] [2025-02-06 03:13:35,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377150642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:35,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:35,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:13:35,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865534556] [2025-02-06 03:13:35,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:35,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:13:35,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:35,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:13:35,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:13:35,071 INFO L87 Difference]: Start difference. First operand 281 states and 358 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 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-02-06 03:13:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:36,394 INFO L93 Difference]: Finished difference Result 679 states and 857 transitions. [2025-02-06 03:13:36,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:13:36,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 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-02-06 03:13:36,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:36,401 INFO L225 Difference]: With dead ends: 679 [2025-02-06 03:13:36,401 INFO L226 Difference]: Without dead ends: 401 [2025-02-06 03:13:36,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:13:36,402 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 210 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:36,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 630 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 03:13:36,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-02-06 03:13:36,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 320. [2025-02-06 03:13:36,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 284 states have (on average 1.2077464788732395) internal successors, (343), 285 states have internal predecessors, (343), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:13:36,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 399 transitions. [2025-02-06 03:13:36,422 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 399 transitions. Word has length 112 [2025-02-06 03:13:36,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:36,423 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 399 transitions. [2025-02-06 03:13:36,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 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-02-06 03:13:36,423 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 399 transitions. [2025-02-06 03:13:36,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:13:36,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:36,424 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, 1] [2025-02-06 03:13:36,434 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 (24)] Ended with exit code 0 [2025-02-06 03:13:36,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:36,628 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:36,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:36,629 INFO L85 PathProgramCache]: Analyzing trace with hash -462144, now seen corresponding path program 1 times [2025-02-06 03:13:36,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:36,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5583188] [2025-02-06 03:13:36,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:36,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:36,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:36,631 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:13:36,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2025-02-06 03:13:36,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:13:36,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:13:36,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:36,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:36,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 03:13:36,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:36,900 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-02-06 03:13:37,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:13:37,578 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 39 treesize of output 19 [2025-02-06 03:13:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-06 03:13:37,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:13:38,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:13:38,115 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 45 treesize of output 25 [2025-02-06 03:13:38,317 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:38,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5583188] [2025-02-06 03:13:38,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5583188] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:13:38,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1785266110] [2025-02-06 03:13:38,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:38,318 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:13:38,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:13:38,321 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:13:38,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2025-02-06 03:13:38,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:13:38,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:13:38,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:38,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:38,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 03:13:38,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:39,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-06 03:13:39,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:13:39,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 23 [2025-02-06 03:13:39,989 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-06 03:13:39,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:13:40,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1785266110] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:13:40,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:13:40,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2025-02-06 03:13:40,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863980371] [2025-02-06 03:13:40,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:13:40,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 03:13:40,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:40,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 03:13:40,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=874, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 03:13:40,369 INFO L87 Difference]: Start difference. First operand 320 states and 399 transitions. Second operand has 21 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24)