./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.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 1cca72686861ad5f32c03321c83cb01c79fc9fe11e27ec52efe74f8c4ef5e302 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:43:44,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:43:44,777 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:43:44,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:43:44,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:43:44,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:43:44,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:43:44,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:43:44,812 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:43:44,813 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:43:44,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:43:44,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:43:44,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:43:44,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:43:44,814 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:43:44,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:43:44,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:43:44,814 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:43:44,814 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:43:44,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:43:44,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:43:44,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:43:44,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:43:44,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:43:44,815 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:43:44,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:43:44,815 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:43:44,815 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:43:44,815 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:43:44,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:43:44,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:43:44,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:43:44,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:43:44,816 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:43:44,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:43:44,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:43:44,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:43:44,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:43:44,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:43:44,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:43:44,817 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:43:44,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:43:44,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:43:44,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:43:44,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:43:44,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:43:44,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:43:44,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:43:44,818 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 -> 1cca72686861ad5f32c03321c83cb01c79fc9fe11e27ec52efe74f8c4ef5e302 [2025-01-09 15:43:45,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:43:45,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:43:45,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:43:45,072 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:43:45,072 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:43:45,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i [2025-01-09 15:43:46,223 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ecb97253/c4ca8bf9e4cc43589a9fe8f6f38b1b21/FLAG2f70e7688 [2025-01-09 15:43:46,478 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:43:46,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i [2025-01-09 15:43:46,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ecb97253/c4ca8bf9e4cc43589a9fe8f6f38b1b21/FLAG2f70e7688 [2025-01-09 15:43:46,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ecb97253/c4ca8bf9e4cc43589a9fe8f6f38b1b21 [2025-01-09 15:43:46,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:43:46,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:43:46,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:43:46,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:43:46,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:43:46,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:43:46" (1/1) ... [2025-01-09 15:43:46,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5803ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:46, skipping insertion in model container [2025-01-09 15:43:46,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:43:46" (1/1) ... [2025-01-09 15:43:46,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:43:46,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i[916,929] [2025-01-09 15:43:46,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:43:46,702 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:43:46,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i[916,929] [2025-01-09 15:43:46,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:43:46,778 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:43:46,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:46 WrapperNode [2025-01-09 15:43:46,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:43:46,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:43:46,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:43:46,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:43:46,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:46" (1/1) ... [2025-01-09 15:43:46,794 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:46" (1/1) ... [2025-01-09 15:43:46,820 INFO L138 Inliner]: procedures = 29, calls = 118, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 417 [2025-01-09 15:43:46,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:43:46,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:43:46,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:43:46,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:43:46,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:46" (1/1) ... [2025-01-09 15:43:46,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:46" (1/1) ... [2025-01-09 15:43:46,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:46" (1/1) ... [2025-01-09 15:43:46,853 INFO L175 MemorySlicer]: Split 91 memory accesses to 10 slices as follows [2, 19, 6, 12, 12, 10, 8, 6, 8, 8]. 21 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 12 writes are split as follows [0, 2, 2, 1, 1, 1, 1, 2, 1, 1]. [2025-01-09 15:43:46,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:46" (1/1) ... [2025-01-09 15:43:46,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:46" (1/1) ... [2025-01-09 15:43:46,865 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:46" (1/1) ... [2025-01-09 15:43:46,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:46" (1/1) ... [2025-01-09 15:43:46,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:46" (1/1) ... [2025-01-09 15:43:46,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:46" (1/1) ... [2025-01-09 15:43:46,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:46" (1/1) ... [2025-01-09 15:43:46,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:43:46,893 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:43:46,893 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:43:46,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:43:46,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:46" (1/1) ... [2025-01-09 15:43:46,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:43:46,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:43:46,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:43:46,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:43:46,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:43:46,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:43:46,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:43:46,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:43:46,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:43:46,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:43:46,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:43:46,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-01-09 15:43:46,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-01-09 15:43:46,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-01-09 15:43:46,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-01-09 15:43:46,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:43:46,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:43:46,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:43:46,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:43:46,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:43:46,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:43:46,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:43:46,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 15:43:46,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 15:43:46,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 15:43:46,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:43:46,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:43:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:43:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:43:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:43:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:43:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-01-09 15:43:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-01-09 15:43:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-01-09 15:43:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-01-09 15:43:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:43:46,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:43:46,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:43:46,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:43:46,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:43:46,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:43:46,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:43:46,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 15:43:46,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 15:43:46,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 15:43:46,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:43:46,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:43:46,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:43:46,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:43:46,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:43:46,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:43:46,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-01-09 15:43:46,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-01-09 15:43:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-01-09 15:43:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-01-09 15:43:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:43:46,959 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:43:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:43:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:43:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:43:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:43:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:43:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:43:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:43:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 15:43:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 15:43:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 15:43:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:43:46,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:43:47,116 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:43:47,118 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:43:47,435 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-01-09 15:43:47,436 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:43:47,442 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:43:47,443 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:43:47,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:43:47 BoogieIcfgContainer [2025-01-09 15:43:47,443 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:43:47,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:43:47,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:43:47,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:43:47,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:43:46" (1/3) ... [2025-01-09 15:43:47,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1b9bed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:43:47, skipping insertion in model container [2025-01-09 15:43:47,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:46" (2/3) ... [2025-01-09 15:43:47,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1b9bed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:43:47, skipping insertion in model container [2025-01-09 15:43:47,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:43:47" (3/3) ... [2025-01-09 15:43:47,449 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-21.i [2025-01-09 15:43:47,457 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:43:47,458 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-21.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:43:47,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:43:47,496 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;@2be3d417, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:43:47,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:43:47,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 85 states have (on average 1.4823529411764707) internal successors, (126), 86 states have internal predecessors, (126), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 15:43:47,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 15:43:47,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:43:47,507 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:43:47,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:43:47,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:43:47,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1789359046, now seen corresponding path program 1 times [2025-01-09 15:43:47,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:43:47,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284887226] [2025-01-09 15:43:47,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:43:47,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:43:47,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 15:43:47,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 15:43:47,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:43:47,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:43:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 15:43:47,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:43:47,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284887226] [2025-01-09 15:43:47,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284887226] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:43:47,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088193889] [2025-01-09 15:43:47,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:43:47,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:43:47,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:43:47,745 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:43:47,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:43:47,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 15:43:47,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 15:43:47,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:43:47,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:43:47,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:43:47,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:43:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 15:43:47,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:43:47,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088193889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:43:47,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:43:47,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:43:47,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607194509] [2025-01-09 15:43:47,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:43:47,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:43:47,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:43:47,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:43:47,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:43:48,000 INFO L87 Difference]: Start difference. First operand has 95 states, 85 states have (on average 1.4823529411764707) internal successors, (126), 86 states have internal predecessors, (126), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:43:48,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:43:48,014 INFO L93 Difference]: Finished difference Result 184 states and 282 transitions. [2025-01-09 15:43:48,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:43:48,015 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2025-01-09 15:43:48,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:43:48,019 INFO L225 Difference]: With dead ends: 184 [2025-01-09 15:43:48,019 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 15:43:48,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:43:48,022 INFO L435 NwaCegarLoop]: 135 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, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:43:48,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:43:48,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 15:43:48,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-01-09 15:43:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 83 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 15:43:48,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2025-01-09 15:43:48,051 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 80 [2025-01-09 15:43:48,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:43:48,051 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2025-01-09 15:43:48,051 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:43:48,051 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2025-01-09 15:43:48,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 15:43:48,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:43:48,060 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:43:48,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:43:48,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:43:48,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:43:48,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:43:48,262 INFO L85 PathProgramCache]: Analyzing trace with hash 800966132, now seen corresponding path program 1 times [2025-01-09 15:43:48,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:43:48,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151929137] [2025-01-09 15:43:48,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:43:48,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:43:48,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 15:43:48,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 15:43:48,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:43:48,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:43:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:43:48,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:43:48,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151929137] [2025-01-09 15:43:48,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151929137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:43:48,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:43:48,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:43:48,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279737070] [2025-01-09 15:43:48,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:43:48,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:43:48,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:43:48,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:43:48,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:43:48,970 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:43:49,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:43:49,151 INFO L93 Difference]: Finished difference Result 301 states and 443 transitions. [2025-01-09 15:43:49,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:43:49,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 80 [2025-01-09 15:43:49,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:43:49,153 INFO L225 Difference]: With dead ends: 301 [2025-01-09 15:43:49,154 INFO L226 Difference]: Without dead ends: 212 [2025-01-09 15:43:49,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:43:49,156 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 239 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:43:49,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 704 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:43:49,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-01-09 15:43:49,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 185. [2025-01-09 15:43:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 168 states have (on average 1.4404761904761905) internal successors, (242), 168 states have internal predecessors, (242), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:43:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 270 transitions. [2025-01-09 15:43:49,178 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 270 transitions. Word has length 80 [2025-01-09 15:43:49,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:43:49,179 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 270 transitions. [2025-01-09 15:43:49,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:43:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 270 transitions. [2025-01-09 15:43:49,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 15:43:49,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:43:49,181 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:43:49,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:43:49,181 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:43:49,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:43:49,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1697606610, now seen corresponding path program 1 times [2025-01-09 15:43:49,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:43:49,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582289774] [2025-01-09 15:43:49,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:43:49,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:43:49,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 15:43:49,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 15:43:49,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:43:49,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:43:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:43:49,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:43:49,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582289774] [2025-01-09 15:43:49,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582289774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:43:49,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:43:49,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:43:49,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072386774] [2025-01-09 15:43:49,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:43:49,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:43:49,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:43:49,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:43:49,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:43:49,325 INFO L87 Difference]: Start difference. First operand 185 states and 270 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:43:49,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:43:49,358 INFO L93 Difference]: Finished difference Result 370 states and 541 transitions. [2025-01-09 15:43:49,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:43:49,359 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 83 [2025-01-09 15:43:49,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:43:49,361 INFO L225 Difference]: With dead ends: 370 [2025-01-09 15:43:49,361 INFO L226 Difference]: Without dead ends: 188 [2025-01-09 15:43:49,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:43:49,363 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:43:49,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 513 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:43:49,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-09 15:43:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-01-09 15:43:49,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 171 states have (on average 1.4269005847953216) internal successors, (244), 171 states have internal predecessors, (244), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:43:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 272 transitions. [2025-01-09 15:43:49,379 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 272 transitions. Word has length 83 [2025-01-09 15:43:49,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:43:49,379 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 272 transitions. [2025-01-09 15:43:49,379 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:43:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 272 transitions. [2025-01-09 15:43:49,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 15:43:49,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:43:49,382 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:43:49,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:43:49,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:43:49,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:43:49,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1155164695, now seen corresponding path program 1 times [2025-01-09 15:43:49,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:43:49,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251973516] [2025-01-09 15:43:49,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:43:49,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:43:49,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 15:43:49,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 15:43:49,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:43:49,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:43:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:43:50,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:43:50,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251973516] [2025-01-09 15:43:50,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251973516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:43:50,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:43:50,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:43:50,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799927981] [2025-01-09 15:43:50,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:43:50,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:43:50,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:43:50,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:43:50,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:43:50,102 INFO L87 Difference]: Start difference. First operand 188 states and 272 transitions. Second operand has 12 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 15:43:50,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:43:50,424 INFO L93 Difference]: Finished difference Result 582 states and 833 transitions. [2025-01-09 15:43:50,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:43:50,424 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 87 [2025-01-09 15:43:50,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:43:50,427 INFO L225 Difference]: With dead ends: 582 [2025-01-09 15:43:50,427 INFO L226 Difference]: Without dead ends: 397 [2025-01-09 15:43:50,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:43:50,428 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 366 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:43:50,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1261 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:43:50,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-01-09 15:43:50,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 305. [2025-01-09 15:43:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 280 states have (on average 1.4142857142857144) internal successors, (396), 282 states have internal predecessors, (396), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:43:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 436 transitions. [2025-01-09 15:43:50,455 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 436 transitions. Word has length 87 [2025-01-09 15:43:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:43:50,455 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 436 transitions. [2025-01-09 15:43:50,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 15:43:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 436 transitions. [2025-01-09 15:43:50,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 15:43:50,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:43:50,459 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:43:50,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:43:50,459 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:43:50,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:43:50,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1555566048, now seen corresponding path program 1 times [2025-01-09 15:43:50,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:43:50,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461626745] [2025-01-09 15:43:50,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:43:50,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:43:50,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 15:43:50,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 15:43:50,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:43:50,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:43:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:43:50,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:43:50,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461626745] [2025-01-09 15:43:50,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461626745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:43:50,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:43:50,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:43:50,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229743945] [2025-01-09 15:43:50,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:43:50,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:43:50,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:43:50,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:43:50,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:43:50,928 INFO L87 Difference]: Start difference. First operand 305 states and 436 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 15:43:51,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:43:51,108 INFO L93 Difference]: Finished difference Result 655 states and 931 transitions. [2025-01-09 15:43:51,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:43:51,109 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 88 [2025-01-09 15:43:51,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:43:51,112 INFO L225 Difference]: With dead ends: 655 [2025-01-09 15:43:51,112 INFO L226 Difference]: Without dead ends: 484 [2025-01-09 15:43:51,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:43:51,113 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 366 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:43:51,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1008 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:43:51,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-01-09 15:43:51,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 308. [2025-01-09 15:43:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 283 states have (on average 1.4098939929328622) internal successors, (399), 285 states have internal predecessors, (399), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:43:51,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 439 transitions. [2025-01-09 15:43:51,128 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 439 transitions. Word has length 88 [2025-01-09 15:43:51,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:43:51,128 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 439 transitions. [2025-01-09 15:43:51,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 15:43:51,129 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 439 transitions. [2025-01-09 15:43:51,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 15:43:51,129 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:43:51,129 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:43:51,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:43:51,130 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:43:51,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:43:51,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1398466558, now seen corresponding path program 1 times [2025-01-09 15:43:51,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:43:51,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156061495] [2025-01-09 15:43:51,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:43:51,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:43:51,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:43:51,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:43:51,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:43:51,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:43:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:43:51,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:43:51,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156061495] [2025-01-09 15:43:51,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156061495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:43:51,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:43:51,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:43:51,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408218217] [2025-01-09 15:43:51,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:43:51,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:43:51,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:43:51,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:43:51,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:43:51,312 INFO L87 Difference]: Start difference. First operand 308 states and 439 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:43:51,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:43:51,351 INFO L93 Difference]: Finished difference Result 322 states and 455 transitions. [2025-01-09 15:43:51,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:43:51,352 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2025-01-09 15:43:51,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:43:51,357 INFO L225 Difference]: With dead ends: 322 [2025-01-09 15:43:51,357 INFO L226 Difference]: Without dead ends: 320 [2025-01-09 15:43:51,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:43:51,357 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:43:51,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 888 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:43:51,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-01-09 15:43:51,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2025-01-09 15:43:51,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 295 states have (on average 1.3932203389830509) internal successors, (411), 297 states have internal predecessors, (411), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:43:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 451 transitions. [2025-01-09 15:43:51,370 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 451 transitions. Word has length 89 [2025-01-09 15:43:51,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:43:51,370 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 451 transitions. [2025-01-09 15:43:51,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:43:51,370 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 451 transitions. [2025-01-09 15:43:51,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 15:43:51,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:43:51,371 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:43:51,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:43:51,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:43:51,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:43:51,372 INFO L85 PathProgramCache]: Analyzing trace with hash 523524625, now seen corresponding path program 1 times [2025-01-09 15:43:51,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:43:51,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990486543] [2025-01-09 15:43:51,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:43:51,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:43:51,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:43:51,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:43:51,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:43:51,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:43:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:43:51,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:43:51,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990486543] [2025-01-09 15:43:51,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990486543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:43:51,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:43:51,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:43:51,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098078479] [2025-01-09 15:43:51,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:43:51,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:43:51,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:43:51,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:43:51,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:43:51,485 INFO L87 Difference]: Start difference. First operand 320 states and 451 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:43:51,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:43:51,563 INFO L93 Difference]: Finished difference Result 958 states and 1344 transitions. [2025-01-09 15:43:51,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:43:51,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2025-01-09 15:43:51,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:43:51,566 INFO L225 Difference]: With dead ends: 958 [2025-01-09 15:43:51,566 INFO L226 Difference]: Without dead ends: 663 [2025-01-09 15:43:51,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:43:51,567 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 205 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:43:51,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 604 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:43:51,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-01-09 15:43:51,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 585. [2025-01-09 15:43:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 539 states have (on average 1.3840445269016697) internal successors, (746), 542 states have internal predecessors, (746), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 15:43:51,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 820 transitions. [2025-01-09 15:43:51,590 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 820 transitions. Word has length 89 [2025-01-09 15:43:51,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:43:51,590 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 820 transitions. [2025-01-09 15:43:51,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:43:51,590 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 820 transitions. [2025-01-09 15:43:51,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 15:43:51,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:43:51,591 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:43:51,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:43:51,591 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:43:51,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:43:51,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1470620081, now seen corresponding path program 1 times [2025-01-09 15:43:51,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:43:51,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50555505] [2025-01-09 15:43:51,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:43:51,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:43:51,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:43:51,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:43:51,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:43:51,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:43:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 15:43:51,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:43:51,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50555505] [2025-01-09 15:43:51,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50555505] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:43:51,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177373554] [2025-01-09 15:43:51,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:43:51,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:43:51,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:43:51,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:43:51,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:43:51,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:43:52,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:43:52,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:43:52,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:43:52,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 15:43:52,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:43:52,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:43:52,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 15:43:52,220 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 15:43:52,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:43:52,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-01-09 15:43:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 15:43:52,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177373554] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:43:52,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:43:52,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2025-01-09 15:43:52,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381859205] [2025-01-09 15:43:52,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:43:52,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:43:52,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:43:52,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:43:52,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:43:52,538 INFO L87 Difference]: Start difference. First operand 585 states and 820 transitions. Second operand has 14 states, 10 states have (on average 7.2) internal successors, (72), 13 states have internal predecessors, (72), 6 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (16), 3 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 15:43:53,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:43:53,128 INFO L93 Difference]: Finished difference Result 894 states and 1249 transitions. [2025-01-09 15:43:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:43:53,129 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 7.2) internal successors, (72), 13 states have internal predecessors, (72), 6 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (16), 3 states have call predecessors, (16), 6 states have call successors, (16) Word has length 89 [2025-01-09 15:43:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:43:53,131 INFO L225 Difference]: With dead ends: 894 [2025-01-09 15:43:53,131 INFO L226 Difference]: Without dead ends: 334 [2025-01-09 15:43:53,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 171 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:43:53,132 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 423 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:43:53,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 678 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:43:53,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-01-09 15:43:53,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-01-09 15:43:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 302 states have (on average 1.3741721854304636) internal successors, (415), 303 states have internal predecessors, (415), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:43:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 463 transitions. [2025-01-09 15:43:53,163 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 463 transitions. Word has length 89 [2025-01-09 15:43:53,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:43:53,163 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 463 transitions. [2025-01-09 15:43:53,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 7.2) internal successors, (72), 13 states have internal predecessors, (72), 6 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (16), 3 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 15:43:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 463 transitions. [2025-01-09 15:43:53,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 15:43:53,164 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:43:53,164 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:43:53,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:43:53,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:43:53,364 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:43:53,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:43:53,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1062990808, now seen corresponding path program 1 times [2025-01-09 15:43:53,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:43:53,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383305568] [2025-01-09 15:43:53,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:43:53,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:43:53,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 15:43:53,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 15:43:53,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:43:53,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:43:53,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1588673988] [2025-01-09 15:43:53,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:43:53,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:43:53,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:43:53,395 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:43:53,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 15:43:53,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 15:43:53,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 15:43:53,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:43:53,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:43:53,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:43:53,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 15:43:53,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 15:43:53,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:43:53,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:43:53,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:43:53,691 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:43:53,692 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:43:53,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 15:43:53,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:43:53,898 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:43:54,029 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:43:54,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:43:54 BoogieIcfgContainer [2025-01-09 15:43:54,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:43:54,033 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:43:54,033 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:43:54,033 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:43:54,034 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:43:47" (3/4) ... [2025-01-09 15:43:54,036 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:43:54,037 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:43:54,038 INFO L158 Benchmark]: Toolchain (without parser) took 7535.73ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 109.1MB in the beginning and 363.1MB in the end (delta: -254.0MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2025-01-09 15:43:54,038 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 226.5MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:43:54,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.31ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 95.5MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:43:54,039 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.35ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 92.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:43:54,039 INFO L158 Benchmark]: Boogie Preprocessor took 71.09ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 88.2MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:43:54,039 INFO L158 Benchmark]: RCFGBuilder took 550.29ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 57.6MB in the end (delta: 30.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 15:43:54,039 INFO L158 Benchmark]: TraceAbstraction took 6587.75ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 56.5MB in the beginning and 363.2MB in the end (delta: -306.7MB). Peak memory consumption was 150.2MB. Max. memory is 16.1GB. [2025-01-09 15:43:54,040 INFO L158 Benchmark]: Witness Printer took 4.08ms. Allocated memory is still 419.4MB. Free memory was 363.2MB in the beginning and 363.1MB in the end (delta: 106.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:43:54,041 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.12ms. Allocated memory is still 226.5MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.31ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 95.5MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.35ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 92.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.09ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 88.2MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 550.29ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 57.6MB in the end (delta: 30.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6587.75ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 56.5MB in the beginning and 363.2MB in the end (delta: -306.7MB). Peak memory consumption was 150.2MB. Max. memory is 16.1GB. * Witness Printer took 4.08ms. Allocated memory is still 419.4MB. Free memory was 363.2MB in the beginning and 363.1MB in the end (delta: 106.0kB). 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 80, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 73. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L22] unsigned short int var_1_1 = 32; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_7 = 0; [L24] unsigned char var_1_7 = 0; [L25] unsigned char* var_1_7_Pointer = &(var_1_7); [L26] double var_1_8 = 15.6; [L26] double var_1_8 = 15.6; [L27] double* var_1_8_Pointer = &(var_1_8); [L28] double var_1_9 = 15.4; [L28] double var_1_9 = 15.4; [L29] double* var_1_9_Pointer = &(var_1_9); [L30] double var_1_10 = 32.2; [L30] double var_1_10 = 32.2; [L31] double* var_1_10_Pointer = &(var_1_10); [L32] unsigned char var_1_12 = 1; [L32] unsigned char var_1_12 = 1; [L33] unsigned char* var_1_12_Pointer = &(var_1_12); [L34] signed short int var_1_13 = 256; [L34] signed short int var_1_13 = 256; [L35] signed short int* var_1_13_Pointer = &(var_1_13); [L36] float var_1_14 = 5.75; [L36] float var_1_14 = 5.75; [L37] float* var_1_14_Pointer = &(var_1_14); [L38] float var_1_15 = 8.6; [L38] float var_1_15 = 8.6; [L39] float* var_1_15_Pointer = &(var_1_15); [L40] unsigned char last_1_var_1_7 = 0; [L41] signed short int last_1_var_1_13 = 256; VAL [isInitial=0, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L93] isInitial = 1 [L94] FCALL initially() [L96] CALL updateLastVariables() [L85] EXPR \read(var_1_7) [L85] last_1_var_1_7 = var_1_7 [L86] EXPR \read(var_1_13) [L86] last_1_var_1_13 = var_1_13 [L96] RET updateLastVariables() [L97] CALL updateVariables() [L70] var_1_8 = __VERIFIER_nondet_double() [L71] EXPR \read(var_1_8) [L71] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L71] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F [L71] EXPR \read(var_1_8) [L71] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L71] EXPR (var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L71] EXPR (var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L71] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L71] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L72] var_1_9 = __VERIFIER_nondet_double() [L73] EXPR \read(var_1_9) [L73] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L73] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F [L73] EXPR \read(var_1_9) [L73] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L73] EXPR (var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L73] EXPR (var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L73] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L73] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L74] var_1_10 = __VERIFIER_nondet_double() [L75] EXPR \read(var_1_10) [L75] EXPR var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] EXPR var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F [L75] EXPR \read(var_1_10) [L75] EXPR var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] EXPR (var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] EXPR (var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L76] var_1_12 = __VERIFIER_nondet_uchar() [L77] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L77] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L77] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L79] var_1_14 = __VERIFIER_nondet_float() [L80] EXPR \read(var_1_14) [L80] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F [L80] EXPR \read(var_1_14) [L80] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] EXPR (var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] EXPR (var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] var_1_15 = __VERIFIER_nondet_float() [L82] EXPR \read(var_1_15) [L82] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F [L82] EXPR \read(var_1_15) [L82] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] RET updateVariables() [L98] CALL step() [L45] COND TRUE (last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L46] COND FALSE !(last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L54] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L54] COND TRUE (*(var_1_12_Pointer)) [L55] EXPR \read(*var_1_14_Pointer) [L55] EXPR \read(*var_1_15_Pointer) [L55] EXPR \read(*var_1_8_Pointer) [L55] EXPR \read(*var_1_10_Pointer) [L55] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L55] COND FALSE !(((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) >= (((*(var_1_8_Pointer)) + (*(var_1_10_Pointer))) + (*(var_1_9_Pointer)))) [L58] EXPR \read(*var_1_1_Pointer) [L58] (*(var_1_13_Pointer)) = (*(var_1_1_Pointer)) [L61] EXPR \read(*var_1_8_Pointer) [L61] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L61] EXPR (((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))) [L61] EXPR \read(*var_1_8_Pointer) [L61] EXPR (((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L61] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L61] COND TRUE (((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer)) [L62] last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L62] last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L62] COND FALSE !(last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR ((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1 [L89] EXPR (last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR ((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13))) && (((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13))) && (((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) [L89] EXPR \read(*var_1_8_Pointer) [L89] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))) [L89] EXPR \read(*var_1_8_Pointer) [L89] EXPR (((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR ((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) [L89] EXPR \read(*var_1_7_Pointer) [L89] EXPR \read(*var_1_12_Pointer) [L89] EXPR ((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13))) && (((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR ((((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13))) && (((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((*(var_1_12_Pointer)) ? ((((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) >= (((*(var_1_8_Pointer)) + (*(var_1_10_Pointer))) + (*(var_1_9_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed short int) (((((*(var_1_1_Pointer))) > ((*(var_1_1_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_1_Pointer))))))) : ((*(var_1_13_Pointer)) == ((signed short int) (*(var_1_1_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR ((((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13))) && (((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((*(var_1_12_Pointer)) ? ((((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) >= (((*(var_1_8_Pointer)) + (*(var_1_10_Pointer))) + (*(var_1_9_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed short int) (((((*(var_1_1_Pointer))) > ((*(var_1_1_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_1_Pointer))))))) : ((*(var_1_13_Pointer)) == ((signed short int) (*(var_1_1_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89-L90] return ((((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13))) && (((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((*(var_1_12_Pointer)) ? ((((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) >= (((*(var_1_8_Pointer)) + (*(var_1_10_Pointer))) + (*(var_1_9_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed short int) (((((*(var_1_1_Pointer))) > ((*(var_1_1_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_1_Pointer))))))) : ((*(var_1_13_Pointer)) == ((signed short int) (*(var_1_1_Pointer))))) : 1) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 9, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1599 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1599 mSDsluCounter, 5791 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4650 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 735 IncrementalHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 1141 mSDtfsCounter, 735 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 274 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=585occurred in iteration=7, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 373 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1034 NumberOfCodeBlocks, 1034 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 932 ConstructedInterpolants, 0 QuantifiedInterpolants, 3048 SizeOfPredicates, 7 NumberOfNonLiveVariables, 744 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 837/924 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 15:43:54,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.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 1cca72686861ad5f32c03321c83cb01c79fc9fe11e27ec52efe74f8c4ef5e302 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:43:56,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:43:56,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:43:56,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:43:56,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:43:56,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:43:56,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:43:56,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:43:56,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:43:56,474 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:43:56,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:43:56,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:43:56,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:43:56,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:43:56,475 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:43:56,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:43:56,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:43:56,475 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:43:56,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:43:56,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:43:56,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:43:56,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:43:56,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:43:56,475 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:43:56,475 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:43:56,476 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:43:56,476 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:43:56,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:43:56,476 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:43:56,476 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:43:56,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:43:56,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:43:56,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:43:56,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:43:56,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:43:56,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:43:56,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:43:56,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:43:56,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:43:56,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:43:56,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:43:56,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:43:56,476 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:43:56,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:43:56,477 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:43:56,477 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:43:56,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:43:56,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:43:56,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:43:56,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:43:56,477 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 -> 1cca72686861ad5f32c03321c83cb01c79fc9fe11e27ec52efe74f8c4ef5e302 [2025-01-09 15:43:56,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:43:56,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:43:56,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:43:56,767 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:43:56,767 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:43:56,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i [2025-01-09 15:43:58,171 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f97be73be/4a20f68a06114c2cb7e960152baf3513/FLAG6e5365ff1 [2025-01-09 15:43:58,396 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:43:58,396 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i [2025-01-09 15:43:58,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f97be73be/4a20f68a06114c2cb7e960152baf3513/FLAG6e5365ff1 [2025-01-09 15:43:58,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f97be73be/4a20f68a06114c2cb7e960152baf3513 [2025-01-09 15:43:58,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:43:58,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:43:58,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:43:58,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:43:58,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:43:58,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:43:58" (1/1) ... [2025-01-09 15:43:58,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60177a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:58, skipping insertion in model container [2025-01-09 15:43:58,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:43:58" (1/1) ... [2025-01-09 15:43:58,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:43:58,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i[916,929] [2025-01-09 15:43:58,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:43:58,917 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:43:58,924 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i[916,929] [2025-01-09 15:43:58,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:43:58,970 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:43:58,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:58 WrapperNode [2025-01-09 15:43:58,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:43:58,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:43:58,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:43:58,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:43:58,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:58" (1/1) ... [2025-01-09 15:43:58,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:58" (1/1) ... [2025-01-09 15:43:59,016 INFO L138 Inliner]: procedures = 36, calls = 118, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 417 [2025-01-09 15:43:59,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:43:59,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:43:59,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:43:59,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:43:59,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:58" (1/1) ... [2025-01-09 15:43:59,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:58" (1/1) ... [2025-01-09 15:43:59,032 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:58" (1/1) ... [2025-01-09 15:43:59,061 INFO L175 MemorySlicer]: Split 91 memory accesses to 10 slices as follows [2, 19, 6, 12, 12, 10, 8, 6, 8, 8]. 21 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 12 writes are split as follows [0, 2, 2, 1, 1, 1, 1, 2, 1, 1]. [2025-01-09 15:43:59,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:58" (1/1) ... [2025-01-09 15:43:59,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:58" (1/1) ... [2025-01-09 15:43:59,090 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:58" (1/1) ... [2025-01-09 15:43:59,091 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:58" (1/1) ... [2025-01-09 15:43:59,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:58" (1/1) ... [2025-01-09 15:43:59,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:58" (1/1) ... [2025-01-09 15:43:59,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:58" (1/1) ... [2025-01-09 15:43:59,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:43:59,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:43:59,114 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:43:59,114 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:43:59,115 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:58" (1/1) ... [2025-01-09 15:43:59,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:43:59,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:43:59,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:43:59,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:43:59,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:43:59,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:43:59,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:43:59,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-01-09 15:43:59,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-01-09 15:43:59,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-01-09 15:43:59,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-01-09 15:43:59,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-01-09 15:43:59,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-01-09 15:43:59,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-01-09 15:43:59,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-01-09 15:43:59,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:43:59,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:43:59,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-01-09 15:43:59,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-01-09 15:43:59,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-01-09 15:43:59,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-01-09 15:43:59,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-01-09 15:43:59,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-01-09 15:43:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-01-09 15:43:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-01-09 15:43:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:43:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:43:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:43:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:43:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:43:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:43:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-01-09 15:43:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-01-09 15:43:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-01-09 15:43:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-01-09 15:43:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:43:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:43:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:43:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:43:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:43:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-01-09 15:43:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-01-09 15:43:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-01-09 15:43:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-01-09 15:43:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-01-09 15:43:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:43:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:43:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:43:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:43:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:43:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:43:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-01-09 15:43:59,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-01-09 15:43:59,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-01-09 15:43:59,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-01-09 15:43:59,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:43:59,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:43:59,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 15:43:59,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 15:43:59,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 15:43:59,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-01-09 15:43:59,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-01-09 15:43:59,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-01-09 15:43:59,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-01-09 15:43:59,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-01-09 15:43:59,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:43:59,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:43:59,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-01-09 15:43:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-01-09 15:43:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-01-09 15:43:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-01-09 15:43:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-01-09 15:43:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-01-09 15:43:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-01-09 15:43:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-01-09 15:43:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:43:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:43:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:43:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:43:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:43:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-01-09 15:43:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-01-09 15:43:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-01-09 15:43:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-01-09 15:43:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-01-09 15:43:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:43:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:43:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-01-09 15:43:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-01-09 15:43:59,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-01-09 15:43:59,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-01-09 15:43:59,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-01-09 15:43:59,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-01-09 15:43:59,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-01-09 15:43:59,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-01-09 15:43:59,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 15:43:59,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 15:43:59,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 15:43:59,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 15:43:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 15:43:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-01-09 15:43:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-01-09 15:43:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-01-09 15:43:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-01-09 15:43:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-01-09 15:43:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:43:59,184 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:43:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:43:59,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:43:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:43:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:43:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:43:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:43:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:43:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:43:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-01-09 15:43:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-01-09 15:43:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-01-09 15:43:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-01-09 15:43:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:43:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:43:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:43:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:43:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:43:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-01-09 15:43:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-01-09 15:43:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-01-09 15:43:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-01-09 15:43:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-01-09 15:43:59,396 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:43:59,397 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:44:08,857 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2025-01-09 15:44:08,857 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:44:08,864 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:44:08,864 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:44:08,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:08 BoogieIcfgContainer [2025-01-09 15:44:08,865 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:44:08,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:44:08,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:44:08,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:44:08,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:43:58" (1/3) ... [2025-01-09 15:44:08,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d4e6ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:44:08, skipping insertion in model container [2025-01-09 15:44:08,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:43:58" (2/3) ... [2025-01-09 15:44:08,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d4e6ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:44:08, skipping insertion in model container [2025-01-09 15:44:08,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:08" (3/3) ... [2025-01-09 15:44:08,871 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-21.i [2025-01-09 15:44:08,880 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:44:08,882 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-21.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:44:08,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:44:08,949 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;@2d90e79a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:44:08,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:44:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 85 states have (on average 1.4823529411764707) internal successors, (126), 86 states have internal predecessors, (126), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 15:44:08,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 15:44:08,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:08,968 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:08,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:08,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:08,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1789359046, now seen corresponding path program 1 times [2025-01-09 15:44:08,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:08,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038528112] [2025-01-09 15:44:08,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:08,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:08,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:09,000 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:44:09,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 15:44:09,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 15:44:09,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 15:44:09,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:09,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:09,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:44:09,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 15:44:09,345 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:44:09,345 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:09,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038528112] [2025-01-09 15:44:09,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1038528112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:09,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:09,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:44:09,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023417496] [2025-01-09 15:44:09,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:09,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:44:09,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:09,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:44:09,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:44:09,369 INFO L87 Difference]: Start difference. First operand has 95 states, 85 states have (on average 1.4823529411764707) internal successors, (126), 86 states have internal predecessors, (126), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:44:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:09,387 INFO L93 Difference]: Finished difference Result 184 states and 282 transitions. [2025-01-09 15:44:09,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:44:09,389 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2025-01-09 15:44:09,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:09,393 INFO L225 Difference]: With dead ends: 184 [2025-01-09 15:44:09,394 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 15:44:09,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:44:09,397 INFO L435 NwaCegarLoop]: 135 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, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:09,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:44:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 15:44:09,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-01-09 15:44:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 83 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 15:44:09,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2025-01-09 15:44:09,441 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 80 [2025-01-09 15:44:09,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:09,441 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2025-01-09 15:44:09,441 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:44:09,441 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2025-01-09 15:44:09,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 15:44:09,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:09,447 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:09,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:44:09,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:09,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:09,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:09,651 INFO L85 PathProgramCache]: Analyzing trace with hash 800966132, now seen corresponding path program 1 times [2025-01-09 15:44:09,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:09,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735306493] [2025-01-09 15:44:09,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:09,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:09,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:09,654 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:44:09,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 15:44:09,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 15:44:09,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 15:44:09,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:09,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:09,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:44:09,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:10,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 15:44:10,158 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:44:10,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:44:10,159 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:10,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735306493] [2025-01-09 15:44:10,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735306493] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:10,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:10,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:44:10,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040706243] [2025-01-09 15:44:10,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:10,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:44:10,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:10,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:44:10,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:44:10,161 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:12,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:44:14,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:44:16,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:44:17,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:44:20,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:44:20,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:20,921 INFO L93 Difference]: Finished difference Result 301 states and 443 transitions. [2025-01-09 15:44:20,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:44:20,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 80 [2025-01-09 15:44:20,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:20,923 INFO L225 Difference]: With dead ends: 301 [2025-01-09 15:44:20,924 INFO L226 Difference]: Without dead ends: 212 [2025-01-09 15:44:20,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:44:20,928 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 224 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:20,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 370 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2025-01-09 15:44:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-01-09 15:44:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 185. [2025-01-09 15:44:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 168 states have (on average 1.4404761904761905) internal successors, (242), 168 states have internal predecessors, (242), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:44:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 270 transitions. [2025-01-09 15:44:20,953 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 270 transitions. Word has length 80 [2025-01-09 15:44:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:20,954 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 270 transitions. [2025-01-09 15:44:20,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 270 transitions. [2025-01-09 15:44:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 15:44:20,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:20,956 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:20,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:44:21,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:21,157 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:21,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:21,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1697606610, now seen corresponding path program 1 times [2025-01-09 15:44:21,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:21,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729234319] [2025-01-09 15:44:21,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:21,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:21,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:21,162 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:44:21,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 15:44:21,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 15:44:21,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 15:44:21,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:21,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:21,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:44:21,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:22,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 15:44:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 11 proven. 54 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 15:44:22,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:44:23,058 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 15:44:23,058 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 25 [2025-01-09 15:44:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-09 15:44:23,202 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:23,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729234319] [2025-01-09 15:44:23,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729234319] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:44:23,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:44:23,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2025-01-09 15:44:23,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309025321] [2025-01-09 15:44:23,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:44:23,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 15:44:23,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:23,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 15:44:23,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:44:23,204 INFO L87 Difference]: Start difference. First operand 185 states and 270 transitions. Second operand has 21 states, 17 states have (on average 5.0) internal successors, (85), 19 states have internal predecessors, (85), 7 states have call successors, (14), 4 states have call predecessors, (14), 7 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2025-01-09 15:44:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:23,931 INFO L93 Difference]: Finished difference Result 352 states and 504 transitions. [2025-01-09 15:44:23,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 15:44:23,932 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 5.0) internal successors, (85), 19 states have internal predecessors, (85), 7 states have call successors, (14), 4 states have call predecessors, (14), 7 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 83 [2025-01-09 15:44:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:23,933 INFO L225 Difference]: With dead ends: 352 [2025-01-09 15:44:23,935 INFO L226 Difference]: Without dead ends: 170 [2025-01-09 15:44:23,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2025-01-09 15:44:23,937 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 427 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:23,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1016 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:44:23,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-09 15:44:23,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-01-09 15:44:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 149 states have (on average 1.389261744966443) internal successors, (207), 149 states have internal predecessors, (207), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:44:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 235 transitions. [2025-01-09 15:44:23,951 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 235 transitions. Word has length 83 [2025-01-09 15:44:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:23,951 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 235 transitions. [2025-01-09 15:44:23,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 5.0) internal successors, (85), 19 states have internal predecessors, (85), 7 states have call successors, (14), 4 states have call predecessors, (14), 7 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2025-01-09 15:44:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 235 transitions. [2025-01-09 15:44:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 15:44:23,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:23,952 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:23,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 15:44:24,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:24,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:24,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:24,154 INFO L85 PathProgramCache]: Analyzing trace with hash -526285705, now seen corresponding path program 1 times [2025-01-09 15:44:24,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:24,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014205652] [2025-01-09 15:44:24,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:24,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:24,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:24,157 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:44:24,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 15:44:24,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 15:44:24,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 15:44:24,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:24,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:24,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:44:24,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:44:24,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:44:24,556 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:24,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014205652] [2025-01-09 15:44:24,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014205652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:24,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:24,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:44:24,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392768189] [2025-01-09 15:44:24,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:24,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:44:24,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:24,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:44:24,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:44:24,557 INFO L87 Difference]: Start difference. First operand 170 states and 235 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:24,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:24,670 INFO L93 Difference]: Finished difference Result 270 states and 376 transitions. [2025-01-09 15:44:24,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:44:24,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2025-01-09 15:44:24,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:24,673 INFO L225 Difference]: With dead ends: 270 [2025-01-09 15:44:24,673 INFO L226 Difference]: Without dead ends: 173 [2025-01-09 15:44:24,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:44:24,674 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:24,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:44:24,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-09 15:44:24,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-01-09 15:44:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 152 states have (on average 1.381578947368421) internal successors, (210), 152 states have internal predecessors, (210), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:44:24,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 238 transitions. [2025-01-09 15:44:24,696 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 238 transitions. Word has length 84 [2025-01-09 15:44:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:24,696 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 238 transitions. [2025-01-09 15:44:24,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 238 transitions. [2025-01-09 15:44:24,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 15:44:24,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:24,697 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:24,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 15:44:24,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:24,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:24,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:24,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1555566048, now seen corresponding path program 1 times [2025-01-09 15:44:24,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:24,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868089417] [2025-01-09 15:44:24,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:24,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:24,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:24,909 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:44:24,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 15:44:25,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 15:44:25,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 15:44:25,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:25,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:25,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 15:44:25,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:26,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 15:44:26,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2025-01-09 15:44:26,283 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 63 treesize of output 39 [2025-01-09 15:44:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 11 proven. 54 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 15:44:26,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:44:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:44:26,561 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:26,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868089417] [2025-01-09 15:44:26,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868089417] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:44:26,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:44:26,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2025-01-09 15:44:26,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789086019] [2025-01-09 15:44:26,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:26,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:44:26,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:26,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:44:26,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:44:26,562 INFO L87 Difference]: Start difference. First operand 173 states and 238 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:26,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:26,810 INFO L93 Difference]: Finished difference Result 338 states and 467 transitions. [2025-01-09 15:44:26,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:44:26,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 88 [2025-01-09 15:44:26,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:26,812 INFO L225 Difference]: With dead ends: 338 [2025-01-09 15:44:26,812 INFO L226 Difference]: Without dead ends: 238 [2025-01-09 15:44:26,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:44:26,813 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 73 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:26,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 772 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:44:26,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-01-09 15:44:26,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 235. [2025-01-09 15:44:26,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 210 states have (on average 1.380952380952381) internal successors, (290), 211 states have internal predecessors, (290), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:44:26,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 324 transitions. [2025-01-09 15:44:26,845 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 324 transitions. Word has length 88 [2025-01-09 15:44:26,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:26,845 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 324 transitions. [2025-01-09 15:44:26,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 324 transitions. [2025-01-09 15:44:26,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 15:44:26,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:26,846 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:26,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 15:44:27,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:27,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:27,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:27,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1135144331, now seen corresponding path program 1 times [2025-01-09 15:44:27,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:27,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640281942] [2025-01-09 15:44:27,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:27,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:27,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:27,051 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:44:27,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 15:44:27,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 15:44:27,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 15:44:27,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:27,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:27,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:44:27,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:28,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 15:44:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 11 proven. 54 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 15:44:28,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:44:28,795 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 15:44:28,796 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 25 [2025-01-09 15:44:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-09 15:44:28,885 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:28,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1640281942] [2025-01-09 15:44:28,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1640281942] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:44:28,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:44:28,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2025-01-09 15:44:28,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360193358] [2025-01-09 15:44:28,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:44:28,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 15:44:28,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:28,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 15:44:28,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:44:28,888 INFO L87 Difference]: Start difference. First operand 235 states and 324 transitions. Second operand has 21 states, 17 states have (on average 6.470588235294118) internal successors, (110), 19 states have internal predecessors, (110), 7 states have call successors, (14), 4 states have call predecessors, (14), 7 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2025-01-09 15:44:29,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:29,464 INFO L93 Difference]: Finished difference Result 394 states and 547 transitions. [2025-01-09 15:44:29,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 15:44:29,465 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 6.470588235294118) internal successors, (110), 19 states have internal predecessors, (110), 7 states have call successors, (14), 4 states have call predecessors, (14), 7 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 90 [2025-01-09 15:44:29,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:29,470 INFO L225 Difference]: With dead ends: 394 [2025-01-09 15:44:29,470 INFO L226 Difference]: Without dead ends: 235 [2025-01-09 15:44:29,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2025-01-09 15:44:29,472 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 634 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:29,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1003 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:44:29,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-01-09 15:44:29,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2025-01-09 15:44:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 210 states have (on average 1.3714285714285714) internal successors, (288), 211 states have internal predecessors, (288), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:44:29,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 322 transitions. [2025-01-09 15:44:29,505 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 322 transitions. Word has length 90 [2025-01-09 15:44:29,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:29,505 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 322 transitions. [2025-01-09 15:44:29,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 6.470588235294118) internal successors, (110), 19 states have internal predecessors, (110), 7 states have call successors, (14), 4 states have call predecessors, (14), 7 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2025-01-09 15:44:29,505 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 322 transitions. [2025-01-09 15:44:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 15:44:29,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:29,506 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:29,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2025-01-09 15:44:29,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:29,706 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:29,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:29,707 INFO L85 PathProgramCache]: Analyzing trace with hash 350516120, now seen corresponding path program 1 times [2025-01-09 15:44:29,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:29,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694041690] [2025-01-09 15:44:29,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:29,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:29,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:29,709 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:44:29,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 15:44:29,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 15:44:30,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 15:44:30,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:30,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:30,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:44:30,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:30,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 15:44:30,466 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:44:30,466 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:44:30,466 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:30,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694041690] [2025-01-09 15:44:30,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694041690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:30,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:30,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:44:30,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436849739] [2025-01-09 15:44:30,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:30,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:44:30,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:30,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:44:30,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:44:30,468 INFO L87 Difference]: Start difference. First operand 235 states and 322 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:30,629 INFO L93 Difference]: Finished difference Result 535 states and 736 transitions. [2025-01-09 15:44:30,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:44:30,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2025-01-09 15:44:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:30,633 INFO L225 Difference]: With dead ends: 535 [2025-01-09 15:44:30,633 INFO L226 Difference]: Without dead ends: 372 [2025-01-09 15:44:30,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:44:30,635 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 201 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:30,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 586 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:44:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-01-09 15:44:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 334. [2025-01-09 15:44:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 299 states have (on average 1.3678929765886287) internal successors, (409), 300 states have internal predecessors, (409), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:44:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 457 transitions. [2025-01-09 15:44:30,673 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 457 transitions. Word has length 90 [2025-01-09 15:44:30,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:30,674 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 457 transitions. [2025-01-09 15:44:30,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 457 transitions. [2025-01-09 15:44:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 15:44:30,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:30,676 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:30,709 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 (8)] Forceful destruction successful, exit code 0 [2025-01-09 15:44:30,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:30,877 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:30,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:30,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1062990808, now seen corresponding path program 1 times [2025-01-09 15:44:30,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:30,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847736262] [2025-01-09 15:44:30,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:30,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:30,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:30,884 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:44:30,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-01-09 15:44:31,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 15:44:31,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 15:44:31,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:31,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:31,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 15:44:31,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:35,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:44:35,136 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 228 treesize of output 108 [2025-01-09 15:44:35,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:44:35,425 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 153 treesize of output 63 [2025-01-09 15:44:35,836 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 15:44:35,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:44:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:44:37,690 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:37,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847736262] [2025-01-09 15:44:37,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847736262] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:44:37,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:44:37,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2025-01-09 15:44:37,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153218087] [2025-01-09 15:44:37,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:37,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:44:37,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:37,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:44:37,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:44:37,692 INFO L87 Difference]: Start difference. First operand 334 states and 457 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:39,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:39,189 INFO L93 Difference]: Finished difference Result 678 states and 931 transitions. [2025-01-09 15:44:39,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:44:39,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2025-01-09 15:44:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:39,196 INFO L225 Difference]: With dead ends: 678 [2025-01-09 15:44:39,196 INFO L226 Difference]: Without dead ends: 420 [2025-01-09 15:44:39,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:44:39,198 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 84 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:39,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 660 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:44:39,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-01-09 15:44:39,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 378. [2025-01-09 15:44:39,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 343 states have (on average 1.3644314868804666) internal successors, (468), 344 states have internal predecessors, (468), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:44:39,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 516 transitions. [2025-01-09 15:44:39,221 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 516 transitions. Word has length 90 [2025-01-09 15:44:39,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:39,221 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 516 transitions. [2025-01-09 15:44:39,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 516 transitions. [2025-01-09 15:44:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 15:44:39,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:39,222 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:39,237 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-01-09 15:44:39,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:39,423 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:39,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:39,424 INFO L85 PathProgramCache]: Analyzing trace with hash 669963798, now seen corresponding path program 1 times [2025-01-09 15:44:39,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:39,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184341640] [2025-01-09 15:44:39,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:39,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:39,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:39,427 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:44:39,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-01-09 15:44:39,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 15:44:39,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 15:44:39,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:39,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:39,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 15:44:39,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:42,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:44:42,186 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 133 treesize of output 73 [2025-01-09 15:44:42,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:44:42,201 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 203 treesize of output 83 [2025-01-09 15:44:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 15:44:42,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:44:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:44:43,392 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:43,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184341640] [2025-01-09 15:44:43,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184341640] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:44:43,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:44:43,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2025-01-09 15:44:43,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947767746] [2025-01-09 15:44:43,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:43,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:44:43,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:43,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:44:43,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:44:43,394 INFO L87 Difference]: Start difference. First operand 378 states and 516 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:44,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:44,358 INFO L93 Difference]: Finished difference Result 749 states and 1024 transitions. [2025-01-09 15:44:44,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:44:44,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2025-01-09 15:44:44,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:44,367 INFO L225 Difference]: With dead ends: 749 [2025-01-09 15:44:44,367 INFO L226 Difference]: Without dead ends: 454 [2025-01-09 15:44:44,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:44:44,371 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 38 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:44,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 494 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:44:44,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-01-09 15:44:44,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 393. [2025-01-09 15:44:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 358 states have (on average 1.3547486033519553) internal successors, (485), 359 states have internal predecessors, (485), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:44:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 533 transitions. [2025-01-09 15:44:44,415 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 533 transitions. Word has length 90 [2025-01-09 15:44:44,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:44,415 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 533 transitions. [2025-01-09 15:44:44,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 533 transitions. [2025-01-09 15:44:44,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 15:44:44,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:44,416 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:44,451 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-01-09 15:44:44,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:44,625 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:44,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:44,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1485692634, now seen corresponding path program 1 times [2025-01-09 15:44:44,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:44,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892223706] [2025-01-09 15:44:44,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:44,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:44,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:44,628 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:44:44,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-01-09 15:44:44,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 15:44:45,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 15:44:45,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:45,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:45,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 15:44:45,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:47,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:44:47,417 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 234 treesize of output 114 [2025-01-09 15:44:47,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:44:47,427 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 154 treesize of output 64 [2025-01-09 15:44:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 15:44:47,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:44:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:44:48,498 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:48,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892223706] [2025-01-09 15:44:48,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892223706] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:44:48,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:44:48,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2025-01-09 15:44:48,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527023400] [2025-01-09 15:44:48,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:48,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:44:48,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:48,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:44:48,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:44:48,500 INFO L87 Difference]: Start difference. First operand 393 states and 533 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:49,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:49,431 INFO L93 Difference]: Finished difference Result 761 states and 1035 transitions. [2025-01-09 15:44:49,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:44:49,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2025-01-09 15:44:49,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:49,438 INFO L225 Difference]: With dead ends: 761 [2025-01-09 15:44:49,438 INFO L226 Difference]: Without dead ends: 454 [2025-01-09 15:44:49,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:44:49,440 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 40 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:49,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 548 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:44:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-01-09 15:44:49,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 393. [2025-01-09 15:44:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 358 states have (on average 1.3463687150837989) internal successors, (482), 359 states have internal predecessors, (482), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:44:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 530 transitions. [2025-01-09 15:44:49,483 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 530 transitions. Word has length 90 [2025-01-09 15:44:49,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:49,483 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 530 transitions. [2025-01-09 15:44:49,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:49,484 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 530 transitions. [2025-01-09 15:44:49,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 15:44:49,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:49,485 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:49,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-01-09 15:44:49,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:49,689 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:49,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:49,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1092665624, now seen corresponding path program 1 times [2025-01-09 15:44:49,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:49,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700253880] [2025-01-09 15:44:49,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:49,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-01-09 15:44:49,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:49,693 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:44:49,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-01-09 15:44:49,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 15:44:50,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 15:44:50,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:50,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:50,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 15:44:50,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:53,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:44:53,051 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 133 treesize of output 73 [2025-01-09 15:44:53,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:44:53,208 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 203 treesize of output 83 [2025-01-09 15:44:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 15:44:53,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:44:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:44:54,634 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:54,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700253880] [2025-01-09 15:44:54,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [700253880] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:44:54,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:44:54,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2025-01-09 15:44:54,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348807398] [2025-01-09 15:44:54,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:54,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:44:54,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:54,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:44:54,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:44:54,635 INFO L87 Difference]: Start difference. First operand 393 states and 530 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:55,838 INFO L93 Difference]: Finished difference Result 764 states and 1030 transitions. [2025-01-09 15:44:55,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:44:55,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2025-01-09 15:44:55,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:55,842 INFO L225 Difference]: With dead ends: 764 [2025-01-09 15:44:55,842 INFO L226 Difference]: Without dead ends: 457 [2025-01-09 15:44:55,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:44:55,842 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 53 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:55,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 807 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:44:55,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-01-09 15:44:55,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 453. [2025-01-09 15:44:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 413 states have (on average 1.3389830508474576) internal successors, (553), 416 states have internal predecessors, (553), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 15:44:55,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 605 transitions. [2025-01-09 15:44:55,858 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 605 transitions. Word has length 90 [2025-01-09 15:44:55,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:55,858 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 605 transitions. [2025-01-09 15:44:55,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 605 transitions. [2025-01-09 15:44:55,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 15:44:55,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:55,859 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:55,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-01-09 15:44:56,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:56,060 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:56,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:56,061 INFO L85 PathProgramCache]: Analyzing trace with hash 699696017, now seen corresponding path program 1 times [2025-01-09 15:44:56,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:56,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890025814] [2025-01-09 15:44:56,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:56,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:56,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:56,063 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:44:56,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-01-09 15:44:56,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 15:44:56,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 15:44:56,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:56,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:56,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:44:56,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:56,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 15:44:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:44:56,743 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:44:56,744 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:56,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890025814] [2025-01-09 15:44:56,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890025814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:56,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:56,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:44:56,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605953866] [2025-01-09 15:44:56,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:56,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:44:56,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:56,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:44:56,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:44:56,748 INFO L87 Difference]: Start difference. First operand 453 states and 605 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:56,928 INFO L93 Difference]: Finished difference Result 869 states and 1166 transitions. [2025-01-09 15:44:56,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:44:56,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 91 [2025-01-09 15:44:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:56,936 INFO L225 Difference]: With dead ends: 869 [2025-01-09 15:44:56,936 INFO L226 Difference]: Without dead ends: 506 [2025-01-09 15:44:56,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:44:56,936 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 180 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:56,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 589 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:44:56,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-01-09 15:44:56,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 483. [2025-01-09 15:44:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 443 states have (on average 1.327313769751693) internal successors, (588), 446 states have internal predecessors, (588), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 15:44:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 640 transitions. [2025-01-09 15:44:56,970 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 640 transitions. Word has length 91 [2025-01-09 15:44:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:56,971 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 640 transitions. [2025-01-09 15:44:56,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:56,972 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 640 transitions. [2025-01-09 15:44:56,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 15:44:56,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:56,972 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:57,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-01-09 15:44:57,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:57,173 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:57,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:57,174 INFO L85 PathProgramCache]: Analyzing trace with hash 986727377, now seen corresponding path program 1 times [2025-01-09 15:44:57,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:57,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14795351] [2025-01-09 15:44:57,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:57,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:57,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:57,176 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:44:57,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-01-09 15:44:57,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 15:44:57,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 15:44:57,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:57,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:57,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:44:57,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:44:57,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:44:57,688 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:57,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14795351] [2025-01-09 15:44:57,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [14795351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:57,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:57,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:44:57,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416992582] [2025-01-09 15:44:57,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:57,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:44:57,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:57,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:44:57,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:44:57,689 INFO L87 Difference]: Start difference. First operand 483 states and 640 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:57,778 INFO L93 Difference]: Finished difference Result 892 states and 1188 transitions. [2025-01-09 15:44:57,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:44:57,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 91 [2025-01-09 15:44:57,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:57,780 INFO L225 Difference]: With dead ends: 892 [2025-01-09 15:44:57,780 INFO L226 Difference]: Without dead ends: 499 [2025-01-09 15:44:57,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:44:57,781 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:57,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 635 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:44:57,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-01-09 15:44:57,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 496. [2025-01-09 15:44:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 456 states have (on average 1.3179824561403508) internal successors, (601), 459 states have internal predecessors, (601), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 15:44:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 653 transitions. [2025-01-09 15:44:57,794 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 653 transitions. Word has length 91 [2025-01-09 15:44:57,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:57,794 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 653 transitions. [2025-01-09 15:44:57,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:44:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 653 transitions. [2025-01-09 15:44:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 15:44:57,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:57,795 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:57,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-01-09 15:44:57,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:57,999 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:57,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:58,000 INFO L85 PathProgramCache]: Analyzing trace with hash 867040921, now seen corresponding path program 1 times [2025-01-09 15:44:58,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:58,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579463007] [2025-01-09 15:44:58,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:58,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:44:58,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:58,005 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:44:58,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-01-09 15:44:58,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 15:44:58,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 15:44:58,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:58,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:58,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 15:44:58,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:58,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 15:44:58,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2025-01-09 15:44:58,985 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 53 treesize of output 33 [2025-01-09 15:44:59,067 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:44:59,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:44:59,067 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:59,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579463007] [2025-01-09 15:44:59,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579463007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:59,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:59,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:44:59,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701091113] [2025-01-09 15:44:59,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:59,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:44:59,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:59,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:44:59,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:44:59,068 INFO L87 Difference]: Start difference. First operand 496 states and 653 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:45:03,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:45:07,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:45:10,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:45:14,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:45:17,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:45:19,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:45:23,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []