./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.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 60e0d367a188d63fa8b46fcc4be9e9d24b19690e82d361011ef9ebf2c61f53ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:25:19,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:25:19,925 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:25:19,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:25:19,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:25:19,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:25:19,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:25:19,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:25:19,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:25:19,956 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:25:19,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:25:19,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:25:19,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:25:19,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:25:19,957 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:25:19,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:25:19,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:25:19,958 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:25:19,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:25:19,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:25:19,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:25:19,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:25:19,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:25:19,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:25:19,958 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:25:19,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:25:19,958 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:25:19,958 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:25:19,959 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:25:19,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:25:19,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:25:19,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:25:19,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:25:19,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:25:19,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:25:19,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:25:19,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:25:19,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:25:19,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:25:19,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:25:19,960 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:25:19,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:25:19,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:25:19,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:25:19,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:25:19,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:25:19,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:25:19,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:25:19,961 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 -> 60e0d367a188d63fa8b46fcc4be9e9d24b19690e82d361011ef9ebf2c61f53ca [2025-01-09 15:25:20,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:25:20,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:25:20,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:25:20,171 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:25:20,171 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:25:20,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i [2025-01-09 15:25:21,278 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3536e4d09/82bd584009e6426fa102dc95945948ab/FLAGfb482c787 [2025-01-09 15:25:21,485 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:25:21,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i [2025-01-09 15:25:21,492 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3536e4d09/82bd584009e6426fa102dc95945948ab/FLAGfb482c787 [2025-01-09 15:25:21,831 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3536e4d09/82bd584009e6426fa102dc95945948ab [2025-01-09 15:25:21,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:25:21,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:25:21,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:25:21,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:25:21,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:25:21,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:25:21" (1/1) ... [2025-01-09 15:25:21,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@814bc58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:21, skipping insertion in model container [2025-01-09 15:25:21,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:25:21" (1/1) ... [2025-01-09 15:25:21,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:25:21,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i[916,929] [2025-01-09 15:25:21,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:25:22,007 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:25:22,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i[916,929] [2025-01-09 15:25:22,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:25:22,071 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:25:22,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:22 WrapperNode [2025-01-09 15:25:22,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:25:22,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:25:22,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:25:22,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:25:22,077 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:25:22" (1/1) ... [2025-01-09 15:25:22,085 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:25:22" (1/1) ... [2025-01-09 15:25:22,114 INFO L138 Inliner]: procedures = 29, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 406 [2025-01-09 15:25:22,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:25:22,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:25:22,115 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:25:22,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:25:22,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:22" (1/1) ... [2025-01-09 15:25:22,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:22" (1/1) ... [2025-01-09 15:25:22,128 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:22" (1/1) ... [2025-01-09 15:25:22,150 INFO L175 MemorySlicer]: Split 106 memory accesses to 7 slices as follows [2, 6, 3, 13, 17, 30, 35]. 33 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 2, 2, 3, 3]. The 16 writes are split as follows [0, 1, 1, 2, 5, 3, 4]. [2025-01-09 15:25:22,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:22" (1/1) ... [2025-01-09 15:25:22,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:22" (1/1) ... [2025-01-09 15:25:22,173 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:22" (1/1) ... [2025-01-09 15:25:22,174 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:22" (1/1) ... [2025-01-09 15:25:22,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:22" (1/1) ... [2025-01-09 15:25:22,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:22" (1/1) ... [2025-01-09 15:25:22,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:22" (1/1) ... [2025-01-09 15:25:22,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:25:22,194 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:25:22,194 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:25:22,194 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:25:22,195 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:22" (1/1) ... [2025-01-09 15:25:22,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:25:22,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:25:22,239 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:25:22,249 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:25:22,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:25:22,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:25:22,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:25:22,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:25:22,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:25:22,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:25:22,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:25:22,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-01-09 15:25:22,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:25:22,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:25:22,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:25:22,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:25:22,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:25:22,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:25:22,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:25:22,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:25:22,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:25:22,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:25:22,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:25:22,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:25:22,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:25:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-01-09 15:25:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:25:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:25:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:25:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:25:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:25:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:25:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:25:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:25:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:25:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:25:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:25:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:25:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:25:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-01-09 15:25:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:25:22,273 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:25:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:25:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:25:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:25:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:25:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:25:22,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:25:22,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:25:22,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:25:22,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:25:22,397 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:25:22,399 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:25:22,769 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-01-09 15:25:22,770 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:25:22,778 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:25:22,778 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:25:22,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:25:22 BoogieIcfgContainer [2025-01-09 15:25:22,779 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:25:22,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:25:22,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:25:22,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:25:22,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:25:21" (1/3) ... [2025-01-09 15:25:22,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ec76f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:25:22, skipping insertion in model container [2025-01-09 15:25:22,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:22" (2/3) ... [2025-01-09 15:25:22,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ec76f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:25:22, skipping insertion in model container [2025-01-09 15:25:22,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:25:22" (3/3) ... [2025-01-09 15:25:22,785 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-67.i [2025-01-09 15:25:22,794 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:25:22,797 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-67.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:25:22,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:25:22,851 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;@7e155a35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:25:22,851 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:25:22,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 78 states have internal predecessors, (107), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:22,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:25:22,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:22,861 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:22,862 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:22,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:22,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1000440832, now seen corresponding path program 1 times [2025-01-09 15:25:22,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:22,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085193985] [2025-01-09 15:25:22,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:22,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:22,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:25:22,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:25:22,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:22,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:23,128 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 15:25:23,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:23,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085193985] [2025-01-09 15:25:23,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085193985] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:25:23,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479333484] [2025-01-09 15:25:23,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:23,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:25:23,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:25:23,132 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:25:23,134 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:25:23,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:25:23,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:25:23,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:23,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:23,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:25:23,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 15:25:23,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:23,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479333484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:23,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:25:23,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:25:23,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489135480] [2025-01-09 15:25:23,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:23,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:25:23,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:23,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:25:23,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:25:23,352 INFO L87 Difference]: Start difference. First operand has 92 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 78 states have internal predecessors, (107), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:23,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:23,367 INFO L93 Difference]: Finished difference Result 178 states and 269 transitions. [2025-01-09 15:25:23,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:25:23,368 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2025-01-09 15:25:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:23,372 INFO L225 Difference]: With dead ends: 178 [2025-01-09 15:25:23,372 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 15:25:23,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 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:25:23,375 INFO L435 NwaCegarLoop]: 126 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, 126 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:25:23,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 15:25:23,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 15:25:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:23,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2025-01-09 15:25:23,405 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 104 [2025-01-09 15:25:23,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:23,405 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2025-01-09 15:25:23,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:23,406 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2025-01-09 15:25:23,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:25:23,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:23,409 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:23,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:25:23,610 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:25:23,610 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:23,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:23,610 INFO L85 PathProgramCache]: Analyzing trace with hash -221387664, now seen corresponding path program 1 times [2025-01-09 15:25:23,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:23,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093971086] [2025-01-09 15:25:23,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:23,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:23,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:25:23,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:25:23,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:23,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:23,808 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:23,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:23,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093971086] [2025-01-09 15:25:23,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093971086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:23,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:23,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:25:23,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016456568] [2025-01-09 15:25:23,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:23,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:25:23,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:23,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:25:23,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:25:23,810 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:23,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:23,842 INFO L93 Difference]: Finished difference Result 225 states and 321 transitions. [2025-01-09 15:25:23,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:25:23,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-01-09 15:25:23,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:23,845 INFO L225 Difference]: With dead ends: 225 [2025-01-09 15:25:23,845 INFO L226 Difference]: Without dead ends: 139 [2025-01-09 15:25:23,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:25:23,846 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 65 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:23,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 243 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:23,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-09 15:25:23,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 105. [2025-01-09 15:25:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2025-01-09 15:25:23,861 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 104 [2025-01-09 15:25:23,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:23,862 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2025-01-09 15:25:23,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2025-01-09 15:25:23,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:25:23,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:23,865 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:23,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:25:23,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:23,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:23,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1058476014, now seen corresponding path program 1 times [2025-01-09 15:25:23,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:23,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734526451] [2025-01-09 15:25:23,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:23,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:23,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:25:23,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:25:23,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:23,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:24,092 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:24,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:24,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734526451] [2025-01-09 15:25:24,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734526451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:24,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:24,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:25:24,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822996] [2025-01-09 15:25:24,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:24,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:25:24,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:24,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:25:24,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:25:24,096 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:24,130 INFO L93 Difference]: Finished difference Result 210 states and 301 transitions. [2025-01-09 15:25:24,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:25:24,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-01-09 15:25:24,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:24,131 INFO L225 Difference]: With dead ends: 210 [2025-01-09 15:25:24,131 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 15:25:24,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:25:24,132 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:24,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 358 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:24,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 15:25:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-01-09 15:25:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:24,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2025-01-09 15:25:24,142 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 104 [2025-01-09 15:25:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:24,143 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2025-01-09 15:25:24,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2025-01-09 15:25:24,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:25:24,144 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:24,144 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:24,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:25:24,144 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:24,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:24,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1738534384, now seen corresponding path program 1 times [2025-01-09 15:25:24,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:24,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334942997] [2025-01-09 15:25:24,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:24,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:24,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:25:24,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:25:24,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:24,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:24,269 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:24,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:24,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334942997] [2025-01-09 15:25:24,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334942997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:24,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:24,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:25:24,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516625682] [2025-01-09 15:25:24,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:24,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:25:24,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:24,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:25:24,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:25:24,271 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:24,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:24,299 INFO L93 Difference]: Finished difference Result 214 states and 305 transitions. [2025-01-09 15:25:24,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:25:24,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-01-09 15:25:24,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:24,301 INFO L225 Difference]: With dead ends: 214 [2025-01-09 15:25:24,301 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 15:25:24,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:25:24,302 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:24,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 359 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 15:25:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-01-09 15:25:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2025-01-09 15:25:24,310 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 104 [2025-01-09 15:25:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:24,313 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2025-01-09 15:25:24,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:24,314 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2025-01-09 15:25:24,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:25:24,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:24,314 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:24,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:25:24,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:24,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:24,315 INFO L85 PathProgramCache]: Analyzing trace with hash -781425550, now seen corresponding path program 1 times [2025-01-09 15:25:24,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:24,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921211333] [2025-01-09 15:25:24,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:24,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:24,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:25:24,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:25:24,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:24,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:24,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:24,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921211333] [2025-01-09 15:25:24,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921211333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:24,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:24,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:25:24,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341986192] [2025-01-09 15:25:24,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:24,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:25:24,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:24,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:25:24,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:25:24,427 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:24,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:24,447 INFO L93 Difference]: Finished difference Result 218 states and 309 transitions. [2025-01-09 15:25:24,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:25:24,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-01-09 15:25:24,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:24,450 INFO L225 Difference]: With dead ends: 218 [2025-01-09 15:25:24,450 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 15:25:24,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:25:24,452 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:24,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 361 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:24,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 15:25:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-01-09 15:25:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 156 transitions. [2025-01-09 15:25:24,464 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 156 transitions. Word has length 104 [2025-01-09 15:25:24,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:24,465 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 156 transitions. [2025-01-09 15:25:24,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:24,465 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2025-01-09 15:25:24,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:25:24,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:24,467 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:24,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:25:24,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:24,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:24,468 INFO L85 PathProgramCache]: Analyzing trace with hash -779578508, now seen corresponding path program 1 times [2025-01-09 15:25:24,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:24,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398529720] [2025-01-09 15:25:24,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:24,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:24,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:25:24,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:25:24,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:24,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 15:25:26,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:26,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398529720] [2025-01-09 15:25:26,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398529720] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:25:26,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519177938] [2025-01-09 15:25:26,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:26,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:25:26,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:25:26,859 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:25:26,860 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:25:26,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:25:27,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:25:27,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:27,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:27,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 15:25:27,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:27,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2025-01-09 15:25:27,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:27,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 73 [2025-01-09 15:25:27,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:27,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 278 treesize of output 116 [2025-01-09 15:25:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 150 proven. 24 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 15:25:27,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:25:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:28,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519177938] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:25:28,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:25:28,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 17] total 29 [2025-01-09 15:25:28,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540268285] [2025-01-09 15:25:28,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:28,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:25:28,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:28,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:25:28,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2025-01-09 15:25:28,354 INFO L87 Difference]: Start difference. First operand 111 states and 156 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:28,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:28,623 INFO L93 Difference]: Finished difference Result 306 states and 426 transitions. [2025-01-09 15:25:28,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:25:28,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-01-09 15:25:28,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:28,625 INFO L225 Difference]: With dead ends: 306 [2025-01-09 15:25:28,625 INFO L226 Difference]: Without dead ends: 198 [2025-01-09 15:25:28,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2025-01-09 15:25:28,626 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 126 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:28,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 877 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:25:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-01-09 15:25:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 172. [2025-01-09 15:25:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 152 states have internal predecessors, (202), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:25:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 238 transitions. [2025-01-09 15:25:28,636 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 238 transitions. Word has length 104 [2025-01-09 15:25:28,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:28,636 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 238 transitions. [2025-01-09 15:25:28,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 238 transitions. [2025-01-09 15:25:28,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:25:28,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:28,637 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:28,649 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:25:28,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:25:28,838 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:28,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:28,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1709950454, now seen corresponding path program 1 times [2025-01-09 15:25:28,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:28,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205138439] [2025-01-09 15:25:28,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:28,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:28,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:25:28,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:25:28,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:28,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:28,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:28,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205138439] [2025-01-09 15:25:28,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205138439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:28,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:28,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:25:28,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068848547] [2025-01-09 15:25:28,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:28,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:25:28,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:28,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:25:28,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:25:28,896 INFO L87 Difference]: Start difference. First operand 172 states and 238 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:28,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:28,919 INFO L93 Difference]: Finished difference Result 341 states and 471 transitions. [2025-01-09 15:25:28,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:25:28,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-01-09 15:25:28,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:28,923 INFO L225 Difference]: With dead ends: 341 [2025-01-09 15:25:28,923 INFO L226 Difference]: Without dead ends: 172 [2025-01-09 15:25:28,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:25:28,925 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 62 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:28,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 312 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:28,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-09 15:25:28,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2025-01-09 15:25:28,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 149 states have (on average 1.3288590604026846) internal successors, (198), 150 states have internal predecessors, (198), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:25:28,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 234 transitions. [2025-01-09 15:25:28,951 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 234 transitions. Word has length 104 [2025-01-09 15:25:28,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:28,951 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 234 transitions. [2025-01-09 15:25:28,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:28,952 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 234 transitions. [2025-01-09 15:25:28,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:25:28,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:28,952 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:28,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:25:28,956 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:28,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1074664573, now seen corresponding path program 1 times [2025-01-09 15:25:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:28,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599224948] [2025-01-09 15:25:28,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:28,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:28,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:25:29,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:25:29,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:29,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:29,437 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:29,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:29,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599224948] [2025-01-09 15:25:29,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599224948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:29,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:29,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:25:29,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250976188] [2025-01-09 15:25:29,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:29,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:25:29,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:29,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:25:29,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:29,439 INFO L87 Difference]: Start difference. First operand 170 states and 234 transitions. Second operand has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:29,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:29,619 INFO L93 Difference]: Finished difference Result 492 states and 677 transitions. [2025-01-09 15:25:29,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:25:29,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2025-01-09 15:25:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:29,621 INFO L225 Difference]: With dead ends: 492 [2025-01-09 15:25:29,621 INFO L226 Difference]: Without dead ends: 325 [2025-01-09 15:25:29,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:25:29,622 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 97 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:29,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 836 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-01-09 15:25:29,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 322. [2025-01-09 15:25:29,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 283 states have (on average 1.3215547703180213) internal successors, (374), 286 states have internal predecessors, (374), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:25:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 442 transitions. [2025-01-09 15:25:29,642 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 442 transitions. Word has length 108 [2025-01-09 15:25:29,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:29,642 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 442 transitions. [2025-01-09 15:25:29,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:29,642 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 442 transitions. [2025-01-09 15:25:29,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:25:29,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:29,643 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:29,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:25:29,643 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:29,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:29,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2055721256, now seen corresponding path program 1 times [2025-01-09 15:25:29,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:29,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538445076] [2025-01-09 15:25:29,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:29,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:29,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:25:29,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:25:29,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:29,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:29,810 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:29,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:29,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538445076] [2025-01-09 15:25:29,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538445076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:29,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:29,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:25:29,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911177529] [2025-01-09 15:25:29,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:29,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:25:29,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:29,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:25:29,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:25:29,812 INFO L87 Difference]: Start difference. First operand 322 states and 442 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:30,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:30,064 INFO L93 Difference]: Finished difference Result 796 states and 1095 transitions. [2025-01-09 15:25:30,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:25:30,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-01-09 15:25:30,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:30,067 INFO L225 Difference]: With dead ends: 796 [2025-01-09 15:25:30,067 INFO L226 Difference]: Without dead ends: 477 [2025-01-09 15:25:30,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:25:30,068 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 98 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:30,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 910 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:25:30,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-01-09 15:25:30,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 474. [2025-01-09 15:25:30,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 419 states have (on average 1.3269689737470167) internal successors, (556), 424 states have internal predecessors, (556), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 43 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 15:25:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 652 transitions. [2025-01-09 15:25:30,086 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 652 transitions. Word has length 110 [2025-01-09 15:25:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:30,087 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 652 transitions. [2025-01-09 15:25:30,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 652 transitions. [2025-01-09 15:25:30,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:25:30,088 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:30,088 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:30,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:25:30,088 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:30,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:30,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1506674600, now seen corresponding path program 1 times [2025-01-09 15:25:30,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:30,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734470188] [2025-01-09 15:25:30,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:30,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:30,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:25:30,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:25:30,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:30,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:30,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:30,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734470188] [2025-01-09 15:25:30,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734470188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:30,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:30,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:25:30,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549540446] [2025-01-09 15:25:30,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:30,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:25:30,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:30,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:25:30,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:25:30,243 INFO L87 Difference]: Start difference. First operand 474 states and 652 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:30,487 INFO L93 Difference]: Finished difference Result 1082 states and 1487 transitions. [2025-01-09 15:25:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:25:30,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-01-09 15:25:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:30,490 INFO L225 Difference]: With dead ends: 1082 [2025-01-09 15:25:30,491 INFO L226 Difference]: Without dead ends: 611 [2025-01-09 15:25:30,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:25:30,495 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 88 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:30,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 885 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:25:30,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-01-09 15:25:30,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 608. [2025-01-09 15:25:30,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 537 states have (on average 1.3221601489757915) internal successors, (710), 544 states have internal predecessors, (710), 62 states have call successors, (62), 8 states have call predecessors, (62), 8 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 15:25:30,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 834 transitions. [2025-01-09 15:25:30,523 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 834 transitions. Word has length 110 [2025-01-09 15:25:30,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:30,524 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 834 transitions. [2025-01-09 15:25:30,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:30,524 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 834 transitions. [2025-01-09 15:25:30,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 15:25:30,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:30,526 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:30,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:25:30,526 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:30,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:30,527 INFO L85 PathProgramCache]: Analyzing trace with hash 993437572, now seen corresponding path program 1 times [2025-01-09 15:25:30,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:30,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800059526] [2025-01-09 15:25:30,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:30,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:30,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:25:30,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:25:30,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:30,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:30,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:30,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800059526] [2025-01-09 15:25:30,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800059526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:30,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:30,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:25:30,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608400809] [2025-01-09 15:25:30,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:30,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:25:30,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:30,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:25:30,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:25:30,635 INFO L87 Difference]: Start difference. First operand 608 states and 834 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:30,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:30,766 INFO L93 Difference]: Finished difference Result 1238 states and 1693 transitions. [2025-01-09 15:25:30,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:25:30,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-01-09 15:25:30,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:30,771 INFO L225 Difference]: With dead ends: 1238 [2025-01-09 15:25:30,773 INFO L226 Difference]: Without dead ends: 633 [2025-01-09 15:25:30,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:30,776 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 85 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:30,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 543 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:30,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-01-09 15:25:30,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 496. [2025-01-09 15:25:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 437 states have (on average 1.322654462242563) internal successors, (578), 442 states have internal predecessors, (578), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 15:25:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 678 transitions. [2025-01-09 15:25:30,812 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 678 transitions. Word has length 111 [2025-01-09 15:25:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:30,813 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 678 transitions. [2025-01-09 15:25:30,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 678 transitions. [2025-01-09 15:25:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 15:25:30,815 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:30,815 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:30,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:25:30,815 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:30,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:30,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1257688827, now seen corresponding path program 1 times [2025-01-09 15:25:30,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:30,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722742061] [2025-01-09 15:25:30,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:30,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:30,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:25:30,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:25:30,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:30,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:30,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:30,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722742061] [2025-01-09 15:25:30,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722742061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:30,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:30,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:25:30,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780821231] [2025-01-09 15:25:30,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:30,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:25:30,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:30,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:25:30,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:25:30,944 INFO L87 Difference]: Start difference. First operand 496 states and 678 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:31,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:31,087 INFO L93 Difference]: Finished difference Result 1022 states and 1391 transitions. [2025-01-09 15:25:31,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:25:31,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-01-09 15:25:31,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:31,090 INFO L225 Difference]: With dead ends: 1022 [2025-01-09 15:25:31,090 INFO L226 Difference]: Without dead ends: 529 [2025-01-09 15:25:31,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:31,092 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 88 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:31,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 569 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:31,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-01-09 15:25:31,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 383. [2025-01-09 15:25:31,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 336 states have (on average 1.318452380952381) internal successors, (443), 339 states have internal predecessors, (443), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:25:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 519 transitions. [2025-01-09 15:25:31,109 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 519 transitions. Word has length 111 [2025-01-09 15:25:31,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:31,109 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 519 transitions. [2025-01-09 15:25:31,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 519 transitions. [2025-01-09 15:25:31,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:25:31,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:31,110 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:31,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:25:31,111 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:31,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:31,111 INFO L85 PathProgramCache]: Analyzing trace with hash -964618227, now seen corresponding path program 1 times [2025-01-09 15:25:31,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:31,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383167162] [2025-01-09 15:25:31,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:31,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:31,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:25:31,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:25:31,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:31,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:31,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:31,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383167162] [2025-01-09 15:25:31,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383167162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:31,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:31,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:25:31,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64557635] [2025-01-09 15:25:31,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:31,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:25:31,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:31,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:25:31,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:25:31,603 INFO L87 Difference]: Start difference. First operand 383 states and 519 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:31,911 INFO L93 Difference]: Finished difference Result 955 states and 1291 transitions. [2025-01-09 15:25:31,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:25:31,912 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2025-01-09 15:25:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:31,914 INFO L225 Difference]: With dead ends: 955 [2025-01-09 15:25:31,914 INFO L226 Difference]: Without dead ends: 575 [2025-01-09 15:25:31,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:25:31,916 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 97 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:31,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1338 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:25:31,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-01-09 15:25:31,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 448. [2025-01-09 15:25:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 401 states have (on average 1.3266832917705735) internal successors, (532), 404 states have internal predecessors, (532), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:25:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 608 transitions. [2025-01-09 15:25:31,942 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 608 transitions. Word has length 112 [2025-01-09 15:25:31,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:31,943 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 608 transitions. [2025-01-09 15:25:31,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 608 transitions. [2025-01-09 15:25:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:25:31,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:31,944 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:31,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:25:31,944 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:31,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:31,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2050485391, now seen corresponding path program 1 times [2025-01-09 15:25:31,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:31,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782741638] [2025-01-09 15:25:31,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:31,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:31,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:25:31,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:25:31,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:31,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:32,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:32,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782741638] [2025-01-09 15:25:32,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782741638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:32,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:32,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:25:32,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336468410] [2025-01-09 15:25:32,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:32,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:25:32,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:32,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:25:32,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:32,207 INFO L87 Difference]: Start difference. First operand 448 states and 608 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:32,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:32,385 INFO L93 Difference]: Finished difference Result 1051 states and 1418 transitions. [2025-01-09 15:25:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:25:32,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2025-01-09 15:25:32,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:32,389 INFO L225 Difference]: With dead ends: 1051 [2025-01-09 15:25:32,391 INFO L226 Difference]: Without dead ends: 606 [2025-01-09 15:25:32,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:32,392 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 95 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:32,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 640 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:32,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-01-09 15:25:32,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 480. [2025-01-09 15:25:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 420 states have (on average 1.311904761904762) internal successors, (551), 424 states have internal predecessors, (551), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 15:25:32,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 647 transitions. [2025-01-09 15:25:32,420 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 647 transitions. Word has length 112 [2025-01-09 15:25:32,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:32,421 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 647 transitions. [2025-01-09 15:25:32,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 647 transitions. [2025-01-09 15:25:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:25:32,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:32,422 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:32,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:25:32,422 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:32,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:32,423 INFO L85 PathProgramCache]: Analyzing trace with hash 958609807, now seen corresponding path program 1 times [2025-01-09 15:25:32,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:32,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168047913] [2025-01-09 15:25:32,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:32,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:32,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:25:32,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:25:32,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:32,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:32,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:32,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168047913] [2025-01-09 15:25:32,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168047913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:32,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:32,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:25:32,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695405440] [2025-01-09 15:25:32,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:32,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:25:32,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:32,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:25:32,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:32,650 INFO L87 Difference]: Start difference. First operand 480 states and 647 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:32,835 INFO L93 Difference]: Finished difference Result 926 states and 1248 transitions. [2025-01-09 15:25:32,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:25:32,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2025-01-09 15:25:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:32,838 INFO L225 Difference]: With dead ends: 926 [2025-01-09 15:25:32,838 INFO L226 Difference]: Without dead ends: 487 [2025-01-09 15:25:32,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:32,839 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 93 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:32,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 764 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:32,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-01-09 15:25:32,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 366. [2025-01-09 15:25:32,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 327 states have (on average 1.3180428134556574) internal successors, (431), 329 states have internal predecessors, (431), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:25:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 491 transitions. [2025-01-09 15:25:32,857 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 491 transitions. Word has length 112 [2025-01-09 15:25:32,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:32,857 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 491 transitions. [2025-01-09 15:25:32,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:32,857 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 491 transitions. [2025-01-09 15:25:32,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:25:32,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:32,858 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:32,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:25:32,859 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:32,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:32,859 INFO L85 PathProgramCache]: Analyzing trace with hash -321253871, now seen corresponding path program 1 times [2025-01-09 15:25:32,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:32,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107873192] [2025-01-09 15:25:32,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:32,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:32,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:25:32,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:25:32,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:32,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:33,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:33,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107873192] [2025-01-09 15:25:33,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107873192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:33,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:33,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:25:33,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580297172] [2025-01-09 15:25:33,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:33,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:25:33,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:33,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:25:33,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:25:33,125 INFO L87 Difference]: Start difference. First operand 366 states and 491 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:33,348 INFO L93 Difference]: Finished difference Result 845 states and 1136 transitions. [2025-01-09 15:25:33,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:25:33,348 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2025-01-09 15:25:33,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:33,351 INFO L225 Difference]: With dead ends: 845 [2025-01-09 15:25:33,351 INFO L226 Difference]: Without dead ends: 520 [2025-01-09 15:25:33,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:25:33,352 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 113 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:33,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1565 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:25:33,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-01-09 15:25:33,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 360. [2025-01-09 15:25:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 321 states have (on average 1.320872274143302) internal successors, (424), 323 states have internal predecessors, (424), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:25:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 484 transitions. [2025-01-09 15:25:33,374 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 484 transitions. Word has length 112 [2025-01-09 15:25:33,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:33,374 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 484 transitions. [2025-01-09 15:25:33,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 484 transitions. [2025-01-09 15:25:33,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:25:33,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:33,376 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:33,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:25:33,376 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:33,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:33,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1197383852, now seen corresponding path program 1 times [2025-01-09 15:25:33,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:33,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123989364] [2025-01-09 15:25:33,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:33,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:33,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:25:33,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:25:33,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:33,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:33,627 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:33,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:33,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123989364] [2025-01-09 15:25:33,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123989364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:33,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:33,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:25:33,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513351930] [2025-01-09 15:25:33,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:33,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:25:33,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:33,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:25:33,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:33,629 INFO L87 Difference]: Start difference. First operand 360 states and 484 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:33,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:33,686 INFO L93 Difference]: Finished difference Result 805 states and 1063 transitions. [2025-01-09 15:25:33,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:25:33,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2025-01-09 15:25:33,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:33,689 INFO L225 Difference]: With dead ends: 805 [2025-01-09 15:25:33,689 INFO L226 Difference]: Without dead ends: 486 [2025-01-09 15:25:33,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:33,690 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 44 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:33,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 561 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-01-09 15:25:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 436. [2025-01-09 15:25:33,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 397 states have (on average 1.2720403022670026) internal successors, (505), 399 states have internal predecessors, (505), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:25:33,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 565 transitions. [2025-01-09 15:25:33,709 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 565 transitions. Word has length 112 [2025-01-09 15:25:33,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:33,709 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 565 transitions. [2025-01-09 15:25:33,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:33,709 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 565 transitions. [2025-01-09 15:25:33,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:25:33,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:33,710 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:33,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:25:33,710 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:33,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:33,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1523649523, now seen corresponding path program 1 times [2025-01-09 15:25:33,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:33,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886568016] [2025-01-09 15:25:33,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:33,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:33,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:25:33,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:25:33,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:33,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:34,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:34,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886568016] [2025-01-09 15:25:34,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886568016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:34,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:34,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:25:34,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845227281] [2025-01-09 15:25:34,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:34,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:25:34,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:34,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:25:34,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:34,178 INFO L87 Difference]: Start difference. First operand 436 states and 565 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:34,392 INFO L93 Difference]: Finished difference Result 445 states and 575 transitions. [2025-01-09 15:25:34,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:25:34,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2025-01-09 15:25:34,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:34,394 INFO L225 Difference]: With dead ends: 445 [2025-01-09 15:25:34,395 INFO L226 Difference]: Without dead ends: 443 [2025-01-09 15:25:34,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:25:34,395 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 84 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:34,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 748 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:34,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-01-09 15:25:34,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 442. [2025-01-09 15:25:34,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 403 states have (on average 1.2679900744416874) internal successors, (511), 405 states have internal predecessors, (511), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:25:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 571 transitions. [2025-01-09 15:25:34,416 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 571 transitions. Word has length 112 [2025-01-09 15:25:34,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:34,416 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 571 transitions. [2025-01-09 15:25:34,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 571 transitions. [2025-01-09 15:25:34,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:25:34,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:34,417 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:34,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:25:34,417 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:34,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:34,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1521802481, now seen corresponding path program 1 times [2025-01-09 15:25:34,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:34,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077116418] [2025-01-09 15:25:34,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:34,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:34,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:25:34,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:25:34,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:34,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:25:34,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1161772387] [2025-01-09 15:25:34,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:34,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:25:34,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:25:34,472 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:25:34,474 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:25:34,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:25:34,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:25:34,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:34,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:25:34,733 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:25:34,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:25:34,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:25:34,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:34,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:25:34,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:25:34,999 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:25:35,000 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:25:35,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 15:25:35,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:25:35,204 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:35,272 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:25:35,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:25:35 BoogieIcfgContainer [2025-01-09 15:25:35,276 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:25:35,276 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:25:35,276 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:25:35,276 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:25:35,278 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:25:22" (3/4) ... [2025-01-09 15:25:35,279 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:25:35,280 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:25:35,280 INFO L158 Benchmark]: Toolchain (without parser) took 13446.74ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 113.1MB in the beginning and 283.5MB in the end (delta: -170.4MB). Peak memory consumption was 109.6MB. Max. memory is 16.1GB. [2025-01-09 15:25:35,280 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:25:35,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.83ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 98.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:25:35,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.76ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 95.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:25:35,281 INFO L158 Benchmark]: Boogie Preprocessor took 79.07ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 91.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:25:35,281 INFO L158 Benchmark]: RCFGBuilder took 584.34ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 61.7MB in the end (delta: 29.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:25:35,281 INFO L158 Benchmark]: TraceAbstraction took 12495.86ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 61.2MB in the beginning and 283.6MB in the end (delta: -222.4MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2025-01-09 15:25:35,281 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 419.4MB. Free memory was 283.6MB in the beginning and 283.5MB in the end (delta: 87.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:25:35,282 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.21ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.83ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 98.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.76ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 95.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 79.07ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 91.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 584.34ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 61.7MB in the end (delta: 29.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12495.86ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 61.2MB in the beginning and 283.6MB in the end (delta: -222.4MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 419.4MB. Free memory was 283.6MB in the beginning and 283.5MB in the end (delta: 87.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[1] = { 25.875 }; [L25-L27] double double_Array_0[1] = { 25.875 }; [L28-L30] float float_Array_0[2] = { 0.9, 15.125 }; [L28-L30] float float_Array_0[2] = { 0.9, 15.125 }; [L28-L30] float float_Array_0[2] = { 0.9, 15.125 }; [L31-L33] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L31-L33] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L31-L33] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L34-L36] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L34-L36] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L34-L36] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L34-L36] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L40] signed long int last_1_signed_long_int_Array_0_1_ = 50; [L41] signed short int last_1_signed_short_int_Array_0_2_ = 2; [L42] unsigned short int last_1_unsigned_short_int_Array_0_2_ = 128; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L104] isInitial = 1 [L105] FCALL initially() [L107] CALL updateLastVariables() [L95] EXPR signed_long_int_Array_0[1] [L95] last_1_signed_long_int_Array_0_1_ = signed_long_int_Array_0[1] [L96] EXPR signed_short_int_Array_0[2] [L96] last_1_signed_short_int_Array_0_2_ = signed_short_int_Array_0[2] [L97] EXPR unsigned_short_int_Array_0[2] [L97] last_1_unsigned_short_int_Array_0_2_ = unsigned_short_int_Array_0[2] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] float_Array_0[0] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[0] [L79] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L79] EXPR float_Array_0[0] [L79] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L81] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L85] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L88] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L108] RET updateVariables() [L109] CALL step() [L46] COND TRUE ! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_) [L47] EXPR signed_short_int_Array_0[1] [L47] EXPR signed_short_int_Array_0[0] [L47] signed_short_int_Array_0[2] = (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]) [L49] EXPR signed_short_int_Array_0[1] [L49] signed long int stepLocal_0 = 1 * signed_short_int_Array_0[1]; [L50] EXPR signed_short_int_Array_0[2] [L50] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L50] EXPR signed_short_int_Array_0[2] >> signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=51, unsigned_short_int_Array_0={9:0}] [L50] COND FALSE !((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > stepLocal_0) [L53] EXPR unsigned_short_int_Array_0[0] [L53] unsigned_short_int_Array_0[2] = unsigned_short_int_Array_0[0] [L55] EXPR float_Array_0[0] [L55] float_Array_0[1] = float_Array_0[0] [L56] EXPR float_Array_0[0] [L56] double_Array_0[0] = float_Array_0[0] [L57] EXPR unsigned_short_int_Array_0[0] [L57] unsigned_short_int_Array_0[1] = unsigned_short_int_Array_0[0] [L58] EXPR signed_short_int_Array_0[1] [L58] EXPR signed_long_int_Array_0[0] [L58] signed long int stepLocal_2 = signed_short_int_Array_0[1] / signed_long_int_Array_0[0]; [L59] EXPR unsigned_short_int_Array_0[0] [L59] unsigned short int stepLocal_1 = unsigned_short_int_Array_0[0]; [L60] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L60] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L63] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L63] COND FALSE !(unsigned_short_int_Array_0[1] > stepLocal_2) [L70] EXPR unsigned_short_int_Array_0[2] [L70] EXPR signed_short_int_Array_0[0] [L70] signed_long_int_Array_0[1] = (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0]) [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1 [L100] EXPR signed_short_int_Array_0[2] [L100] EXPR signed_short_int_Array_0[1] [L100] EXPR signed_short_int_Array_0[0] [L100] EXPR (! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) [L100] EXPR signed_short_int_Array_0[2] [L100] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR signed_short_int_Array_0[2] >> signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])) [L100] EXPR unsigned_short_int_Array_0[2] [L100] EXPR unsigned_short_int_Array_0[0] [L100] EXPR ((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR (((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR (((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0]))))) [L100] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))) [L100] EXPR unsigned_short_int_Array_0[1] [L100] EXPR signed_short_int_Array_0[1] [L100] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR (unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0]))) [L100] EXPR signed_long_int_Array_0[1] [L100] EXPR unsigned_short_int_Array_0[2] [L100] EXPR signed_short_int_Array_0[0] [L100] EXPR (unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR (((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0])) [L100] EXPR float_Array_0[1] [L100] EXPR float_Array_0[0] [L100] EXPR ((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR (((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR (((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0])) [L100] EXPR double_Array_0[0] [L100] EXPR float_Array_0[0] [L100] EXPR (((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100-L101] return ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 19, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1244 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1238 mSDsluCounter, 11995 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9184 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2537 IncrementalHoareTripleChecker+Invalid, 2553 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 2811 mSDtfsCounter, 2537 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 477 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=608occurred in iteration=10, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 942 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2382 NumberOfCodeBlocks, 2382 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2241 ConstructedInterpolants, 0 QuantifiedInterpolants, 9245 SizeOfPredicates, 7 NumberOfNonLiveVariables, 819 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 21 InterpolantComputations, 18 PerfectInterpolantSequences, 5492/5544 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:25:35,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.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 60e0d367a188d63fa8b46fcc4be9e9d24b19690e82d361011ef9ebf2c61f53ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:25:37,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:25:37,242 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:25:37,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:25:37,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:25:37,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:25:37,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:25:37,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:25:37,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:25:37,274 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:25:37,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:25:37,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:25:37,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:25:37,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:25:37,275 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:25:37,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:25:37,276 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:25:37,276 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:25:37,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:25:37,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:25:37,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:25:37,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:25:37,277 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:25:37,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:25:37,277 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:25:37,277 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:25:37,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:25:37,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:25:37,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:25:37,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:25:37,277 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 -> 60e0d367a188d63fa8b46fcc4be9e9d24b19690e82d361011ef9ebf2c61f53ca [2025-01-09 15:25:37,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:25:37,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:25:37,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:25:37,555 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:25:37,555 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:25:37,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i [2025-01-09 15:25:38,720 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab9e6e2b5/8d598206f120412fbc3beefad0217945/FLAGa01fffc03 [2025-01-09 15:25:38,906 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:25:38,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i [2025-01-09 15:25:38,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab9e6e2b5/8d598206f120412fbc3beefad0217945/FLAGa01fffc03 [2025-01-09 15:25:39,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab9e6e2b5/8d598206f120412fbc3beefad0217945 [2025-01-09 15:25:39,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:25:39,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:25:39,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:25:39,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:25:39,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:25:39,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:25:39" (1/1) ... [2025-01-09 15:25:39,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c5cda36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:39, skipping insertion in model container [2025-01-09 15:25:39,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:25:39" (1/1) ... [2025-01-09 15:25:39,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:25:39,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i[916,929] [2025-01-09 15:25:39,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:25:39,443 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:25:39,452 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i[916,929] [2025-01-09 15:25:39,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:25:39,497 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:25:39,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:39 WrapperNode [2025-01-09 15:25:39,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:25:39,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:25:39,500 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:25:39,500 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:25:39,505 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:25:39" (1/1) ... [2025-01-09 15:25:39,523 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:25:39" (1/1) ... [2025-01-09 15:25:39,557 INFO L138 Inliner]: procedures = 39, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 389 [2025-01-09 15:25:39,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:25:39,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:25:39,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:25:39,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:25:39,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:39" (1/1) ... [2025-01-09 15:25:39,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:39" (1/1) ... [2025-01-09 15:25:39,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:39" (1/1) ... [2025-01-09 15:25:39,606 INFO L175 MemorySlicer]: Split 106 memory accesses to 7 slices as follows [2, 6, 3, 13, 17, 30, 35]. 33 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 2, 2, 3, 3]. The 16 writes are split as follows [0, 1, 1, 2, 5, 3, 4]. [2025-01-09 15:25:39,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:39" (1/1) ... [2025-01-09 15:25:39,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:39" (1/1) ... [2025-01-09 15:25:39,622 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:39" (1/1) ... [2025-01-09 15:25:39,626 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:39" (1/1) ... [2025-01-09 15:25:39,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:39" (1/1) ... [2025-01-09 15:25:39,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:39" (1/1) ... [2025-01-09 15:25:39,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:39" (1/1) ... [2025-01-09 15:25:39,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:25:39,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:25:39,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:25:39,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:25:39,650 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:39" (1/1) ... [2025-01-09 15:25:39,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:25:39,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:25:39,676 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:25:39,682 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:25:39,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:25:39,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:25:39,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:25:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-01-09 15:25:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-01-09 15:25:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:25:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:25:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-01-09 15:25:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-01-09 15:25:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-01-09 15:25:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-01-09 15:25:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-01-09 15:25:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 15:25:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 15:25:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-01-09 15:25:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-01-09 15:25:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-01-09 15:25:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-01-09 15:25:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-01-09 15:25:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:25:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:25:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:25:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:25:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:25:39,701 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:25:39,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:25:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:25:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-01-09 15:25:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:25:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:25:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:25:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:25:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:25:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-01-09 15:25:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-01-09 15:25:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 15:25:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 15:25:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-01-09 15:25:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-01-09 15:25:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-01-09 15:25:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-01-09 15:25:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-01-09 15:25:39,828 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:25:39,830 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:25:40,375 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-01-09 15:25:40,376 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:25:40,382 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:25:40,383 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:25:40,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:25:40 BoogieIcfgContainer [2025-01-09 15:25:40,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:25:40,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:25:40,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:25:40,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:25:40,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:25:39" (1/3) ... [2025-01-09 15:25:40,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f635236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:25:40, skipping insertion in model container [2025-01-09 15:25:40,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:39" (2/3) ... [2025-01-09 15:25:40,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f635236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:25:40, skipping insertion in model container [2025-01-09 15:25:40,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:25:40" (3/3) ... [2025-01-09 15:25:40,391 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-67.i [2025-01-09 15:25:40,402 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:25:40,403 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-67.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:25:40,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:25:40,449 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;@549e45b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:25:40,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:25:40,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 73 states have internal predecessors, (100), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:40,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 15:25:40,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:40,459 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:40,459 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:40,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:40,463 INFO L85 PathProgramCache]: Analyzing trace with hash -192738940, now seen corresponding path program 1 times [2025-01-09 15:25:40,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:40,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739940529] [2025-01-09 15:25:40,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:40,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:25:40,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:40,475 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:25:40,476 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:25:40,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:25:40,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:25:40,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:40,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:40,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:25:40,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-01-09 15:25:40,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:40,774 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:40,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739940529] [2025-01-09 15:25:40,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739940529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:40,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:40,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:25:40,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649749303] [2025-01-09 15:25:40,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:40,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:25:40,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:40,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:25:40,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:25:40,795 INFO L87 Difference]: Start difference. First operand has 87 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 73 states have internal predecessors, (100), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:40,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:40,810 INFO L93 Difference]: Finished difference Result 168 states and 255 transitions. [2025-01-09 15:25:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:25:40,812 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-01-09 15:25:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:40,816 INFO L225 Difference]: With dead ends: 168 [2025-01-09 15:25:40,816 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 15:25:40,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:25:40,821 INFO L435 NwaCegarLoop]: 119 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, 119 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:25:40,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:40,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 15:25:40,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-09 15:25:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 70 states have internal predecessors, (95), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:40,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2025-01-09 15:25:40,851 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 103 [2025-01-09 15:25:40,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:40,851 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2025-01-09 15:25:40,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2025-01-09 15:25:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 15:25:40,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:40,854 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:40,862 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:25:41,058 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:25:41,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:41,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:41,059 INFO L85 PathProgramCache]: Analyzing trace with hash 525128468, now seen corresponding path program 1 times [2025-01-09 15:25:41,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:41,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82272862] [2025-01-09 15:25:41,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:41,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:25:41,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:41,061 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:25:41,063 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:25:41,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:25:41,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:25:41,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:41,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:41,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:25:41,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:41,400 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:41,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:41,400 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:41,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82272862] [2025-01-09 15:25:41,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82272862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:41,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:41,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:25:41,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482627809] [2025-01-09 15:25:41,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:41,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:25:41,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:41,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:25:41,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:41,402 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:41,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:41,508 INFO L93 Difference]: Finished difference Result 172 states and 245 transitions. [2025-01-09 15:25:41,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:25:41,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-01-09 15:25:41,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:41,510 INFO L225 Difference]: With dead ends: 172 [2025-01-09 15:25:41,510 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 15:25:41,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 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:25:41,511 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:41,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 540 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 15:25:41,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2025-01-09 15:25:41,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:41,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2025-01-09 15:25:41,517 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 103 [2025-01-09 15:25:41,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:41,518 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2025-01-09 15:25:41,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:41,518 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2025-01-09 15:25:41,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 15:25:41,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:41,520 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:41,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 15:25:41,721 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:25:41,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:41,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:41,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1994831466, now seen corresponding path program 1 times [2025-01-09 15:25:41,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:41,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373641334] [2025-01-09 15:25:41,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:41,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:25:41,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:41,724 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:25:41,725 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:25:41,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:25:41,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:25:41,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:41,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:41,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:25:41,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:42,024 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:42,024 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:42,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373641334] [2025-01-09 15:25:42,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373641334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:42,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:42,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:25:42,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145720334] [2025-01-09 15:25:42,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:42,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:25:42,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:42,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:25:42,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:42,027 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:42,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:42,179 INFO L93 Difference]: Finished difference Result 180 states and 251 transitions. [2025-01-09 15:25:42,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:25:42,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-01-09 15:25:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:42,183 INFO L225 Difference]: With dead ends: 180 [2025-01-09 15:25:42,183 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 15:25:42,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:42,186 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:42,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 641 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 15:25:42,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2025-01-09 15:25:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:42,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2025-01-09 15:25:42,200 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 103 [2025-01-09 15:25:42,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:42,200 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2025-01-09 15:25:42,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:42,200 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2025-01-09 15:25:42,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 15:25:42,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:42,201 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:42,209 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:25:42,406 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:25:42,406 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:42,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:42,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1992984424, now seen corresponding path program 1 times [2025-01-09 15:25:42,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:42,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093664513] [2025-01-09 15:25:42,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:42,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:25:42,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:42,409 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:25:42,410 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:25:42,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:25:42,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:25:42,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:42,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:42,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 15:25:42,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:42,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:25:42,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 15:25:42,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:42,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 38 [2025-01-09 15:25:43,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:43,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 52 [2025-01-09 15:25:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-01-09 15:25:43,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:43,127 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:43,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093664513] [2025-01-09 15:25:43,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093664513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:43,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:43,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:25:43,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421893587] [2025-01-09 15:25:43,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:43,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:25:43,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:43,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:25:43,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:43,130 INFO L87 Difference]: Start difference. First operand 92 states and 127 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:43,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:43,598 INFO L93 Difference]: Finished difference Result 256 states and 355 transitions. [2025-01-09 15:25:43,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:25:43,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-01-09 15:25:43,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:43,600 INFO L225 Difference]: With dead ends: 256 [2025-01-09 15:25:43,600 INFO L226 Difference]: Without dead ends: 167 [2025-01-09 15:25:43,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:25:43,601 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 229 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:43,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 494 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:25:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-01-09 15:25:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2025-01-09 15:25:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 143 states have (on average 1.3356643356643356) internal successors, (191), 144 states have internal predecessors, (191), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:25:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 227 transitions. [2025-01-09 15:25:43,616 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 227 transitions. Word has length 103 [2025-01-09 15:25:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:43,616 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 227 transitions. [2025-01-09 15:25:43,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 227 transitions. [2025-01-09 15:25:43,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 15:25:43,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:43,618 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:43,626 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:25:43,818 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:25:43,821 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:43,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:43,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1774129706, now seen corresponding path program 1 times [2025-01-09 15:25:43,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:43,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437712699] [2025-01-09 15:25:43,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:43,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:25:43,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:43,824 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:25:43,825 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:25:43,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:25:44,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:25:44,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:44,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:44,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:25:44,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:44,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-01-09 15:25:44,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-01-09 15:25:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:44,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:44,440 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:44,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437712699] [2025-01-09 15:25:44,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437712699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:44,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:44,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:25:44,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676229160] [2025-01-09 15:25:44,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:44,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:25:44,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:44,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:25:44,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:25:44,442 INFO L87 Difference]: Start difference. First operand 164 states and 227 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:44,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:44,801 INFO L93 Difference]: Finished difference Result 413 states and 573 transitions. [2025-01-09 15:25:44,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:25:44,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-01-09 15:25:44,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:44,804 INFO L225 Difference]: With dead ends: 413 [2025-01-09 15:25:44,804 INFO L226 Difference]: Without dead ends: 252 [2025-01-09 15:25:44,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 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:25:44,805 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 93 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:44,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 301 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:25:44,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-01-09 15:25:44,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 215. [2025-01-09 15:25:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 181 states have (on average 1.3204419889502763) internal successors, (239), 182 states have internal predecessors, (239), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:25:44,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 299 transitions. [2025-01-09 15:25:44,834 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 299 transitions. Word has length 103 [2025-01-09 15:25:44,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:44,835 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 299 transitions. [2025-01-09 15:25:44,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:44,835 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 299 transitions. [2025-01-09 15:25:44,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 15:25:44,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:44,836 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:44,844 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:25:45,036 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:25:45,037 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:45,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:45,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1016877142, now seen corresponding path program 1 times [2025-01-09 15:25:45,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:45,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028972506] [2025-01-09 15:25:45,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:45,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:25:45,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:45,040 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:25:45,043 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:25:45,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 15:25:45,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 15:25:45,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:45,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:45,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 15:25:45,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:45,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:25:45,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:25:46,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2025-01-09 15:25:46,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2025-01-09 15:25:46,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:46,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38 [2025-01-09 15:25:46,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2025-01-09 15:25:46,316 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 20 treesize of output 12 [2025-01-09 15:25:48,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:48,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 45 [2025-01-09 15:25:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 197 proven. 15 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 15:25:48,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:25:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:49,615 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:49,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028972506] [2025-01-09 15:25:49,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028972506] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:25:49,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:25:49,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [25] total 30 [2025-01-09 15:25:49,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900438090] [2025-01-09 15:25:49,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:49,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:25:49,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:49,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:25:49,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2025-01-09 15:25:49,617 INFO L87 Difference]: Start difference. First operand 215 states and 299 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:51,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:51,180 INFO L93 Difference]: Finished difference Result 543 states and 752 transitions. [2025-01-09 15:25:51,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:25:51,181 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-01-09 15:25:51,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:51,183 INFO L225 Difference]: With dead ends: 543 [2025-01-09 15:25:51,183 INFO L226 Difference]: Without dead ends: 382 [2025-01-09 15:25:51,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 15:25:51,184 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 335 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:51,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 781 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 15:25:51,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-01-09 15:25:51,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 379. [2025-01-09 15:25:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 326 states have (on average 1.3251533742331287) internal successors, (432), 329 states have internal predecessors, (432), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:25:51,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 524 transitions. [2025-01-09 15:25:51,204 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 524 transitions. Word has length 105 [2025-01-09 15:25:51,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:51,206 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 524 transitions. [2025-01-09 15:25:51,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 524 transitions. [2025-01-09 15:25:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 15:25:51,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:51,208 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:51,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-01-09 15:25:51,409 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:25:51,409 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:51,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:51,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1205820463, now seen corresponding path program 1 times [2025-01-09 15:25:51,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:51,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203606541] [2025-01-09 15:25:51,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:51,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:25:51,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:51,411 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:25:51,412 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:25:51,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 15:25:51,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 15:25:51,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:51,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:51,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 15:25:51,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:51,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:51,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 38 [2025-01-09 15:25:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:52,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:52,031 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:52,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203606541] [2025-01-09 15:25:52,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203606541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:52,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:52,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:25:52,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213343010] [2025-01-09 15:25:52,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:52,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:25:52,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:52,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:25:52,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:52,032 INFO L87 Difference]: Start difference. First operand 379 states and 524 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:53,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:53,578 INFO L93 Difference]: Finished difference Result 700 states and 965 transitions. [2025-01-09 15:25:53,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:25:53,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-01-09 15:25:53,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:53,580 INFO L225 Difference]: With dead ends: 700 [2025-01-09 15:25:53,580 INFO L226 Difference]: Without dead ends: 389 [2025-01-09 15:25:53,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:25:53,582 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 85 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:53,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 701 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 15:25:53,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-01-09 15:25:53,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 327. [2025-01-09 15:25:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 280 states have (on average 1.325) internal successors, (371), 282 states have internal predecessors, (371), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 15:25:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 451 transitions. [2025-01-09 15:25:53,609 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 451 transitions. Word has length 107 [2025-01-09 15:25:53,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:53,610 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 451 transitions. [2025-01-09 15:25:53,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:53,610 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 451 transitions. [2025-01-09 15:25:53,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 15:25:53,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:53,612 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:53,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-01-09 15:25:53,813 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:25:53,813 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:53,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash -443738449, now seen corresponding path program 1 times [2025-01-09 15:25:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:53,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359991236] [2025-01-09 15:25:53,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:53,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:25:53,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:53,815 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:25:53,816 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:25:53,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 15:25:54,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 15:25:54,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:54,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:54,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 15:25:54,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:54,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:54,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 24 [2025-01-09 15:25:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:54,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:54,269 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:54,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359991236] [2025-01-09 15:25:54,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359991236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:54,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:54,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:25:54,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823415765] [2025-01-09 15:25:54,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:54,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:25:54,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:54,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:25:54,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:25:54,269 INFO L87 Difference]: Start difference. First operand 327 states and 451 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:55,582 INFO L93 Difference]: Finished difference Result 596 states and 816 transitions. [2025-01-09 15:25:55,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:25:55,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-01-09 15:25:55,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:55,587 INFO L225 Difference]: With dead ends: 596 [2025-01-09 15:25:55,587 INFO L226 Difference]: Without dead ends: 337 [2025-01-09 15:25:55,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:55,588 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 84 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:55,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 523 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 15:25:55,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-01-09 15:25:55,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 279. [2025-01-09 15:25:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 237 states have (on average 1.3164556962025316) internal successors, (312), 238 states have internal predecessors, (312), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:25:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 380 transitions. [2025-01-09 15:25:55,604 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 380 transitions. Word has length 107 [2025-01-09 15:25:55,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:55,605 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 380 transitions. [2025-01-09 15:25:55,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 380 transitions. [2025-01-09 15:25:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:25:55,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:55,606 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:55,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-01-09 15:25:55,806 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:25:55,807 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:55,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:55,807 INFO L85 PathProgramCache]: Analyzing trace with hash -424754054, now seen corresponding path program 1 times [2025-01-09 15:25:55,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:55,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074606038] [2025-01-09 15:25:55,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:55,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:25:55,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:55,810 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:25:55,810 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:25:55,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:25:56,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:25:56,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:56,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:56,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:25:56,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:56,044 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 29 treesize of output 25 [2025-01-09 15:25:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:56,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:56,121 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:56,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074606038] [2025-01-09 15:25:56,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074606038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:56,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:56,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:25:56,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261751352] [2025-01-09 15:25:56,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:56,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:25:56,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:56,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:25:56,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:56,122 INFO L87 Difference]: Start difference. First operand 279 states and 380 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:56,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:56,782 INFO L93 Difference]: Finished difference Result 636 states and 860 transitions. [2025-01-09 15:25:56,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:25:56,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-01-09 15:25:56,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:56,785 INFO L225 Difference]: With dead ends: 636 [2025-01-09 15:25:56,785 INFO L226 Difference]: Without dead ends: 429 [2025-01-09 15:25:56,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:25:56,786 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 69 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:56,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 693 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:25:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-01-09 15:25:56,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 329. [2025-01-09 15:25:56,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 287 states have (on average 1.3135888501742161) internal successors, (377), 288 states have internal predecessors, (377), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:25:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 445 transitions. [2025-01-09 15:25:56,813 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 445 transitions. Word has length 109 [2025-01-09 15:25:56,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:56,814 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 445 transitions. [2025-01-09 15:25:56,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 445 transitions. [2025-01-09 15:25:56,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:25:56,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:56,814 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:56,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2025-01-09 15:25:57,016 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:25:57,017 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:57,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:57,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1413300468, now seen corresponding path program 1 times [2025-01-09 15:25:57,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:57,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970834439] [2025-01-09 15:25:57,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:57,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:25:57,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:57,019 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:25:57,020 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:25:57,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:25:57,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:25:57,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:57,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:57,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 15:25:57,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:57,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:25:57,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2025-01-09 15:25:57,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:57,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2025-01-09 15:25:57,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:57,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 32 [2025-01-09 15:25:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:57,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:57,660 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:57,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970834439] [2025-01-09 15:25:57,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970834439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:57,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:57,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:25:57,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665382926] [2025-01-09 15:25:57,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:57,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:25:57,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:57,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:25:57,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:25:57,661 INFO L87 Difference]: Start difference. First operand 329 states and 445 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:58,375 INFO L93 Difference]: Finished difference Result 337 states and 452 transitions. [2025-01-09 15:25:58,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:25:58,375 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-01-09 15:25:58,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:58,377 INFO L225 Difference]: With dead ends: 337 [2025-01-09 15:25:58,377 INFO L226 Difference]: Without dead ends: 335 [2025-01-09 15:25:58,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:25:58,377 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 152 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:58,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 814 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:25:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-01-09 15:25:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2025-01-09 15:25:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 290 states have (on average 1.3103448275862069) internal successors, (380), 291 states have internal predecessors, (380), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:25:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 448 transitions. [2025-01-09 15:25:58,414 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 448 transitions. Word has length 109 [2025-01-09 15:25:58,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:58,415 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 448 transitions. [2025-01-09 15:25:58,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:58,415 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 448 transitions. [2025-01-09 15:25:58,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:25:58,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:58,416 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:58,428 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:25:58,616 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:25:58,617 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:58,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:58,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1415147510, now seen corresponding path program 1 times [2025-01-09 15:25:58,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:58,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412615838] [2025-01-09 15:25:58,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:58,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:25:58,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:58,619 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:25:58,620 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:25:58,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:25:58,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:25:58,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:58,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:59,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 15:25:59,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:59,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:25:59,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2025-01-09 15:25:59,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-01-09 15:26:03,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:26:03,224 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 156 treesize of output 86 [2025-01-09 15:26:03,229 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 167 treesize of output 107 [2025-01-09 15:26:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-01-09 15:26:03,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:26:03,475 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:26:03,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412615838] [2025-01-09 15:26:03,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412615838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:03,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:03,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:26:03,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523214224] [2025-01-09 15:26:03,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:03,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:26:03,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:26:03,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:26:03,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:26:03,476 INFO L87 Difference]: Start difference. First operand 332 states and 448 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:26:05,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:05,939 INFO L93 Difference]: Finished difference Result 910 states and 1224 transitions. [2025-01-09 15:26:05,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:26:05,943 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-01-09 15:26:05,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:05,945 INFO L225 Difference]: With dead ends: 910 [2025-01-09 15:26:05,945 INFO L226 Difference]: Without dead ends: 654 [2025-01-09 15:26:05,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:26:05,946 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 207 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:05,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 715 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 15:26:05,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-01-09 15:26:05,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 650. [2025-01-09 15:26:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 567 states have (on average 1.3033509700176367) internal successors, (739), 571 states have internal predecessors, (739), 66 states have call successors, (66), 16 states have call predecessors, (66), 16 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 15:26:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 871 transitions. [2025-01-09 15:26:05,986 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 871 transitions. Word has length 109 [2025-01-09 15:26:05,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:05,986 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 871 transitions. [2025-01-09 15:26:05,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:26:05,986 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 871 transitions. [2025-01-09 15:26:05,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:26:05,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:05,987 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:06,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 (12)] Ended with exit code 0 [2025-01-09 15:26:06,187 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:26:06,188 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:06,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:06,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1104812424, now seen corresponding path program 1 times [2025-01-09 15:26:06,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:26:06,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752869140] [2025-01-09 15:26:06,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:06,188 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:26:06,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:26:06,190 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:26:06,191 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:26:06,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:26:06,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:26:06,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:06,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:06,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 15:26:06,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:26:06,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:26:06,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 65 [2025-01-09 15:26:07,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:26:07,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 77 [2025-01-09 15:26:07,115 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-01-09 15:26:07,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:26:07,234 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:26:07,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752869140] [2025-01-09 15:26:07,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752869140] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:26:07,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [744678202] [2025-01-09 15:26:07,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:07,234 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:26:07,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:26:07,253 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:26:07,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2025-01-09 15:26:07,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:26:08,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:26:08,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:08,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:08,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 15:26:08,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:26:08,267 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:26:08,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2025-01-09 15:26:09,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:26:09,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 77 [2025-01-09 15:26:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-01-09 15:26:09,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:26:09,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [744678202] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:26:09,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:26:09,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-01-09 15:26:09,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133858004] [2025-01-09 15:26:09,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:26:09,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:26:09,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:26:09,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:26:09,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:26:09,231 INFO L87 Difference]: Start difference. First operand 650 states and 871 transitions. Second operand has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 15:26:10,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:10,197 INFO L93 Difference]: Finished difference Result 1164 states and 1561 transitions. [2025-01-09 15:26:10,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:26:10,198 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 109 [2025-01-09 15:26:10,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:10,200 INFO L225 Difference]: With dead ends: 1164 [2025-01-09 15:26:10,200 INFO L226 Difference]: Without dead ends: 654 [2025-01-09 15:26:10,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2025-01-09 15:26:10,204 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 502 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:10,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 980 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:26:10,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-01-09 15:26:10,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 650. [2025-01-09 15:26:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 567 states have (on average 1.2998236331569666) internal successors, (737), 571 states have internal predecessors, (737), 66 states have call successors, (66), 16 states have call predecessors, (66), 16 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 15:26:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 869 transitions. [2025-01-09 15:26:10,247 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 869 transitions. Word has length 109 [2025-01-09 15:26:10,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:10,248 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 869 transitions. [2025-01-09 15:26:10,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 15:26:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 869 transitions. [2025-01-09 15:26:10,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:26:10,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:10,249 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:10,261 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:26:10,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2025-01-09 15:26:10,649 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,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 15:26:10,650 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:10,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:10,650 INFO L85 PathProgramCache]: Analyzing trace with hash -98488383, now seen corresponding path program 1 times [2025-01-09 15:26:10,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:26:10,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251890012] [2025-01-09 15:26:10,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:10,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:26:10,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:26:10,653 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:26:10,654 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:26:10,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:26:10,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:26:10,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:10,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:10,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:26:10,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:26:11,008 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-01-09 15:26:11,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:26:11,079 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:26:11,079 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:26:11,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251890012] [2025-01-09 15:26:11,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251890012] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:26:11,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:26:11,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-01-09 15:26:11,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665835242] [2025-01-09 15:26:11,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:11,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:26:11,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:26:11,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:26:11,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:26:11,080 INFO L87 Difference]: Start difference. First operand 650 states and 869 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:26:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:11,177 INFO L93 Difference]: Finished difference Result 1356 states and 1799 transitions. [2025-01-09 15:26:11,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:26:11,178 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-01-09 15:26:11,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:11,180 INFO L225 Difference]: With dead ends: 1356 [2025-01-09 15:26:11,180 INFO L226 Difference]: Without dead ends: 846 [2025-01-09 15:26:11,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:26:11,182 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 43 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:11,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 428 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:26:11,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-01-09 15:26:11,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 730. [2025-01-09 15:26:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 647 states have (on average 1.2905718701700155) internal successors, (835), 651 states have internal predecessors, (835), 66 states have call successors, (66), 16 states have call predecessors, (66), 16 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 15:26:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 967 transitions. [2025-01-09 15:26:11,216 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 967 transitions. Word has length 109 [2025-01-09 15:26:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:11,217 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 967 transitions. [2025-01-09 15:26:11,217 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:26:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 967 transitions. [2025-01-09 15:26:11,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:26:11,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:11,218 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:11,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-01-09 15:26:11,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:26:11,419 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:11,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:11,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2058676748, now seen corresponding path program 1 times [2025-01-09 15:26:11,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:26:11,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249143172] [2025-01-09 15:26:11,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:11,419 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:26:11,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:26:11,422 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:26:11,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-01-09 15:26:11,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:26:11,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:26:11,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:11,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:11,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 15:26:11,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:26:11,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 15:26:11,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2025-01-09 15:26:11,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:26:11,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 31 [2025-01-09 15:26:11,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:26:11,863 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 51 treesize of output 27 [2025-01-09 15:26:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-01-09 15:26:11,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:26:11,920 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:26:11,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249143172] [2025-01-09 15:26:11,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249143172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:11,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:11,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:26:11,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75728375] [2025-01-09 15:26:11,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:11,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:26:11,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:26:11,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:26:11,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:26:11,921 INFO L87 Difference]: Start difference. First operand 730 states and 967 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:26:13,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:13,257 INFO L93 Difference]: Finished difference Result 1628 states and 2160 transitions. [2025-01-09 15:26:13,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:26:13,257 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-01-09 15:26:13,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:13,260 INFO L225 Difference]: With dead ends: 1628 [2025-01-09 15:26:13,260 INFO L226 Difference]: Without dead ends: 1046 [2025-01-09 15:26:13,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:26:13,261 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 207 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:13,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1024 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 15:26:13,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-01-09 15:26:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 950. [2025-01-09 15:26:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 867 states have (on average 1.3044982698961938) internal successors, (1131), 871 states have internal predecessors, (1131), 66 states have call successors, (66), 16 states have call predecessors, (66), 16 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 15:26:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1263 transitions. [2025-01-09 15:26:13,305 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1263 transitions. Word has length 109 [2025-01-09 15:26:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:13,306 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1263 transitions. [2025-01-09 15:26:13,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:26:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1263 transitions. [2025-01-09 15:26:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:26:13,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:13,308 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:13,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-01-09 15:26:13,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:26:13,509 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:13,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:13,509 INFO L85 PathProgramCache]: Analyzing trace with hash 956426870, now seen corresponding path program 1 times [2025-01-09 15:26:13,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:26:13,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796293122] [2025-01-09 15:26:13,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:13,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:26:13,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:26:13,512 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:26:13,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-01-09 15:26:13,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:26:13,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:26:13,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:13,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:13,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:26:13,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:26:13,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 15:26:13,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2025-01-09 15:26:13,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2025-01-09 15:26:13,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-01-09 15:26:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-01-09 15:26:13,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:26:13,939 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:26:13,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796293122] [2025-01-09 15:26:13,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796293122] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:13,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:13,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:26:13,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705832080] [2025-01-09 15:26:13,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:13,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:26:13,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:26:13,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:26:13,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:26:13,940 INFO L87 Difference]: Start difference. First operand 950 states and 1263 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:26:14,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:14,723 INFO L93 Difference]: Finished difference Result 1802 states and 2386 transitions. [2025-01-09 15:26:14,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:26:14,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-01-09 15:26:14,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:14,726 INFO L225 Difference]: With dead ends: 1802 [2025-01-09 15:26:14,726 INFO L226 Difference]: Without dead ends: 1030 [2025-01-09 15:26:14,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:26:14,729 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 215 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:14,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 431 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:26:14,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2025-01-09 15:26:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 934. [2025-01-09 15:26:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 849 states have (on average 1.2968197879858658) internal successors, (1101), 853 states have internal predecessors, (1101), 66 states have call successors, (66), 18 states have call predecessors, (66), 18 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 15:26:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1233 transitions. [2025-01-09 15:26:14,777 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1233 transitions. Word has length 109 [2025-01-09 15:26:14,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:14,777 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1233 transitions. [2025-01-09 15:26:14,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:26:14,777 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1233 transitions. [2025-01-09 15:26:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:26:14,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:14,779 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:14,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2025-01-09 15:26:14,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:26:14,979 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:14,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:14,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1918128138, now seen corresponding path program 1 times [2025-01-09 15:26:14,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:26:14,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268419032] [2025-01-09 15:26:14,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:14,980 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:26:14,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:26:14,982 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:26:14,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-01-09 15:26:15,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:26:15,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:26:15,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:15,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:15,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:26:15,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:26:15,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-01-09 15:26:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 15:26:15,801 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:26:15,801 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:26:15,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268419032] [2025-01-09 15:26:15,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268419032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:15,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:15,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:26:15,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643625193] [2025-01-09 15:26:15,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:15,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:26:15,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:26:15,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:26:15,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:26:15,802 INFO L87 Difference]: Start difference. First operand 934 states and 1233 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:26:18,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:26:20,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:26:22,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:26:24,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:26:26,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:26:28,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:26:28,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:28,868 INFO L93 Difference]: Finished difference Result 1452 states and 1909 transitions. [2025-01-09 15:26:28,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:26:28,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-01-09 15:26:28,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:28,871 INFO L225 Difference]: With dead ends: 1452 [2025-01-09 15:26:28,871 INFO L226 Difference]: Without dead ends: 674 [2025-01-09 15:26:28,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:26:28,873 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 98 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 8 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:28,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 365 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 220 Invalid, 5 Unknown, 0 Unchecked, 12.9s Time] [2025-01-09 15:26:28,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-01-09 15:26:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 654. [2025-01-09 15:26:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 592 states have (on average 1.277027027027027) internal successors, (756), 593 states have internal predecessors, (756), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:26:28,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 848 transitions. [2025-01-09 15:26:28,911 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 848 transitions. Word has length 109 [2025-01-09 15:26:28,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:28,911 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 848 transitions. [2025-01-09 15:26:28,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:26:28,912 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 848 transitions. [2025-01-09 15:26:28,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:26:28,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:28,912 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:28,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2025-01-09 15:26:29,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:26:29,113 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:29,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:29,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1386647220, now seen corresponding path program 1 times [2025-01-09 15:26:29,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:26:29,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330756170] [2025-01-09 15:26:29,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:29,115 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:26:29,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:26:29,117 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:26:29,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2025-01-09 15:26:29,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:26:29,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:26:29,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:29,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:29,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:26:29,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:26:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-01-09 15:26:29,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:26:29,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:26:29,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330756170] [2025-01-09 15:26:29,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330756170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:29,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:29,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:26:29,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307556544] [2025-01-09 15:26:29,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:29,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:26:29,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:26:29,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:26:29,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:26:29,380 INFO L87 Difference]: Start difference. First operand 654 states and 848 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:26:29,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:29,431 INFO L93 Difference]: Finished difference Result 1222 states and 1587 transitions. [2025-01-09 15:26:29,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:26:29,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-01-09 15:26:29,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:29,434 INFO L225 Difference]: With dead ends: 1222 [2025-01-09 15:26:29,434 INFO L226 Difference]: Without dead ends: 654 [2025-01-09 15:26:29,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:26:29,435 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:29,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:26:29,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-01-09 15:26:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2025-01-09 15:26:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 592 states have (on average 1.2736486486486487) internal successors, (754), 593 states have internal predecessors, (754), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:26:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 846 transitions. [2025-01-09 15:26:29,464 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 846 transitions. Word has length 109 [2025-01-09 15:26:29,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:29,465 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 846 transitions. [2025-01-09 15:26:29,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:26:29,465 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 846 transitions. [2025-01-09 15:26:29,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:26:29,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:29,466 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:29,476 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 (19)] Forceful destruction successful, exit code 0 [2025-01-09 15:26:29,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:26:29,667 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:29,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:29,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2059952917, now seen corresponding path program 1 times [2025-01-09 15:26:29,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:26:29,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515119410] [2025-01-09 15:26:29,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:29,667 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:26:29,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:26:29,669 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:26:29,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2025-01-09 15:26:29,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:26:30,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:26:30,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:30,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:30,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 15:26:30,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:26:30,279 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:26:30,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:26:30,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 15:26:30,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 15:26:30,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-01-09 15:26:30,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2025-01-09 15:26:31,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2025-01-09 15:26:32,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-01-09 15:26:32,111 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 19 [2025-01-09 15:26:32,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:26:32,128 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 58 treesize of output 28 [2025-01-09 15:26:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-01-09 15:26:32,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:26:32,821 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:26:32,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515119410] [2025-01-09 15:26:32,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515119410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:32,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:32,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:26:32,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223491144] [2025-01-09 15:26:32,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:32,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:26:32,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:26:32,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:26:32,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:26:32,822 INFO L87 Difference]: Start difference. First operand 654 states and 846 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:26:41,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:26:46,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]