./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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-54.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f657570a1e1457f1f304b0d552f8742bb723e9b2810b7fa1033cb000332d16c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:17:20,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:17:20,238 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:17:20,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:17:20,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:17:20,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:17:20,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:17:20,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:17:20,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:17:20,262 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:17:20,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:17:20,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:17:20,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:17:20,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:17:20,263 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:17:20,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:17:20,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:17:20,264 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:17:20,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:17:20,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:17:20,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:17:20,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:17:20,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:17:20,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:17:20,264 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:17:20,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:17:20,264 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:17:20,264 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:17:20,264 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:17:20,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:17:20,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:17:20,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:17:20,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:17:20,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:17:20,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:17:20,265 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:17:20,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:17:20,265 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:17:20,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:17:20,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:17:20,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:17:20,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:17:20,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:17:20,265 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f657570a1e1457f1f304b0d552f8742bb723e9b2810b7fa1033cb000332d16c [2025-02-06 03:17:20,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:17:20,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:17:20,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:17:20,526 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:17:20,526 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:17:20,528 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i [2025-02-06 03:17:21,639 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/905bdde03/86ea8eb12f314edd963f04c7284c3e4c/FLAG57c0aa3a7 [2025-02-06 03:17:21,913 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:17:21,913 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i [2025-02-06 03:17:21,924 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/905bdde03/86ea8eb12f314edd963f04c7284c3e4c/FLAG57c0aa3a7 [2025-02-06 03:17:22,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/905bdde03/86ea8eb12f314edd963f04c7284c3e4c [2025-02-06 03:17:22,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:17:22,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:17:22,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:17:22,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:17:22,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:17:22,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:17:22" (1/1) ... [2025-02-06 03:17:22,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c89864d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:22, skipping insertion in model container [2025-02-06 03:17:22,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:17:22" (1/1) ... [2025-02-06 03:17:22,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:17:22,328 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i[916,929] [2025-02-06 03:17:22,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:17:22,389 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:17:22,397 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i[916,929] [2025-02-06 03:17:22,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:17:22,445 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:17:22,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:22 WrapperNode [2025-02-06 03:17:22,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:17:22,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:17:22,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:17:22,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:17:22,451 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:17:22" (1/1) ... [2025-02-06 03:17:22,460 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:17:22" (1/1) ... [2025-02-06 03:17:22,491 INFO L138 Inliner]: procedures = 29, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 467 [2025-02-06 03:17:22,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:17:22,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:17:22,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:17:22,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:17:22,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:22" (1/1) ... [2025-02-06 03:17:22,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:22" (1/1) ... [2025-02-06 03:17:22,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:22" (1/1) ... [2025-02-06 03:17:22,532 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 33, 41, 7, 13, 19]. 36 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 3, 1, 2, 2]. The 16 writes are split as follows [0, 7, 4, 1, 2, 2]. [2025-02-06 03:17:22,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:22" (1/1) ... [2025-02-06 03:17:22,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:22" (1/1) ... [2025-02-06 03:17:22,556 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:22" (1/1) ... [2025-02-06 03:17:22,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:22" (1/1) ... [2025-02-06 03:17:22,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:22" (1/1) ... [2025-02-06 03:17:22,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:22" (1/1) ... [2025-02-06 03:17:22,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:17:22,569 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:17:22,570 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:17:22,570 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:17:22,571 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:22" (1/1) ... [2025-02-06 03:17:22,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:17:22,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:17:22,603 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:17:22,609 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:17:22,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:17:22,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:17:22,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:17:22,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:17:22,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:17:22,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:17:22,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:17:22,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:17:22,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:17:22,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:17:22,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:17:22,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:17:22,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:17:22,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:17:22,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:17:22,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:17:22,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:17:22,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:17:22,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:17:22,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:17:22,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:17:22,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:17:22,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:17:22,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:17:22,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:17:22,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:17:22,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:17:22,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:17:22,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:17:22,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:17:22,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:17:22,629 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:17:22,630 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:17:22,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:17:22,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:17:22,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:17:22,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:17:22,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:17:22,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:17:22,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:17:22,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:17:22,734 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:17:22,735 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:17:23,076 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc property_#t~mem71#1;havoc property_#t~ite76#1;havoc property_#t~mem75#1;havoc property_#t~mem72#1;havoc property_#t~ite74#1;havoc property_#t~mem73#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~ite99#1;havoc property_#t~mem81#1;havoc property_#t~ite96#1;havoc property_#t~mem86#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~short85#1;havoc property_#t~mem91#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite95#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem94#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~short100#1;havoc property_#t~mem101#1;havoc property_#t~ite119#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite118#1;havoc property_#t~mem113#1;havoc property_#t~mem104#1;havoc property_#t~ite106#1;havoc property_#t~mem105#1;havoc property_#t~mem107#1;havoc property_#t~ite112#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~short120#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-02-06 03:17:23,118 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-02-06 03:17:23,118 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:17:23,128 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:17:23,130 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:17:23,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:17:23 BoogieIcfgContainer [2025-02-06 03:17:23,130 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:17:23,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:17:23,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:17:23,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:17:23,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:17:22" (1/3) ... [2025-02-06 03:17:23,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a785e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:17:23, skipping insertion in model container [2025-02-06 03:17:23,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:22" (2/3) ... [2025-02-06 03:17:23,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a785e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:17:23, skipping insertion in model container [2025-02-06 03:17:23,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:17:23" (3/3) ... [2025-02-06 03:17:23,137 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-54.i [2025-02-06 03:17:23,148 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:17:23,150 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-54.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:17:23,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:17:23,211 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;@11f5ed9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:17:23,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:17:23,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:17:23,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 03:17:23,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:23,224 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:17:23,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:23,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:23,229 INFO L85 PathProgramCache]: Analyzing trace with hash 36873229, now seen corresponding path program 1 times [2025-02-06 03:17:23,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:23,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129260986] [2025-02-06 03:17:23,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:23,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:23,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:17:23,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:17:23,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:23,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:23,467 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:17:23,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:23,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129260986] [2025-02-06 03:17:23,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129260986] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:17:23,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699051808] [2025-02-06 03:17:23,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:23,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:17:23,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:17:23,472 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:17:23,473 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:17:23,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:17:23,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:17:23,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:23,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:23,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:17:23,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:23,682 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:17:23,682 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:17:23,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699051808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:23,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:17:23,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:17:23,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221461906] [2025-02-06 03:17:23,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:23,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:17:23,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:23,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:17:23,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:17:23,705 INFO L87 Difference]: Start difference. First operand has 109 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:17:23,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:23,723 INFO L93 Difference]: Finished difference Result 212 states and 327 transitions. [2025-02-06 03:17:23,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:17:23,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-02-06 03:17:23,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:23,729 INFO L225 Difference]: With dead ends: 212 [2025-02-06 03:17:23,729 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 03:17:23,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:17:23,733 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:23,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:17:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 03:17:23,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-02-06 03:17:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:17:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2025-02-06 03:17:23,768 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 105 [2025-02-06 03:17:23,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:23,768 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2025-02-06 03:17:23,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:17:23,770 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2025-02-06 03:17:23,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 03:17:23,774 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:23,774 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:17:23,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:17:23,974 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:17:23,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:23,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:23,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1403267427, now seen corresponding path program 1 times [2025-02-06 03:17:23,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:23,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569643218] [2025-02-06 03:17:23,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:23,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:23,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:17:24,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:17:24,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:24,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:24,285 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:17:24,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:24,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569643218] [2025-02-06 03:17:24,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569643218] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:17:24,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933008491] [2025-02-06 03:17:24,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:24,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:17:24,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:17:24,288 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:17:24,290 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:17:24,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:17:24,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:17:24,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:24,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:24,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:17:24,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:24,471 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:17:24,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:17:24,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933008491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:24,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:17:24,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:17:24,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419564175] [2025-02-06 03:17:24,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:24,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:17:24,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:24,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:17:24,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:17:24,476 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:24,517 INFO L93 Difference]: Finished difference Result 212 states and 311 transitions. [2025-02-06 03:17:24,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:17:24,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-02-06 03:17:24,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:24,519 INFO L225 Difference]: With dead ends: 212 [2025-02-06 03:17:24,519 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 03:17:24,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:17:24,520 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:24,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:17:24,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 03:17:24,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-02-06 03:17:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:17:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2025-02-06 03:17:24,527 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 105 [2025-02-06 03:17:24,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:24,528 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2025-02-06 03:17:24,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:24,528 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2025-02-06 03:17:24,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 03:17:24,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:24,530 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:17:24,536 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:17:24,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:17:24,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:24,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:24,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2004196188, now seen corresponding path program 1 times [2025-02-06 03:17:24,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:24,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883038386] [2025-02-06 03:17:24,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:24,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:24,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:17:24,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:17:24,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:24,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:24,905 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:17:24,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:24,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883038386] [2025-02-06 03:17:24,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883038386] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:17:24,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799019812] [2025-02-06 03:17:24,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:24,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:17:24,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:17:24,907 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:17:24,909 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:17:25,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:17:25,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:17:25,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:25,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:25,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:17:25,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:25,073 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:17:25,073 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:17:25,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799019812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:25,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:17:25,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:17:25,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281479408] [2025-02-06 03:17:25,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:25,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:17:25,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:25,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:17:25,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:17:25,075 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:25,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:25,098 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2025-02-06 03:17:25,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:17:25,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-02-06 03:17:25,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:25,101 INFO L225 Difference]: With dead ends: 216 [2025-02-06 03:17:25,101 INFO L226 Difference]: Without dead ends: 111 [2025-02-06 03:17:25,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:17:25,101 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:25,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:17:25,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-06 03:17:25,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-02-06 03:17:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:17:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2025-02-06 03:17:25,112 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 105 [2025-02-06 03:17:25,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:25,113 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2025-02-06 03:17:25,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2025-02-06 03:17:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 03:17:25,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:25,114 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:17:25,120 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:17:25,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:17:25,315 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:25,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:25,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2003272667, now seen corresponding path program 1 times [2025-02-06 03:17:25,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:25,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705970334] [2025-02-06 03:17:25,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:25,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:25,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:17:25,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:17:25,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:25,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:25,443 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:17:25,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:25,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705970334] [2025-02-06 03:17:25,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705970334] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:17:25,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482248119] [2025-02-06 03:17:25,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:25,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:17:25,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:17:25,447 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:17:25,448 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:17:25,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:17:25,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:17:25,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:25,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:25,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:17:25,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:25,585 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:17:25,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:17:25,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482248119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:25,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:17:25,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 03:17:25,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666391119] [2025-02-06 03:17:25,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:25,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:17:25,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:25,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:17:25,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:17:25,587 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:25,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:25,603 INFO L93 Difference]: Finished difference Result 219 states and 318 transitions. [2025-02-06 03:17:25,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:17:25,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-02-06 03:17:25,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:25,607 INFO L225 Difference]: With dead ends: 219 [2025-02-06 03:17:25,607 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 03:17:25,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:17:25,608 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:25,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:17:25,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 03:17:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-06 03:17:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:17:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2025-02-06 03:17:25,617 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 105 [2025-02-06 03:17:25,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:25,618 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2025-02-06 03:17:25,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:25,618 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2025-02-06 03:17:25,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 03:17:25,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:25,620 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:17:25,627 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:17:25,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:17:25,824 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:25,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:25,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1176914909, now seen corresponding path program 1 times [2025-02-06 03:17:25,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:25,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712307314] [2025-02-06 03:17:25,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:25,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:25,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 03:17:25,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 03:17:25,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:25,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:25,998 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:17:25,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:25,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712307314] [2025-02-06 03:17:25,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712307314] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:25,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:25,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:17:25,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885587347] [2025-02-06 03:17:25,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:25,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:17:25,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:25,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:17:26,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:17:26,000 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:26,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:26,087 INFO L93 Difference]: Finished difference Result 323 states and 466 transitions. [2025-02-06 03:17:26,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:17:26,087 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:17:26,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:26,088 INFO L225 Difference]: With dead ends: 323 [2025-02-06 03:17:26,088 INFO L226 Difference]: Without dead ends: 214 [2025-02-06 03:17:26,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:17:26,089 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 136 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:26,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 550 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:17:26,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-02-06 03:17:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 133. [2025-02-06 03:17:26,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 119 states have (on average 1.4285714285714286) internal successors, (170), 119 states have internal predecessors, (170), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:17:26,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 194 transitions. [2025-02-06 03:17:26,103 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 194 transitions. Word has length 107 [2025-02-06 03:17:26,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:26,103 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 194 transitions. [2025-02-06 03:17:26,103 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:17:26,103 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 194 transitions. [2025-02-06 03:17:26,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:17:26,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:26,104 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:17:26,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:17:26,105 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:26,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:26,106 INFO L85 PathProgramCache]: Analyzing trace with hash 584232187, now seen corresponding path program 1 times [2025-02-06 03:17:26,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:26,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090237275] [2025-02-06 03:17:26,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:26,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:26,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:17:26,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:17:26,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:26,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:26,260 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:17:26,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:26,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090237275] [2025-02-06 03:17:26,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090237275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:26,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:26,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:17:26,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093296866] [2025-02-06 03:17:26,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:26,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:17:26,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:26,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:17:26,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:17:26,261 INFO L87 Difference]: Start difference. First operand 133 states and 194 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:26,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:26,308 INFO L93 Difference]: Finished difference Result 368 states and 536 transitions. [2025-02-06 03:17:26,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:17:26,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-02-06 03:17:26,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:26,310 INFO L225 Difference]: With dead ends: 368 [2025-02-06 03:17:26,310 INFO L226 Difference]: Without dead ends: 238 [2025-02-06 03:17:26,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:17:26,311 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 109 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:26,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 421 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:17:26,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-06 03:17:26,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2025-02-06 03:17:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 207 states have internal predecessors, (292), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:17:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 340 transitions. [2025-02-06 03:17:26,331 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 340 transitions. Word has length 108 [2025-02-06 03:17:26,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:26,331 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 340 transitions. [2025-02-06 03:17:26,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:26,331 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 340 transitions. [2025-02-06 03:17:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:17:26,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:26,333 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:17:26,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:17:26,333 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:26,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:26,334 INFO L85 PathProgramCache]: Analyzing trace with hash 175407962, now seen corresponding path program 1 times [2025-02-06 03:17:26,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:26,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497633448] [2025-02-06 03:17:26,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:26,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:26,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:17:26,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:17:26,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:26,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:26,615 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:17:26,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:26,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497633448] [2025-02-06 03:17:26,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497633448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:26,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:26,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:17:26,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136569558] [2025-02-06 03:17:26,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:26,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:17:26,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:26,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:17:26,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:17:26,616 INFO L87 Difference]: Start difference. First operand 234 states and 340 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:26,711 INFO L93 Difference]: Finished difference Result 469 states and 681 transitions. [2025-02-06 03:17:26,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:17:26,711 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:17:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:26,712 INFO L225 Difference]: With dead ends: 469 [2025-02-06 03:17:26,713 INFO L226 Difference]: Without dead ends: 238 [2025-02-06 03:17:26,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:17:26,713 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 101 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:26,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 529 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:17:26,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-06 03:17:26,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2025-02-06 03:17:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.4057971014492754) internal successors, (291), 207 states have internal predecessors, (291), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:17:26,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 339 transitions. [2025-02-06 03:17:26,729 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 339 transitions. Word has length 108 [2025-02-06 03:17:26,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:26,730 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 339 transitions. [2025-02-06 03:17:26,730 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:17:26,730 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 339 transitions. [2025-02-06 03:17:26,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:17:26,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:26,731 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:17:26,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:17:26,731 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:26,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:26,731 INFO L85 PathProgramCache]: Analyzing trace with hash -117995045, now seen corresponding path program 1 times [2025-02-06 03:17:26,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:26,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193928400] [2025-02-06 03:17:26,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:26,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:26,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:17:26,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:17:26,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:26,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:27,410 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:17:27,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:27,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193928400] [2025-02-06 03:17:27,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193928400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:27,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:27,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:17:27,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138185130] [2025-02-06 03:17:27,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:27,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:17:27,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:27,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:17:27,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:17:27,412 INFO L87 Difference]: Start difference. First operand 234 states and 339 transitions. Second operand has 8 states, 6 states have (on average 8.5) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 03:17:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:27,585 INFO L93 Difference]: Finished difference Result 579 states and 826 transitions. [2025-02-06 03:17:27,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:17:27,585 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.5) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-02-06 03:17:27,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:27,587 INFO L225 Difference]: With dead ends: 579 [2025-02-06 03:17:27,587 INFO L226 Difference]: Without dead ends: 348 [2025-02-06 03:17:27,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:17:27,588 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 67 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:27,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 912 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:17:27,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-02-06 03:17:27,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 344. [2025-02-06 03:17:27,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 311 states have (on average 1.3794212218649518) internal successors, (429), 313 states have internal predecessors, (429), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:17:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 485 transitions. [2025-02-06 03:17:27,607 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 485 transitions. Word has length 108 [2025-02-06 03:17:27,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:27,607 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 485 transitions. [2025-02-06 03:17:27,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.5) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 03:17:27,608 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 485 transitions. [2025-02-06 03:17:27,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:17:27,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:27,609 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:17:27,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:17:27,609 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:27,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:27,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1976378881, now seen corresponding path program 1 times [2025-02-06 03:17:27,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:27,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448532912] [2025-02-06 03:17:27,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:27,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:27,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:17:27,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:17:27,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:27,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:28,197 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:17:28,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:28,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448532912] [2025-02-06 03:17:28,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448532912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:28,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:28,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:17:28,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874426723] [2025-02-06 03:17:28,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:28,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:17:28,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:28,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:17:28,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:17:28,199 INFO L87 Difference]: Start difference. First operand 344 states and 485 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:17:28,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:28,669 INFO L93 Difference]: Finished difference Result 842 states and 1196 transitions. [2025-02-06 03:17:28,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 03:17:28,670 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-02-06 03:17:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:28,673 INFO L225 Difference]: With dead ends: 842 [2025-02-06 03:17:28,675 INFO L226 Difference]: Without dead ends: 654 [2025-02-06 03:17:28,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:17:28,676 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 223 mSDsluCounter, 2497 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 2845 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:28,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 2845 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:17:28,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-02-06 03:17:28,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 531. [2025-02-06 03:17:28,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 482 states have (on average 1.383817427385892) internal successors, (667), 485 states have internal predecessors, (667), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 03:17:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 751 transitions. [2025-02-06 03:17:28,711 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 751 transitions. Word has length 109 [2025-02-06 03:17:28,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:28,711 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 751 transitions. [2025-02-06 03:17:28,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:17:28,712 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 751 transitions. [2025-02-06 03:17:28,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:17:28,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:28,713 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:17:28,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:17:28,713 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:28,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:28,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1470820256, now seen corresponding path program 1 times [2025-02-06 03:17:28,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:28,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528592244] [2025-02-06 03:17:28,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:28,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:28,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:17:28,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:17:28,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:28,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:28,954 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:17:28,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:28,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528592244] [2025-02-06 03:17:28,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528592244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:28,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:28,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:17:28,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583257864] [2025-02-06 03:17:28,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:28,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:17:28,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:28,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:17:28,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:17:28,955 INFO L87 Difference]: Start difference. First operand 531 states and 751 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:17:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:29,069 INFO L93 Difference]: Finished difference Result 1026 states and 1451 transitions. [2025-02-06 03:17:29,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:17:29,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-02-06 03:17:29,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:29,072 INFO L225 Difference]: With dead ends: 1026 [2025-02-06 03:17:29,072 INFO L226 Difference]: Without dead ends: 651 [2025-02-06 03:17:29,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:17:29,073 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 238 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:29,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 916 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:17:29,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-02-06 03:17:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 648. [2025-02-06 03:17:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 585 states have (on average 1.3743589743589744) internal successors, (804), 590 states have internal predecessors, (804), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-06 03:17:29,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 912 transitions. [2025-02-06 03:17:29,107 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 912 transitions. Word has length 109 [2025-02-06 03:17:29,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:29,107 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 912 transitions. [2025-02-06 03:17:29,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:17:29,107 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 912 transitions. [2025-02-06 03:17:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:17:29,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:29,110 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:17:29,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:17:29,111 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:29,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:29,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1909372128, now seen corresponding path program 1 times [2025-02-06 03:17:29,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:29,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69851576] [2025-02-06 03:17:29,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:29,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:29,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:17:29,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:17:29,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:29,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:29,330 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:17:29,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:29,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69851576] [2025-02-06 03:17:29,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69851576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:29,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:29,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:17:29,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690076036] [2025-02-06 03:17:29,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:29,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:17:29,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:29,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:17:29,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:17:29,332 INFO L87 Difference]: Start difference. First operand 648 states and 912 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:17:29,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:29,474 INFO L93 Difference]: Finished difference Result 1306 states and 1835 transitions. [2025-02-06 03:17:29,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:17:29,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-02-06 03:17:29,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:29,478 INFO L225 Difference]: With dead ends: 1306 [2025-02-06 03:17:29,478 INFO L226 Difference]: Without dead ends: 814 [2025-02-06 03:17:29,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:17:29,480 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 133 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:29,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 923 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:17:29,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2025-02-06 03:17:29,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 810. [2025-02-06 03:17:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 721 states have (on average 1.361997226074896) internal successors, (982), 729 states have internal predecessors, (982), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2025-02-06 03:17:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1134 transitions. [2025-02-06 03:17:29,525 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1134 transitions. Word has length 109 [2025-02-06 03:17:29,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:29,526 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1134 transitions. [2025-02-06 03:17:29,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:17:29,526 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1134 transitions. [2025-02-06 03:17:29,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:17:29,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:29,527 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:17:29,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:17:29,528 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:29,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:29,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1403813503, now seen corresponding path program 1 times [2025-02-06 03:17:29,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:29,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371214735] [2025-02-06 03:17:29,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:29,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:29,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:17:29,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:17:29,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:29,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:29,810 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:17:29,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:29,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371214735] [2025-02-06 03:17:29,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371214735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:29,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:29,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:17:29,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285446286] [2025-02-06 03:17:29,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:29,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:17:29,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:29,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:17:29,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:17:29,811 INFO L87 Difference]: Start difference. First operand 810 states and 1134 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:30,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:30,018 INFO L93 Difference]: Finished difference Result 1434 states and 2008 transitions. [2025-02-06 03:17:30,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:17:30,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-02-06 03:17:30,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:30,023 INFO L225 Difference]: With dead ends: 1434 [2025-02-06 03:17:30,023 INFO L226 Difference]: Without dead ends: 819 [2025-02-06 03:17:30,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:17:30,025 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 141 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 2043 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:30,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 2043 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:17:30,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-02-06 03:17:30,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 528. [2025-02-06 03:17:30,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 469 states have (on average 1.3603411513859276) internal successors, (638), 474 states have internal predecessors, (638), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 03:17:30,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 738 transitions. [2025-02-06 03:17:30,054 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 738 transitions. Word has length 109 [2025-02-06 03:17:30,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:30,054 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 738 transitions. [2025-02-06 03:17:30,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:30,054 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 738 transitions. [2025-02-06 03:17:30,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:17:30,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:30,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] [2025-02-06 03:17:30,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:17:30,055 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:30,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:30,055 INFO L85 PathProgramCache]: Analyzing trace with hash 13882887, now seen corresponding path program 1 times [2025-02-06 03:17:30,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:30,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897216114] [2025-02-06 03:17:30,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:30,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:30,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:17:30,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:17:30,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:30,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:30,261 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:17:30,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:30,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897216114] [2025-02-06 03:17:30,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897216114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:30,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:30,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:17:30,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74995387] [2025-02-06 03:17:30,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:30,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:17:30,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:30,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:17:30,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:17:30,263 INFO L87 Difference]: Start difference. First operand 528 states and 738 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:30,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:30,320 INFO L93 Difference]: Finished difference Result 560 states and 772 transitions. [2025-02-06 03:17:30,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:17:30,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-02-06 03:17:30,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:30,323 INFO L225 Difference]: With dead ends: 560 [2025-02-06 03:17:30,323 INFO L226 Difference]: Without dead ends: 558 [2025-02-06 03:17:30,323 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:17:30,324 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 119 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:30,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 817 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:17:30,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-02-06 03:17:30,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2025-02-06 03:17:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 496 states have (on average 1.340725806451613) internal successors, (665), 501 states have internal predecessors, (665), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 03:17:30,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 765 transitions. [2025-02-06 03:17:30,348 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 765 transitions. Word has length 110 [2025-02-06 03:17:30,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:30,349 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 765 transitions. [2025-02-06 03:17:30,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:30,349 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 765 transitions. [2025-02-06 03:17:30,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:17:30,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:30,350 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:17:30,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:17:30,350 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:30,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:30,350 INFO L85 PathProgramCache]: Analyzing trace with hash 14806408, now seen corresponding path program 1 times [2025-02-06 03:17:30,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:30,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25561797] [2025-02-06 03:17:30,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:30,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:30,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:17:30,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:17:30,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:30,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:17:30,384 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:17:30,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:17:30,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:17:30,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:30,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:17:30,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:17:30,454 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:17:30,455 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:17:30,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:17:30,459 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:30,535 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:17:30,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:17:30 BoogieIcfgContainer [2025-02-06 03:17:30,537 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:17:30,537 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:17:30,537 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:17:30,538 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:17:30,538 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:17:23" (3/4) ... [2025-02-06 03:17:30,541 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:17:30,541 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:17:30,542 INFO L158 Benchmark]: Toolchain (without parser) took 8331.99ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 104.9MB in the beginning and 244.2MB in the end (delta: -139.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-06 03:17:30,542 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:17:30,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.71ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 90.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:17:30,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.75ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 87.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:17:30,543 INFO L158 Benchmark]: Boogie Preprocessor took 71.95ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 82.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:17:30,543 INFO L158 Benchmark]: IcfgBuilder took 561.71ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 51.3MB in the end (delta: 31.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 03:17:30,543 INFO L158 Benchmark]: TraceAbstraction took 7405.01ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 50.3MB in the beginning and 244.6MB in the end (delta: -194.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:17:30,544 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 352.3MB. Free memory was 244.6MB in the beginning and 244.2MB in the end (delta: 389.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:17:30,545 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.27ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.71ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 90.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.75ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 87.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.95ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 82.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 561.71ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 51.3MB in the end (delta: 31.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7405.01ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 50.3MB in the beginning and 244.6MB in the end (delta: -194.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 352.3MB. Free memory was 244.6MB in the beginning and 244.2MB in the end (delta: 389.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L25-L27] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L25-L27] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L25-L27] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L25-L27] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L28-L30] float float_Array_0[1] = { 9.8 }; [L28-L30] float float_Array_0[1] = { 9.8 }; [L31-L33] signed char signed_char_Array_0[2] = { 2, 25 }; [L31-L33] signed char signed_char_Array_0[2] = { 2, 25 }; [L31-L33] signed char signed_char_Array_0[2] = { 2, 25 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 10, 16 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 10, 16 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 10, 16 }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L72] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] double_Array_0[0] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] double_Array_0[1] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[1] [L84] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L84] EXPR double_Array_0[1] [L84] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] RET updateVariables() [L104] CALL step() [L40] EXPR double_Array_0[0] [L40] float_Array_0[0] = double_Array_0[0] [L41] EXPR signed_char_Array_0[0] [L41] signed_char_Array_0[1] = signed_char_Array_0[0] [L42] signed long int stepLocal_0 = -4; [L43] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L43] COND FALSE !(stepLocal_0 >= signed_char_Array_0[1]) [L46] EXPR unsigned_char_Array_0[0] [L46] unsigned char stepLocal_2 = unsigned_char_Array_0[0]; [L47] BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L47] COND FALSE !(BOOL_unsigned_char_Array_0[0][0]) [L56] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L56] EXPR ((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1]) [L56] EXPR unsigned_char_Array_0[1] [L56] EXPR ((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, stepLocal_2=9, unsigned_char_Array_0={8:0}] [L56] signed long int stepLocal_1 = (((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])); [L57] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L57] COND FALSE !((8 * unsigned_char_Array_0[1]) == stepLocal_1) [L68] EXPR BOOL_unsigned_char_Array_0[1][0] [L68] BOOL_unsigned_char_Array_0[1][1] = BOOL_unsigned_char_Array_0[1][0] [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 [L95] EXPR (-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) [L95] EXPR unsigned_char_Array_0[1] [L95] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1]) [L95] EXPR unsigned_char_Array_0[1] [L95] EXPR ((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) [L95] EXPR BOOL_unsigned_char_Array_0[1][1] [L95] EXPR BOOL_unsigned_char_Array_0[1][0] [L95] EXPR ((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1) [L95] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1 [L95] EXPR BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0])) [L95] EXPR float_Array_0[0] [L95] EXPR double_Array_0[0] [L95] EXPR ((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95-L96] return (((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 14, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1274 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1269 mSDsluCounter, 11452 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8952 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1467 IncrementalHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 2500 mSDtfsCounter, 1467 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=810occurred in iteration=11, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 516 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1927 NumberOfCodeBlocks, 1927 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1800 ConstructedInterpolants, 0 QuantifiedInterpolants, 3610 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1475 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 4367/4488 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 03:17:30,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f657570a1e1457f1f304b0d552f8742bb723e9b2810b7fa1033cb000332d16c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:17:32,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:17:32,430 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:17:32,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:17:32,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:17:32,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:17:32,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:17:32,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:17:32,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:17:32,449 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:17:32,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:17:32,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:17:32,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:17:32,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:17:32,449 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:17:32,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:17:32,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:17:32,449 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:17:32,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:17:32,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:17:32,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:17:32,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:17:32,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:17:32,450 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:17:32,450 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:17:32,450 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:17:32,450 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:17:32,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:17:32,450 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:17:32,450 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:17:32,450 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:17:32,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:17:32,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:17:32,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:17:32,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:17:32,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:17:32,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:17:32,450 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:17:32,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:17:32,451 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:17:32,451 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:17:32,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:17:32,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:17:32,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:17:32,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:17:32,451 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f657570a1e1457f1f304b0d552f8742bb723e9b2810b7fa1033cb000332d16c [2025-02-06 03:17:32,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:17:32,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:17:32,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:17:32,678 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:17:32,679 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:17:32,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i [2025-02-06 03:17:33,827 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e9b3f0c7/c156da21f80e4f8cbc41be8a82758803/FLAG9b5644a57 [2025-02-06 03:17:34,028 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:17:34,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i [2025-02-06 03:17:34,034 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e9b3f0c7/c156da21f80e4f8cbc41be8a82758803/FLAG9b5644a57 [2025-02-06 03:17:34,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e9b3f0c7/c156da21f80e4f8cbc41be8a82758803 [2025-02-06 03:17:34,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:17:34,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:17:34,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:17:34,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:17:34,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:17:34,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:17:34" (1/1) ... [2025-02-06 03:17:34,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c8568b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:34, skipping insertion in model container [2025-02-06 03:17:34,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:17:34" (1/1) ... [2025-02-06 03:17:34,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:17:34,148 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i[916,929] [2025-02-06 03:17:34,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:17:34,200 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:17:34,208 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i[916,929] [2025-02-06 03:17:34,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:17:34,261 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:17:34,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:34 WrapperNode [2025-02-06 03:17:34,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:17:34,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:17:34,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:17:34,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:17:34,266 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:17:34" (1/1) ... [2025-02-06 03:17:34,276 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:17:34" (1/1) ... [2025-02-06 03:17:34,303 INFO L138 Inliner]: procedures = 33, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 466 [2025-02-06 03:17:34,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:17:34,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:17:34,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:17:34,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:17:34,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:34" (1/1) ... [2025-02-06 03:17:34,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:34" (1/1) ... [2025-02-06 03:17:34,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:34" (1/1) ... [2025-02-06 03:17:34,337 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 33, 41, 7, 13, 19]. 36 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 3, 1, 2, 2]. The 16 writes are split as follows [0, 7, 4, 1, 2, 2]. [2025-02-06 03:17:34,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:34" (1/1) ... [2025-02-06 03:17:34,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:34" (1/1) ... [2025-02-06 03:17:34,352 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:34" (1/1) ... [2025-02-06 03:17:34,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:34" (1/1) ... [2025-02-06 03:17:34,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:34" (1/1) ... [2025-02-06 03:17:34,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:34" (1/1) ... [2025-02-06 03:17:34,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:17:34,362 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:17:34,362 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:17:34,362 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:17:34,363 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:34" (1/1) ... [2025-02-06 03:17:34,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:17:34,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:17:34,392 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:17:34,397 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:17:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:17:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:17:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:17:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-02-06 03:17:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-02-06 03:17:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-02-06 03:17:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-02-06 03:17:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:17:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:17:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-02-06 03:17:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-02-06 03:17:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-02-06 03:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-02-06 03:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-02-06 03:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-02-06 03:17:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:17:34,416 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:17:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:17:34,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:17:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:17:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:17:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:17:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:17:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:17:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:17:34,546 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:17:34,548 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:17:35,384 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc property_#t~mem71#1;havoc property_#t~ite76#1;havoc property_#t~mem75#1;havoc property_#t~mem72#1;havoc property_#t~ite74#1;havoc property_#t~mem73#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~ite99#1;havoc property_#t~mem81#1;havoc property_#t~ite96#1;havoc property_#t~mem86#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~short85#1;havoc property_#t~mem91#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite95#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem94#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~short100#1;havoc property_#t~mem101#1;havoc property_#t~ite119#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite118#1;havoc property_#t~mem113#1;havoc property_#t~mem104#1;havoc property_#t~ite106#1;havoc property_#t~mem105#1;havoc property_#t~mem107#1;havoc property_#t~ite112#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~short120#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-02-06 03:17:35,418 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2025-02-06 03:17:35,418 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:17:35,426 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:17:35,427 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:17:35,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:17:35 BoogieIcfgContainer [2025-02-06 03:17:35,427 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:17:35,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:17:35,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:17:35,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:17:35,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:17:34" (1/3) ... [2025-02-06 03:17:35,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14271875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:17:35, skipping insertion in model container [2025-02-06 03:17:35,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:17:34" (2/3) ... [2025-02-06 03:17:35,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14271875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:17:35, skipping insertion in model container [2025-02-06 03:17:35,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:17:35" (3/3) ... [2025-02-06 03:17:35,433 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-54.i [2025-02-06 03:17:35,442 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:17:35,443 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-54.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:17:35,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:17:35,484 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;@34ab6ad9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:17:35,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:17:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:17:35,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 03:17:35,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:35,499 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:35,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:35,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:35,504 INFO L85 PathProgramCache]: Analyzing trace with hash 36873229, now seen corresponding path program 1 times [2025-02-06 03:17:35,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:17:35,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930624948] [2025-02-06 03:17:35,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:35,511 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:17:35,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:17:35,514 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:17:35,515 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:17:35,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:17:35,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:17:35,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:35,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:35,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:17:35,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:35,821 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:17:35,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:17:35,821 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:17:35,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930624948] [2025-02-06 03:17:35,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930624948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:35,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:35,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:17:35,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776930438] [2025-02-06 03:17:35,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:35,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:17:35,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:17:35,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:17:35,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:17:35,844 INFO L87 Difference]: Start difference. First operand has 109 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:17:35,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:35,867 INFO L93 Difference]: Finished difference Result 212 states and 327 transitions. [2025-02-06 03:17:35,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:17:35,868 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-02-06 03:17:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:35,875 INFO L225 Difference]: With dead ends: 212 [2025-02-06 03:17:35,875 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 03:17:35,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:17:35,880 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:35,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:17:35,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 03:17:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-02-06 03:17:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:17:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2025-02-06 03:17:35,914 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 105 [2025-02-06 03:17:35,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:35,915 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2025-02-06 03:17:35,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:17:35,915 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2025-02-06 03:17:35,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 03:17:35,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:35,917 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:17:35,929 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:17:36,118 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:17:36,118 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:36,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:36,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1403267427, now seen corresponding path program 1 times [2025-02-06 03:17:36,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:17:36,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732777196] [2025-02-06 03:17:36,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:36,119 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:17:36,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:17:36,122 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:17:36,123 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:17:36,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:17:36,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:17:36,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:36,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:36,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:17:36,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:36,429 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:17:36,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:17:36,433 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:17:36,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732777196] [2025-02-06 03:17:36,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732777196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:36,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:36,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:17:36,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934731998] [2025-02-06 03:17:36,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:36,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:17:36,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:17:36,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:17:36,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:17:36,435 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:36,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:36,477 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2025-02-06 03:17:36,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:17:36,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-02-06 03:17:36,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:36,481 INFO L225 Difference]: With dead ends: 211 [2025-02-06 03:17:36,481 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 03:17:36,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:17:36,482 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:36,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:17:36,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 03:17:36,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-06 03:17:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:17:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2025-02-06 03:17:36,490 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 105 [2025-02-06 03:17:36,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:36,491 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2025-02-06 03:17:36,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2025-02-06 03:17:36,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 03:17:36,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:36,493 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:17:36,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 03:17:36,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:17:36,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:36,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:36,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2065342111, now seen corresponding path program 1 times [2025-02-06 03:17:36,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:17:36,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318933423] [2025-02-06 03:17:36,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:36,694 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:17:36,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:17:36,697 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:17:36,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 03:17:36,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 03:17:36,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 03:17:36,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:36,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:36,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:17:36,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:36,962 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:17:36,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:17:36,962 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:17:36,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318933423] [2025-02-06 03:17:36,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318933423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:36,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:36,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:17:36,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004358938] [2025-02-06 03:17:36,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:36,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:17:36,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:17:36,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:17:36,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:17:36,964 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:37,057 INFO L93 Difference]: Finished difference Result 218 states and 318 transitions. [2025-02-06 03:17:37,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:17:37,058 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:17:37,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:37,059 INFO L225 Difference]: With dead ends: 218 [2025-02-06 03:17:37,059 INFO L226 Difference]: Without dead ends: 113 [2025-02-06 03:17:37,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:17:37,060 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:37,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 584 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:17:37,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-06 03:17:37,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-02-06 03:17:37,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:17:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2025-02-06 03:17:37,066 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 107 [2025-02-06 03:17:37,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:37,067 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2025-02-06 03:17:37,067 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:17:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2025-02-06 03:17:37,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 03:17:37,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:37,068 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:17:37,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 03:17:37,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:17:37,269 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:37,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:37,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1177838430, now seen corresponding path program 1 times [2025-02-06 03:17:37,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:17:37,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133924630] [2025-02-06 03:17:37,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:37,271 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:17:37,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:17:37,273 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:17:37,274 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:17:37,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 03:17:37,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 03:17:37,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:37,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:37,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:17:37,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:37,548 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:17:37,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:17:37,550 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:17:37,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133924630] [2025-02-06 03:17:37,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133924630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:37,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:37,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:17:37,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227266044] [2025-02-06 03:17:37,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:37,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:17:37,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:17:37,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:17:37,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:17:37,552 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:37,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:37,634 INFO L93 Difference]: Finished difference Result 224 states and 323 transitions. [2025-02-06 03:17:37,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:17:37,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-02-06 03:17:37,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:37,637 INFO L225 Difference]: With dead ends: 224 [2025-02-06 03:17:37,637 INFO L226 Difference]: Without dead ends: 115 [2025-02-06 03:17:37,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:17:37,638 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:37,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 724 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:17:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-06 03:17:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-02-06 03:17:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:17:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2025-02-06 03:17:37,647 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 107 [2025-02-06 03:17:37,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:37,648 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2025-02-06 03:17:37,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2025-02-06 03:17:37,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 03:17:37,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:37,649 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:17:37,657 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:17:37,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:17:37,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:37,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:37,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1176914909, now seen corresponding path program 1 times [2025-02-06 03:17:37,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:17:37,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257593853] [2025-02-06 03:17:37,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:37,851 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:17:37,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:17:37,853 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:17:37,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 03:17:37,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 03:17:38,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 03:17:38,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:38,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:38,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:17:38,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:38,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 03:17:38,208 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:17:38,209 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:17:38,209 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:17:38,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257593853] [2025-02-06 03:17:38,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257593853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:38,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:38,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:17:38,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784525704] [2025-02-06 03:17:38,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:38,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:17:38,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:17:38,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:17:38,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:17:38,210 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:38,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:38,607 INFO L93 Difference]: Finished difference Result 327 states and 470 transitions. [2025-02-06 03:17:38,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:17:38,607 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:17:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:38,609 INFO L225 Difference]: With dead ends: 327 [2025-02-06 03:17:38,609 INFO L226 Difference]: Without dead ends: 216 [2025-02-06 03:17:38,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:17:38,610 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 136 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:38,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 550 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:17:38,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-06 03:17:38,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 135. [2025-02-06 03:17:38,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 121 states have (on average 1.421487603305785) internal successors, (172), 121 states have internal predecessors, (172), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:17:38,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 196 transitions. [2025-02-06 03:17:38,618 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 196 transitions. Word has length 107 [2025-02-06 03:17:38,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:38,618 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 196 transitions. [2025-02-06 03:17:38,618 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:17:38,618 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 196 transitions. [2025-02-06 03:17:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:17:38,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:38,619 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:17:38,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-02-06 03:17:38,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:17:38,820 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:38,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:38,820 INFO L85 PathProgramCache]: Analyzing trace with hash 584232187, now seen corresponding path program 1 times [2025-02-06 03:17:38,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:17:38,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072047611] [2025-02-06 03:17:38,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:38,821 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:17:38,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:17:38,823 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:17:38,824 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:17:38,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:17:39,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:17:39,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:39,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:39,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:17:39,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:39,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-02-06 03:17:39,387 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:17:39,396 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:17:39,396 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:17:39,396 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:17:39,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072047611] [2025-02-06 03:17:39,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072047611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:39,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:39,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:17:39,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145261194] [2025-02-06 03:17:39,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:39,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:17:39,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:17:39,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:17:39,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:17:39,398 INFO L87 Difference]: Start difference. First operand 135 states and 196 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:39,497 INFO L93 Difference]: Finished difference Result 372 states and 540 transitions. [2025-02-06 03:17:39,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:17:39,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-02-06 03:17:39,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:39,499 INFO L225 Difference]: With dead ends: 372 [2025-02-06 03:17:39,499 INFO L226 Difference]: Without dead ends: 240 [2025-02-06 03:17:39,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:17:39,500 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 94 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:39,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 421 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:17:39,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-02-06 03:17:39,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 236. [2025-02-06 03:17:39,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 209 states have (on average 1.4066985645933014) internal successors, (294), 209 states have internal predecessors, (294), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:17:39,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 342 transitions. [2025-02-06 03:17:39,515 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 342 transitions. Word has length 108 [2025-02-06 03:17:39,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:39,516 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 342 transitions. [2025-02-06 03:17:39,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:39,516 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 342 transitions. [2025-02-06 03:17:39,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:17:39,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:39,517 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:17:39,526 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:17:39,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:17:39,718 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:39,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:39,718 INFO L85 PathProgramCache]: Analyzing trace with hash 175407962, now seen corresponding path program 1 times [2025-02-06 03:17:39,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:17:39,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774508512] [2025-02-06 03:17:39,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:39,718 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:17:39,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:17:39,720 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:17:39,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-02-06 03:17:39,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:17:39,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:17:39,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:39,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:39,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:17:39,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:39,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 03:17:39,988 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:17:39,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:17:39,989 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:17:39,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774508512] [2025-02-06 03:17:39,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [774508512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:39,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:39,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:17:39,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437712699] [2025-02-06 03:17:39,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:39,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:17:39,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:17:39,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:17:39,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:17:39,990 INFO L87 Difference]: Start difference. First operand 236 states and 342 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:40,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:40,484 INFO L93 Difference]: Finished difference Result 589 states and 855 transitions. [2025-02-06 03:17:40,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:17:40,485 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:17:40,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:40,486 INFO L225 Difference]: With dead ends: 589 [2025-02-06 03:17:40,486 INFO L226 Difference]: Without dead ends: 356 [2025-02-06 03:17:40,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:17:40,487 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 144 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:40,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 539 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:17:40,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-02-06 03:17:40,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 251. [2025-02-06 03:17:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 224 states have (on average 1.4107142857142858) internal successors, (316), 224 states have internal predecessors, (316), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:17:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 364 transitions. [2025-02-06 03:17:40,507 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 364 transitions. Word has length 108 [2025-02-06 03:17:40,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:40,507 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 364 transitions. [2025-02-06 03:17:40,507 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:17:40,507 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 364 transitions. [2025-02-06 03:17:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:17:40,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:40,508 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:17:40,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-02-06 03:17:40,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:17:40,709 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:40,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:40,709 INFO L85 PathProgramCache]: Analyzing trace with hash -117995045, now seen corresponding path program 1 times [2025-02-06 03:17:40,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:17:40,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081810321] [2025-02-06 03:17:40,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:40,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:17:40,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:17:40,712 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:17:40,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-06 03:17:40,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:17:40,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:17:40,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:40,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:40,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 03:17:40,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:41,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:17:41,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2025-02-06 03:17:41,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2025-02-06 03:17:41,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:17:41,554 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 88 treesize of output 40 [2025-02-06 03:17:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 48 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-02-06 03:17:41,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:17:41,758 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:17:41,758 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:17:41,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081810321] [2025-02-06 03:17:41,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081810321] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:17:41,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:17:41,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 16 [2025-02-06 03:17:41,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686407528] [2025-02-06 03:17:41,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:41,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:17:41,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:17:41,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:17:41,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:17:41,760 INFO L87 Difference]: Start difference. First operand 251 states and 364 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:42,412 INFO L93 Difference]: Finished difference Result 623 states and 889 transitions. [2025-02-06 03:17:42,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:17:42,412 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:17:42,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:42,414 INFO L225 Difference]: With dead ends: 623 [2025-02-06 03:17:42,414 INFO L226 Difference]: Without dead ends: 375 [2025-02-06 03:17:42,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:17:42,415 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 67 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:42,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 682 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:17:42,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-02-06 03:17:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 371. [2025-02-06 03:17:42,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 338 states have (on average 1.3816568047337279) internal successors, (467), 340 states have internal predecessors, (467), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:17:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 523 transitions. [2025-02-06 03:17:42,435 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 523 transitions. Word has length 108 [2025-02-06 03:17:42,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:42,437 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 523 transitions. [2025-02-06 03:17:42,437 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:17:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 523 transitions. [2025-02-06 03:17:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:17:42,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:42,438 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:17:42,448 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 (9)] Forceful destruction successful, exit code 0 [2025-02-06 03:17:42,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:17:42,639 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:42,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:42,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1976378881, now seen corresponding path program 1 times [2025-02-06 03:17:42,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:17:42,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271687480] [2025-02-06 03:17:42,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:42,640 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:17:42,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:17:42,642 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:17:42,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-02-06 03:17:42,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:17:42,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:17:42,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:42,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:42,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 03:17:42,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:42,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2025-02-06 03:17:42,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:17:42,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 22 [2025-02-06 03:17:43,047 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:17:43,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:17:43,047 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:17:43,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271687480] [2025-02-06 03:17:43,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271687480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:43,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:43,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:17:43,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093297978] [2025-02-06 03:17:43,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:43,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:17:43,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:17:43,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:17:43,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:17:43,049 INFO L87 Difference]: Start difference. First operand 371 states and 523 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:43,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:43,549 INFO L93 Difference]: Finished difference Result 1040 states and 1466 transitions. [2025-02-06 03:17:43,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:17:43,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-02-06 03:17:43,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:43,554 INFO L225 Difference]: With dead ends: 1040 [2025-02-06 03:17:43,554 INFO L226 Difference]: Without dead ends: 672 [2025-02-06 03:17:43,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:17:43,555 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 129 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:43,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1775 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:17:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-02-06 03:17:43,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 660. [2025-02-06 03:17:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 599 states have (on average 1.3739565943238732) internal successors, (823), 605 states have internal predecessors, (823), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 46 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:17:43,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 927 transitions. [2025-02-06 03:17:43,580 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 927 transitions. Word has length 109 [2025-02-06 03:17:43,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:43,581 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 927 transitions. [2025-02-06 03:17:43,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:43,581 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 927 transitions. [2025-02-06 03:17:43,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:17:43,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:43,582 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:17:43,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-02-06 03:17:43,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:17:43,783 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:43,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:43,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1909372128, now seen corresponding path program 1 times [2025-02-06 03:17:43,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:17:43,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755624575] [2025-02-06 03:17:43,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:43,784 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:17:43,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:17:43,786 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:17:43,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-02-06 03:17:43,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:17:44,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:17:44,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:44,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:44,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:17:44,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:44,074 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:17:44,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-02-06 03:17:44,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:17:44,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 16 [2025-02-06 03:17:44,267 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:17:44,267 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:17:44,267 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:17:44,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755624575] [2025-02-06 03:17:44,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755624575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:44,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:44,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:17:44,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894907606] [2025-02-06 03:17:44,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:44,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:17:44,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:17:44,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:17:44,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:17:44,268 INFO L87 Difference]: Start difference. First operand 660 states and 927 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:44,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:44,701 INFO L93 Difference]: Finished difference Result 1567 states and 2194 transitions. [2025-02-06 03:17:44,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:17:44,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-02-06 03:17:44,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:44,705 INFO L225 Difference]: With dead ends: 1567 [2025-02-06 03:17:44,705 INFO L226 Difference]: Without dead ends: 910 [2025-02-06 03:17:44,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:17:44,706 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 246 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:44,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 747 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:17:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-02-06 03:17:44,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 660. [2025-02-06 03:17:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 599 states have (on average 1.3672787979966612) internal successors, (819), 605 states have internal predecessors, (819), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 46 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:17:44,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 923 transitions. [2025-02-06 03:17:44,739 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 923 transitions. Word has length 109 [2025-02-06 03:17:44,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:44,739 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 923 transitions. [2025-02-06 03:17:44,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:44,739 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 923 transitions. [2025-02-06 03:17:44,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:17:44,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:44,740 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:17:44,748 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:17:44,941 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:17:44,941 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:44,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:44,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1403813503, now seen corresponding path program 1 times [2025-02-06 03:17:44,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:17:44,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946541846] [2025-02-06 03:17:44,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:44,942 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:17:44,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:17:44,945 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:17:44,947 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:17:45,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:17:45,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:17:45,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:45,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:45,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:17:45,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:45,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 03:17:45,192 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:17:45,232 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:17:45,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:17:45,232 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:17:45,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946541846] [2025-02-06 03:17:45,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946541846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:45,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:45,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:17:45,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122051248] [2025-02-06 03:17:45,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:45,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:17:45,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:17:45,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:17:45,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:17:45,233 INFO L87 Difference]: Start difference. First operand 660 states and 923 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:45,532 INFO L93 Difference]: Finished difference Result 1874 states and 2617 transitions. [2025-02-06 03:17:45,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:17:45,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-02-06 03:17:45,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:45,537 INFO L225 Difference]: With dead ends: 1874 [2025-02-06 03:17:45,537 INFO L226 Difference]: Without dead ends: 1217 [2025-02-06 03:17:45,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:17:45,539 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 141 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:45,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1807 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:17:45,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-02-06 03:17:45,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 640. [2025-02-06 03:17:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 579 states have (on average 1.3730569948186528) internal successors, (795), 585 states have internal predecessors, (795), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 46 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:17:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 899 transitions. [2025-02-06 03:17:45,568 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 899 transitions. Word has length 109 [2025-02-06 03:17:45,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:45,569 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 899 transitions. [2025-02-06 03:17:45,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:45,569 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 899 transitions. [2025-02-06 03:17:45,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:17:45,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:45,570 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:17:45,578 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:17:45,770 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:17:45,771 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:45,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:45,771 INFO L85 PathProgramCache]: Analyzing trace with hash 13882887, now seen corresponding path program 1 times [2025-02-06 03:17:45,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:17:45,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123310458] [2025-02-06 03:17:45,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:45,772 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:17:45,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:17:45,773 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:17:45,774 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:17:45,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:17:46,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:17:46,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:46,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:46,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 03:17:46,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:46,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:17:46,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2025-02-06 03:17:46,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:17:46,157 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 57 treesize of output 27 [2025-02-06 03:17:46,179 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:17:46,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:17:46,180 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:17:46,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123310458] [2025-02-06 03:17:46,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123310458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:46,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:46,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:17:46,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598167900] [2025-02-06 03:17:46,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:46,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:17:46,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:17:46,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:17:46,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:17:46,181 INFO L87 Difference]: Start difference. First operand 640 states and 899 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:46,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:46,280 INFO L93 Difference]: Finished difference Result 714 states and 989 transitions. [2025-02-06 03:17:46,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:17:46,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-02-06 03:17:46,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:46,285 INFO L225 Difference]: With dead ends: 714 [2025-02-06 03:17:46,286 INFO L226 Difference]: Without dead ends: 712 [2025-02-06 03:17:46,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 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:17:46,286 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 119 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:46,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 817 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:17:46,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-02-06 03:17:46,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 711. [2025-02-06 03:17:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 637 states have (on average 1.34850863422292) internal successors, (859), 644 states have internal predecessors, (859), 60 states have call successors, (60), 13 states have call predecessors, (60), 13 states have return successors, (60), 53 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:17:46,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 979 transitions. [2025-02-06 03:17:46,314 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 979 transitions. Word has length 110 [2025-02-06 03:17:46,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:46,315 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 979 transitions. [2025-02-06 03:17:46,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:17:46,315 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 979 transitions. [2025-02-06 03:17:46,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:17:46,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:46,316 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:17:46,325 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:17:46,516 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:17:46,517 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:46,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:46,517 INFO L85 PathProgramCache]: Analyzing trace with hash 14806408, now seen corresponding path program 1 times [2025-02-06 03:17:46,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:17:46,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822309711] [2025-02-06 03:17:46,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:46,517 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:17:46,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:17:46,520 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:17:46,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-02-06 03:17:46,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:17:47,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:17:47,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:47,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:47,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 03:17:47,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:47,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:17:47,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:17:47,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 77 [2025-02-06 03:17:51,738 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:18:03,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 167 [2025-02-06 03:18:03,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:18:03,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 287 treesize of output 125 [2025-02-06 03:18:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-06 03:18:04,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:18:04,100 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:18:04,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822309711] [2025-02-06 03:18:04,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822309711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:04,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:18:04,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:18:04,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100550574] [2025-02-06 03:18:04,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:04,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:18:04,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:18:04,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:18:04,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2025-02-06 03:18:04,101 INFO L87 Difference]: Start difference. First operand 711 states and 979 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 03:18:07,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:18:12,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:18:15,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:18:17,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:18:19,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:18:22,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:18:27,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:18:32,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:18:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:44,704 INFO L93 Difference]: Finished difference Result 2619 states and 3578 transitions. [2025-02-06 03:18:44,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:18:44,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2025-02-06 03:18:44,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:44,720 INFO L225 Difference]: With dead ends: 2619 [2025-02-06 03:18:44,720 INFO L226 Difference]: Without dead ends: 1942 [2025-02-06 03:18:44,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=47, Invalid=133, Unknown=2, NotChecked=0, Total=182 [2025-02-06 03:18:44,722 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 564 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 41 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:44,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 845 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 534 Invalid, 8 Unknown, 0 Unchecked, 35.6s Time] [2025-02-06 03:18:44,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2025-02-06 03:18:44,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1930. [2025-02-06 03:18:44,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1745 states have (on average 1.3386819484240688) internal successors, (2336), 1771 states have internal predecessors, (2336), 146 states have call successors, (146), 38 states have call predecessors, (146), 38 states have return successors, (146), 120 states have call predecessors, (146), 146 states have call successors, (146) [2025-02-06 03:18:44,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2628 transitions. [2025-02-06 03:18:44,798 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2628 transitions. Word has length 110 [2025-02-06 03:18:44,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:44,798 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 2628 transitions. [2025-02-06 03:18:44,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 03:18:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2628 transitions. [2025-02-06 03:18:44,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:18:44,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:44,801 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:18:44,810 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:18:45,003 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:18:45,003 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:45,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:45,004 INFO L85 PathProgramCache]: Analyzing trace with hash 902310089, now seen corresponding path program 1 times [2025-02-06 03:18:45,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:18:45,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417601472] [2025-02-06 03:18:45,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:45,004 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:18:45,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:18:45,007 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:18:45,007 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:18:45,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:18:45,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:18:45,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:45,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:45,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:18:45,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:18:45,225 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:18:45,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:18:45,226 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:18:45,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417601472] [2025-02-06 03:18:45,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417601472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:45,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:18:45,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:18:45,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341091622] [2025-02-06 03:18:45,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:45,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:18:45,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:18:45,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:18:45,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:18:45,228 INFO L87 Difference]: Start difference. First operand 1930 states and 2628 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:18:45,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:45,398 INFO L93 Difference]: Finished difference Result 3884 states and 5286 transitions. [2025-02-06 03:18:45,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:18:45,399 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:18:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:45,406 INFO L225 Difference]: With dead ends: 3884 [2025-02-06 03:18:45,407 INFO L226 Difference]: Without dead ends: 2002 [2025-02-06 03:18:45,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:18:45,410 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:45,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 588 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:18:45,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2025-02-06 03:18:45,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 2002. [2025-02-06 03:18:45,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2002 states, 1817 states have (on average 1.32526141992295) internal successors, (2408), 1843 states have internal predecessors, (2408), 146 states have call successors, (146), 38 states have call predecessors, (146), 38 states have return successors, (146), 120 states have call predecessors, (146), 146 states have call successors, (146) [2025-02-06 03:18:45,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2700 transitions. [2025-02-06 03:18:45,487 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 2700 transitions. Word has length 110 [2025-02-06 03:18:45,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:45,487 INFO L471 AbstractCegarLoop]: Abstraction has 2002 states and 2700 transitions. [2025-02-06 03:18:45,488 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:18:45,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2700 transitions. [2025-02-06 03:18:45,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:18:45,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:45,489 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:18:45,497 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:18:45,690 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:18:45,690 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:45,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:45,691 INFO L85 PathProgramCache]: Analyzing trace with hash -231506679, now seen corresponding path program 1 times [2025-02-06 03:18:45,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:18:45,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274158002] [2025-02-06 03:18:45,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:45,691 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:18:45,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:18:45,693 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:18:45,695 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:18:45,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:18:45,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:18:45,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:45,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:45,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:18:45,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:18:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-02-06 03:18:45,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:18:45,929 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:18:45,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274158002] [2025-02-06 03:18:45,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274158002] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:45,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:18:45,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:18:45,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620455013] [2025-02-06 03:18:45,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:45,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:18:45,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:18:45,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:18:45,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:18:45,930 INFO L87 Difference]: Start difference. First operand 2002 states and 2700 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:18:46,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:46,119 INFO L93 Difference]: Finished difference Result 3964 states and 5347 transitions. [2025-02-06 03:18:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:18:46,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2025-02-06 03:18:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:46,133 INFO L225 Difference]: With dead ends: 3964 [2025-02-06 03:18:46,133 INFO L226 Difference]: Without dead ends: 2002 [2025-02-06 03:18:46,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:18:46,138 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:46,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:18:46,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2025-02-06 03:18:46,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 2002. [2025-02-06 03:18:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2002 states, 1817 states have (on average 1.3225096312603193) internal successors, (2403), 1843 states have internal predecessors, (2403), 146 states have call successors, (146), 38 states have call predecessors, (146), 38 states have return successors, (146), 120 states have call predecessors, (146), 146 states have call successors, (146) [2025-02-06 03:18:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2695 transitions. [2025-02-06 03:18:46,214 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 2695 transitions. Word has length 110 [2025-02-06 03:18:46,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:46,214 INFO L471 AbstractCegarLoop]: Abstraction has 2002 states and 2695 transitions. [2025-02-06 03:18:46,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:18:46,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2695 transitions. [2025-02-06 03:18:46,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 03:18:46,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:46,218 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:18:46,227 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:18:46,418 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:18:46,419 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:46,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:46,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2069999631, now seen corresponding path program 1 times [2025-02-06 03:18:46,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:18:46,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233317681] [2025-02-06 03:18:46,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:46,420 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:18:46,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:18:46,422 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:18:46,424 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:18:46,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:18:46,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:18:46,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:46,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:46,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 03:18:46,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:18:46,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2025-02-06 03:18:46,704 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:18:46,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:18:46,704 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:18:46,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233317681] [2025-02-06 03:18:46,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233317681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:46,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:18:46,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:18:46,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639935844] [2025-02-06 03:18:46,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:46,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:18:46,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:18:46,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:18:46,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:18:46,706 INFO L87 Difference]: Start difference. First operand 2002 states and 2695 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:18:46,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:46,859 INFO L93 Difference]: Finished difference Result 3590 states and 4817 transitions. [2025-02-06 03:18:46,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:18:46,860 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:18:46,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:46,864 INFO L225 Difference]: With dead ends: 3590 [2025-02-06 03:18:46,864 INFO L226 Difference]: Without dead ends: 1636 [2025-02-06 03:18:46,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:18:46,866 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:46,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 567 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:18:46,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2025-02-06 03:18:46,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1636. [2025-02-06 03:18:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1463 states have (on average 1.3055365686944633) internal successors, (1910), 1483 states have internal predecessors, (1910), 134 states have call successors, (134), 38 states have call predecessors, (134), 38 states have return successors, (134), 114 states have call predecessors, (134), 134 states have call successors, (134) [2025-02-06 03:18:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2178 transitions. [2025-02-06 03:18:46,919 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2178 transitions. Word has length 111 [2025-02-06 03:18:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:46,919 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2178 transitions. [2025-02-06 03:18:46,919 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:18:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2178 transitions. [2025-02-06 03:18:46,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 03:18:46,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:46,921 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:18:46,928 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:18:47,121 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:18:47,121 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:47,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:47,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1771732101, now seen corresponding path program 1 times [2025-02-06 03:18:47,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:18:47,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508034636] [2025-02-06 03:18:47,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:47,123 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:18:47,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:18:47,124 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:18:47,126 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:18:47,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:18:47,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:18:47,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:47,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:47,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:18:47,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:18:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-06 03:18:47,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:18:47,391 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:18:47,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508034636] [2025-02-06 03:18:47,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508034636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:47,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:18:47,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:18:47,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948800823] [2025-02-06 03:18:47,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:47,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:18:47,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:18:47,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:18:47,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:18:47,394 INFO L87 Difference]: Start difference. First operand 1636 states and 2178 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 03:18:47,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:47,709 INFO L93 Difference]: Finished difference Result 3301 states and 4377 transitions. [2025-02-06 03:18:47,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:18:47,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2025-02-06 03:18:47,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:47,724 INFO L225 Difference]: With dead ends: 3301 [2025-02-06 03:18:47,724 INFO L226 Difference]: Without dead ends: 1696 [2025-02-06 03:18:47,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:18:47,729 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:47,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 661 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:18:47,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2025-02-06 03:18:47,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1636. [2025-02-06 03:18:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1463 states have (on average 1.3021189336978811) internal successors, (1905), 1483 states have internal predecessors, (1905), 134 states have call successors, (134), 38 states have call predecessors, (134), 38 states have return successors, (134), 114 states have call predecessors, (134), 134 states have call successors, (134) [2025-02-06 03:18:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2173 transitions. [2025-02-06 03:18:47,805 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2173 transitions. Word has length 112 [2025-02-06 03:18:47,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:47,805 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2173 transitions. [2025-02-06 03:18:47,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 03:18:47,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2173 transitions. [2025-02-06 03:18:47,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 03:18:47,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:47,807 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:18:47,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2025-02-06 03:18:48,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:18:48,008 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:48,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:48,008 INFO L85 PathProgramCache]: Analyzing trace with hash -852721626, now seen corresponding path program 1 times [2025-02-06 03:18:48,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:18:48,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868557119] [2025-02-06 03:18:48,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:48,009 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:18:48,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:18:48,011 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:18:48,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2025-02-06 03:18:48,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:18:48,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:18:48,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:48,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:48,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 03:18:48,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:18:48,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 23 treesize of output 8 [2025-02-06 03:18:51,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:18:51,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 79 [2025-02-06 03:18:57,265 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