./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 90de0053d184a453dc3a33f57409c1c246f48963f5fd9431c484b6f29206cf7b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:16:37,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:16:38,003 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:16:38,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:16:38,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:16:38,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:16:38,033 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:16:38,033 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:16:38,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:16:38,034 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:16:38,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:16:38,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:16:38,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:16:38,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:16:38,035 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:16:38,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:16:38,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:16:38,035 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:16:38,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:16:38,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:16:38,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:16:38,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:16:38,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:16:38,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:16:38,036 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:16:38,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:16:38,036 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:16:38,036 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:16:38,036 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:16:38,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:16:38,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:16:38,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:16:38,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:16:38,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:16:38,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:16:38,037 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:16:38,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:16:38,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:16:38,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:16:38,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:16:38,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:16:38,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:16:38,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:16:38,037 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/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 -> 90de0053d184a453dc3a33f57409c1c246f48963f5fd9431c484b6f29206cf7b [2025-03-08 16:16:38,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:16:38,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:16:38,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:16:38,274 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:16:38,274 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:16:38,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i [2025-03-08 16:16:39,323 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d972e5837/19cec7a80d0d4d0eb8c639c6be2b4640/FLAGa28397455 [2025-03-08 16:16:39,572 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:16:39,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i [2025-03-08 16:16:39,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d972e5837/19cec7a80d0d4d0eb8c639c6be2b4640/FLAGa28397455 [2025-03-08 16:16:39,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d972e5837/19cec7a80d0d4d0eb8c639c6be2b4640 [2025-03-08 16:16:39,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:16:39,903 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:16:39,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:16:39,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:16:39,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:16:39,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:16:39" (1/1) ... [2025-03-08 16:16:39,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@beba044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:16:39, skipping insertion in model container [2025-03-08 16:16:39,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:16:39" (1/1) ... [2025-03-08 16:16:39,919 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:16:40,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i[916,929] [2025-03-08 16:16:40,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:16:40,043 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:16:40,050 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i[916,929] [2025-03-08 16:16:40,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:16:40,091 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:16:40,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:16:40 WrapperNode [2025-03-08 16:16:40,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:16:40,093 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:16:40,093 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:16:40,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:16:40,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:16:40" (1/1) ... [2025-03-08 16:16:40,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:16:40" (1/1) ... [2025-03-08 16:16:40,142 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 475 [2025-03-08 16:16:40,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:16:40,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:16:40,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:16:40,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:16:40,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:16:40" (1/1) ... [2025-03-08 16:16:40,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:16:40" (1/1) ... [2025-03-08 16:16:40,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:16:40" (1/1) ... [2025-03-08 16:16:40,168 INFO L175 MemorySlicer]: Split 124 memory accesses to 8 slices as follows [2, 8, 52, 20, 7, 15, 6, 14]. 42 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 2, 1, 2, 1, 2]. The 17 writes are split as follows [0, 1, 7, 2, 1, 3, 1, 2]. [2025-03-08 16:16:40,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:16:40" (1/1) ... [2025-03-08 16:16:40,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:16:40" (1/1) ... [2025-03-08 16:16:40,196 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:16:40" (1/1) ... [2025-03-08 16:16:40,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:16:40" (1/1) ... [2025-03-08 16:16:40,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:16:40" (1/1) ... [2025-03-08 16:16:40,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:16:40" (1/1) ... [2025-03-08 16:16:40,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:16:40,212 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:16:40,212 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:16:40,213 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:16:40,213 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:16:40" (1/1) ... [2025-03-08 16:16:40,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:16:40,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:16:40,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:16:40,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:16:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:16:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-08 16:16:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-08 16:16:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-08 16:16:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-08 16:16:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-08 16:16:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-08 16:16:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-08 16:16:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-08 16:16:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:16:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:16:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:16:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:16:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:16:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:16:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 16:16:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 16:16:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-08 16:16:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-08 16:16:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-08 16:16:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-08 16:16:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-08 16:16:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-08 16:16:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-08 16:16:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-08 16:16:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:16:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:16:40,261 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 16:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:16:40,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:16:40,357 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:16:40,358 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:16:40,679 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~bitwise75#1;havoc property_#t~ite80#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem79#1;havoc property_#t~mem78#1;havoc property_#t~mem85#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite92#1;havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~short93#1;havoc property_#t~mem94#1;havoc property_#t~ite116#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem103#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite102#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem104#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem105#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem108#1;havoc property_#t~ite113#1;havoc property_#t~mem109#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem112#1;havoc property_#t~short117#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~short120#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-03-08 16:16:40,711 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2025-03-08 16:16:40,711 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:16:40,728 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:16:40,728 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:16:40,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:16:40 BoogieIcfgContainer [2025-03-08 16:16:40,730 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:16:40,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:16:40,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:16:40,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:16:40,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:16:39" (1/3) ... [2025-03-08 16:16:40,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1532a40a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:16:40, skipping insertion in model container [2025-03-08 16:16:40,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:16:40" (2/3) ... [2025-03-08 16:16:40,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1532a40a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:16:40, skipping insertion in model container [2025-03-08 16:16:40,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:16:40" (3/3) ... [2025-03-08 16:16:40,738 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-37.i [2025-03-08 16:16:40,747 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:16:40,748 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-37.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:16:40,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:16:40,799 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;@7c67716d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:16:40,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:16:40,803 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:16:40,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 16:16:40,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:40,814 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:16:40,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:40,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:40,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1695165429, now seen corresponding path program 1 times [2025-03-08 16:16:40,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:16:40,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831501084] [2025-03-08 16:16:40,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:40,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:16:40,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 16:16:40,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 16:16:40,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:40,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 16:16:41,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:16:41,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831501084] [2025-03-08 16:16:41,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831501084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:16:41,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493461114] [2025-03-08 16:16:41,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:41,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:16:41,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:16:41,084 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:16:41,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:16:41,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 16:16:41,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 16:16:41,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:41,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:41,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:16:41,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:16:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 16:16:41,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:16:41,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493461114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:41,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:16:41,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:16:41,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819742964] [2025-03-08 16:16:41,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:41,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:16:41,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:16:41,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:16:41,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:16:41,349 INFO L87 Difference]: Start difference. First operand has 104 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:16:41,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:41,382 INFO L93 Difference]: Finished difference Result 202 states and 314 transitions. [2025-03-08 16:16:41,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:16:41,384 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-03-08 16:16:41,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:41,389 INFO L225 Difference]: With dead ends: 202 [2025-03-08 16:16:41,390 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 16:16:41,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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-03-08 16:16:41,395 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:41,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:16:41,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 16:16:41,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-08 16:16:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 84 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:16:41,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2025-03-08 16:16:41,430 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 124 [2025-03-08 16:16:41,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:41,431 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2025-03-08 16:16:41,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:16:41,431 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2025-03-08 16:16:41,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 16:16:41,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:41,436 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:16:41,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 16:16:41,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:16:41,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:41,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:41,639 INFO L85 PathProgramCache]: Analyzing trace with hash -362019578, now seen corresponding path program 1 times [2025-03-08 16:16:41,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:16:41,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370356657] [2025-03-08 16:16:41,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:41,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:16:41,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 16:16:41,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 16:16:41,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:41,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:42,008 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:16:42,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:16:42,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370356657] [2025-03-08 16:16:42,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370356657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:42,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:42,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:16:42,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930016798] [2025-03-08 16:16:42,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:42,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:16:42,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:16:42,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:16:42,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:16:42,011 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:16:42,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:42,056 INFO L93 Difference]: Finished difference Result 202 states and 295 transitions. [2025-03-08 16:16:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:16:42,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-03-08 16:16:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:42,058 INFO L225 Difference]: With dead ends: 202 [2025-03-08 16:16:42,058 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 16:16:42,059 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-03-08 16:16:42,059 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:42,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:16:42,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 16:16:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-03-08 16:16:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:16:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2025-03-08 16:16:42,067 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 124 [2025-03-08 16:16:42,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:42,068 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2025-03-08 16:16:42,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:16:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2025-03-08 16:16:42,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 16:16:42,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:42,070 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:16:42,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:16:42,070 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:42,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:42,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2125493255, now seen corresponding path program 1 times [2025-03-08 16:16:42,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:16:42,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947807283] [2025-03-08 16:16:42,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:42,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:16:42,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 16:16:42,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 16:16:42,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:42,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:16:42,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:16:42,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947807283] [2025-03-08 16:16:42,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947807283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:42,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:42,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:16:42,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503470568] [2025-03-08 16:16:42,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:42,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:16:42,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:16:42,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:16:42,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:16:42,249 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:16:42,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:42,288 INFO L93 Difference]: Finished difference Result 206 states and 299 transitions. [2025-03-08 16:16:42,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:16:42,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-03-08 16:16:42,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:42,290 INFO L225 Difference]: With dead ends: 206 [2025-03-08 16:16:42,290 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 16:16:42,291 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-03-08 16:16:42,291 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:42,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 416 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:16:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 16:16:42,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-08 16:16:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:16:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2025-03-08 16:16:42,297 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 124 [2025-03-08 16:16:42,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:42,300 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2025-03-08 16:16:42,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:16:42,300 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2025-03-08 16:16:42,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 16:16:42,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:42,301 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:16:42,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:16:42,301 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:42,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:42,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1281970360, now seen corresponding path program 1 times [2025-03-08 16:16:42,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:16:42,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372761229] [2025-03-08 16:16:42,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:42,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:16:42,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 16:16:42,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 16:16:42,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:42,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:16:42,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:16:42,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372761229] [2025-03-08 16:16:42,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372761229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:42,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:42,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:16:42,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077261129] [2025-03-08 16:16:42,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:42,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:16:42,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:16:42,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:16:42,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:16:42,452 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:16:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:42,482 INFO L93 Difference]: Finished difference Result 210 states and 303 transitions. [2025-03-08 16:16:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:16:42,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-03-08 16:16:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:42,485 INFO L225 Difference]: With dead ends: 210 [2025-03-08 16:16:42,486 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 16:16:42,486 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-03-08 16:16:42,487 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:42,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 418 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:16:42,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 16:16:42,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-03-08 16:16:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:16:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2025-03-08 16:16:42,495 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 124 [2025-03-08 16:16:42,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:42,496 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2025-03-08 16:16:42,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:16:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2025-03-08 16:16:42,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 16:16:42,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:42,500 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:16:42,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:16:42,501 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:42,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:42,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1281046839, now seen corresponding path program 1 times [2025-03-08 16:16:42,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:16:42,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217685616] [2025-03-08 16:16:42,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:42,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:16:42,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 16:16:42,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 16:16:42,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:42,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:43,321 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:16:43,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:16:43,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217685616] [2025-03-08 16:16:43,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217685616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:43,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:43,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:16:43,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756521669] [2025-03-08 16:16:43,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:43,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:16:43,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:16:43,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:16:43,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:16:43,324 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:16:43,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:43,422 INFO L93 Difference]: Finished difference Result 236 states and 337 transitions. [2025-03-08 16:16:43,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:16:43,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-03-08 16:16:43,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:43,424 INFO L225 Difference]: With dead ends: 236 [2025-03-08 16:16:43,424 INFO L226 Difference]: Without dead ends: 132 [2025-03-08 16:16:43,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:16:43,425 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 98 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:43,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 720 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:16:43,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-08 16:16:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2025-03-08 16:16:43,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 106 states have (on average 1.330188679245283) internal successors, (141), 107 states have internal predecessors, (141), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 16:16:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 185 transitions. [2025-03-08 16:16:43,440 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 185 transitions. Word has length 124 [2025-03-08 16:16:43,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:43,441 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 185 transitions. [2025-03-08 16:16:43,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:16:43,442 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 185 transitions. [2025-03-08 16:16:43,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 16:16:43,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:43,443 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:16:43,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:16:43,443 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:43,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:43,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1910719769, now seen corresponding path program 1 times [2025-03-08 16:16:43,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:16:43,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611709274] [2025-03-08 16:16:43,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:43,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:16:43,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:16:43,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:16:43,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:43,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:16:44,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:16:44,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611709274] [2025-03-08 16:16:44,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611709274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:16:44,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516477647] [2025-03-08 16:16:44,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:44,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:16:44,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:16:44,027 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:16:44,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:16:44,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:16:44,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:16:44,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:44,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:44,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 16:16:44,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:16:44,272 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 13 [2025-03-08 16:16:44,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-08 16:16:44,392 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 16:16:44,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:16:44,592 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:16:44,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516477647] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:16:44,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:16:44,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 16:16:44,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528154407] [2025-03-08 16:16:44,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:16:44,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:16:44,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:16:44,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:16:44,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:16:44,595 INFO L87 Difference]: Start difference. First operand 131 states and 185 transitions. Second operand has 11 states, 9 states have (on average 7.444444444444445) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-08 16:16:44,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:44,875 INFO L93 Difference]: Finished difference Result 249 states and 345 transitions. [2025-03-08 16:16:44,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:16:44,876 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.444444444444445) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) Word has length 127 [2025-03-08 16:16:44,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:44,879 INFO L225 Difference]: With dead ends: 249 [2025-03-08 16:16:44,879 INFO L226 Difference]: Without dead ends: 141 [2025-03-08 16:16:44,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 251 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:16:44,881 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 280 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:44,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 494 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:16:44,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-08 16:16:44,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2025-03-08 16:16:44,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 113 states have internal predecessors, (146), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 16:16:44,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 190 transitions. [2025-03-08 16:16:44,897 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 190 transitions. Word has length 127 [2025-03-08 16:16:44,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:44,897 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 190 transitions. [2025-03-08 16:16:44,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.444444444444445) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-08 16:16:44,898 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 190 transitions. [2025-03-08 16:16:44,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 16:16:44,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:44,899 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:16:44,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:16:45,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 16:16:45,100 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:45,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:45,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1655983224, now seen corresponding path program 1 times [2025-03-08 16:16:45,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:16:45,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617399438] [2025-03-08 16:16:45,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:45,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:16:45,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:16:45,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:16:45,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:45,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:16:45,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:16:45,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617399438] [2025-03-08 16:16:45,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617399438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:45,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:45,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:16:45,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662130031] [2025-03-08 16:16:45,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:45,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:16:45,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:16:45,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:16:45,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:16:45,332 INFO L87 Difference]: Start difference. First operand 139 states and 190 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:16:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:45,414 INFO L93 Difference]: Finished difference Result 273 states and 373 transitions. [2025-03-08 16:16:45,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:16:45,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-03-08 16:16:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:45,416 INFO L225 Difference]: With dead ends: 273 [2025-03-08 16:16:45,416 INFO L226 Difference]: Without dead ends: 161 [2025-03-08 16:16:45,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-03-08 16:16:45,416 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 128 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:45,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 589 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:16:45,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-08 16:16:45,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2025-03-08 16:16:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 123 states have (on average 1.2682926829268293) internal successors, (156), 124 states have internal predecessors, (156), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:16:45,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 216 transitions. [2025-03-08 16:16:45,426 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 216 transitions. Word has length 127 [2025-03-08 16:16:45,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:45,426 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 216 transitions. [2025-03-08 16:16:45,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:16:45,427 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 216 transitions. [2025-03-08 16:16:45,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 16:16:45,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:45,427 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:16:45,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:16:45,428 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:45,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:45,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1131432263, now seen corresponding path program 1 times [2025-03-08 16:16:45,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:16:45,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361066410] [2025-03-08 16:16:45,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:45,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:16:45,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:16:45,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:16:45,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:45,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:16:45,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:16:45,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361066410] [2025-03-08 16:16:45,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361066410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:16:45,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319557972] [2025-03-08 16:16:45,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:45,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:16:45,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:16:45,903 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:16:45,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 16:16:46,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:16:46,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:16:46,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:46,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:46,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 16:16:46,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:16:46,110 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 13 [2025-03-08 16:16:46,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-08 16:16:46,297 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-03-08 16:16:46,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-08 16:16:46,349 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 27 treesize of output 11 [2025-03-08 16:16:46,396 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-03-08 16:16:46,424 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 15 treesize of output 7 [2025-03-08 16:16:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 242 proven. 30 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-08 16:16:46,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:16:46,687 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-03-08 16:16:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 48 proven. 33 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-08 16:16:46,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319557972] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:16:46,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:16:46,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 30 [2025-03-08 16:16:46,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2828978] [2025-03-08 16:16:46,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:16:46,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 16:16:46,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:16:46,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 16:16:46,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2025-03-08 16:16:46,862 INFO L87 Difference]: Start difference. First operand 159 states and 216 transitions. Second operand has 30 states, 25 states have (on average 5.2) internal successors, (130), 30 states have internal predecessors, (130), 12 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (38), 7 states have call predecessors, (38), 12 states have call successors, (38) [2025-03-08 16:16:48,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:48,000 INFO L93 Difference]: Finished difference Result 301 states and 393 transitions. [2025-03-08 16:16:48,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 16:16:48,001 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 5.2) internal successors, (130), 30 states have internal predecessors, (130), 12 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (38), 7 states have call predecessors, (38), 12 states have call successors, (38) Word has length 127 [2025-03-08 16:16:48,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:48,002 INFO L225 Difference]: With dead ends: 301 [2025-03-08 16:16:48,002 INFO L226 Difference]: Without dead ends: 189 [2025-03-08 16:16:48,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=588, Invalid=2168, Unknown=0, NotChecked=0, Total=2756 [2025-03-08 16:16:48,004 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 829 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:48,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 827 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:16:48,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-08 16:16:48,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 171. [2025-03-08 16:16:48,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.2330827067669172) internal successors, (164), 134 states have internal predecessors, (164), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:16:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 220 transitions. [2025-03-08 16:16:48,022 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 220 transitions. Word has length 127 [2025-03-08 16:16:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:48,023 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 220 transitions. [2025-03-08 16:16:48,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 5.2) internal successors, (130), 30 states have internal predecessors, (130), 12 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (38), 7 states have call predecessors, (38), 12 states have call successors, (38) [2025-03-08 16:16:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 220 transitions. [2025-03-08 16:16:48,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 16:16:48,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:48,025 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:16:48,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 16:16:48,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:16:48,225 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:48,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:48,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1605971081, now seen corresponding path program 1 times [2025-03-08 16:16:48,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:16:48,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385202925] [2025-03-08 16:16:48,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:48,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:16:48,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:16:48,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:16:48,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:48,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:48,537 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:16:48,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:16:48,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385202925] [2025-03-08 16:16:48,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385202925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:48,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:48,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:16:48,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453332285] [2025-03-08 16:16:48,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:48,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:16:48,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:16:48,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:16:48,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:16:48,538 INFO L87 Difference]: Start difference. First operand 171 states and 220 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:16:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:48,644 INFO L93 Difference]: Finished difference Result 297 states and 381 transitions. [2025-03-08 16:16:48,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:16:48,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-03-08 16:16:48,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:48,645 INFO L225 Difference]: With dead ends: 297 [2025-03-08 16:16:48,645 INFO L226 Difference]: Without dead ends: 173 [2025-03-08 16:16:48,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:16:48,646 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 89 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:48,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 595 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:16:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-08 16:16:48,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-03-08 16:16:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 134 states have (on average 1.2238805970149254) internal successors, (164), 135 states have internal predecessors, (164), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:16:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 220 transitions. [2025-03-08 16:16:48,657 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 220 transitions. Word has length 127 [2025-03-08 16:16:48,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:48,657 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 220 transitions. [2025-03-08 16:16:48,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:16:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 220 transitions. [2025-03-08 16:16:48,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:16:48,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:48,658 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:16:48,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:16:48,659 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:48,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1598561198, now seen corresponding path program 1 times [2025-03-08 16:16:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:16:48,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414329707] [2025-03-08 16:16:48,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:16:48,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:16:48,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:16:48,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:48,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:49,620 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:16:49,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:16:49,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414329707] [2025-03-08 16:16:49,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414329707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:49,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:49,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:16:49,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909303190] [2025-03-08 16:16:49,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:49,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:16:49,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:16:49,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:16:49,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:16:49,622 INFO L87 Difference]: Start difference. First operand 173 states and 220 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:16:49,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:49,954 INFO L93 Difference]: Finished difference Result 192 states and 239 transitions. [2025-03-08 16:16:49,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:16:49,954 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2025-03-08 16:16:49,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:49,955 INFO L225 Difference]: With dead ends: 192 [2025-03-08 16:16:49,955 INFO L226 Difference]: Without dead ends: 190 [2025-03-08 16:16:49,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:16:49,956 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 199 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:49,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 833 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:16:49,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-08 16:16:49,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2025-03-08 16:16:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.218978102189781) internal successors, (167), 138 states have internal predecessors, (167), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:16:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 223 transitions. [2025-03-08 16:16:49,973 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 223 transitions. Word has length 129 [2025-03-08 16:16:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:49,974 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 223 transitions. [2025-03-08 16:16:49,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:16:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 223 transitions. [2025-03-08 16:16:49,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:16:49,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:49,976 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:16:49,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:16:49,976 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:49,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:49,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1597637677, now seen corresponding path program 1 times [2025-03-08 16:16:49,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:16:49,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284708546] [2025-03-08 16:16:49,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:49,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:16:49,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:16:49,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:16:49,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:49,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:50,129 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:16:50,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:16:50,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284708546] [2025-03-08 16:16:50,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284708546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:50,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:50,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:16:50,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442815963] [2025-03-08 16:16:50,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:50,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:16:50,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:16:50,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:16:50,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:16:50,131 INFO L87 Difference]: Start difference. First operand 176 states and 223 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:16:50,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:50,186 INFO L93 Difference]: Finished difference Result 319 states and 400 transitions. [2025-03-08 16:16:50,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:16:50,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-08 16:16:50,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:50,188 INFO L225 Difference]: With dead ends: 319 [2025-03-08 16:16:50,188 INFO L226 Difference]: Without dead ends: 190 [2025-03-08 16:16:50,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:16:50,189 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 115 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:50,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 613 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:16:50,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-08 16:16:50,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2025-03-08 16:16:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.2116788321167884) internal successors, (166), 138 states have internal predecessors, (166), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:16:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 222 transitions. [2025-03-08 16:16:50,206 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 222 transitions. Word has length 129 [2025-03-08 16:16:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:50,207 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 222 transitions. [2025-03-08 16:16:50,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:16:50,207 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 222 transitions. [2025-03-08 16:16:50,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:16:50,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:50,208 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:16:50,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:16:50,208 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:50,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:50,208 INFO L85 PathProgramCache]: Analyzing trace with hash -710133996, now seen corresponding path program 1 times [2025-03-08 16:16:50,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:16:50,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005347141] [2025-03-08 16:16:50,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:50,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:16:50,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:16:50,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:16:50,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:50,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:16:50,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:16:50,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005347141] [2025-03-08 16:16:50,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005347141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:50,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:50,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:16:50,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596557004] [2025-03-08 16:16:50,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:50,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:16:50,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:16:50,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:16:50,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:16:50,479 INFO L87 Difference]: Start difference. First operand 176 states and 222 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:16:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:50,571 INFO L93 Difference]: Finished difference Result 305 states and 384 transitions. [2025-03-08 16:16:50,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:16:50,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-08 16:16:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:50,573 INFO L225 Difference]: With dead ends: 305 [2025-03-08 16:16:50,573 INFO L226 Difference]: Without dead ends: 176 [2025-03-08 16:16:50,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:16:50,575 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 78 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:50,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 424 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:16:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-08 16:16:50,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-03-08 16:16:50,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.2043795620437956) internal successors, (165), 138 states have internal predecessors, (165), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:16:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 221 transitions. [2025-03-08 16:16:50,593 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 221 transitions. Word has length 129 [2025-03-08 16:16:50,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:50,594 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 221 transitions. [2025-03-08 16:16:50,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:16:50,595 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 221 transitions. [2025-03-08 16:16:50,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:16:50,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:50,596 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:16:50,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:16:50,596 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:50,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:50,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1777378837, now seen corresponding path program 1 times [2025-03-08 16:16:50,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:16:50,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223804666] [2025-03-08 16:16:50,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:50,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:16:50,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:16:50,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:16:50,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:50,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:16:51,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:16:51,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223804666] [2025-03-08 16:16:51,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223804666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:51,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:51,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:16:51,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916601646] [2025-03-08 16:16:51,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:51,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:16:51,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:16:51,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:16:51,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:16:51,387 INFO L87 Difference]: Start difference. First operand 176 states and 221 transitions. Second operand has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:16:51,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:51,715 INFO L93 Difference]: Finished difference Result 369 states and 463 transitions. [2025-03-08 16:16:51,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:16:51,716 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2025-03-08 16:16:51,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:51,717 INFO L225 Difference]: With dead ends: 369 [2025-03-08 16:16:51,719 INFO L226 Difference]: Without dead ends: 240 [2025-03-08 16:16:51,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:16:51,720 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 211 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:51,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 774 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:16:51,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-08 16:16:51,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 193. [2025-03-08 16:16:51,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 154 states have (on average 1.2142857142857142) internal successors, (187), 155 states have internal predecessors, (187), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:16:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 243 transitions. [2025-03-08 16:16:51,738 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 243 transitions. Word has length 129 [2025-03-08 16:16:51,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:51,739 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 243 transitions. [2025-03-08 16:16:51,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:16:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 243 transitions. [2025-03-08 16:16:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:16:51,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:51,741 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:16:51,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:16:51,741 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:51,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:51,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2084178462, now seen corresponding path program 1 times [2025-03-08 16:16:51,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:16:51,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240209360] [2025-03-08 16:16:51,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:51,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:16:51,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:16:51,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:16:51,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:51,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:16:51,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:16:51,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240209360] [2025-03-08 16:16:51,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240209360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:51,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:51,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:16:51,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415924629] [2025-03-08 16:16:51,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:51,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:16:51,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:16:51,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:16:51,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:16:51,950 INFO L87 Difference]: Start difference. First operand 193 states and 243 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:16:52,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:52,039 INFO L93 Difference]: Finished difference Result 343 states and 429 transitions. [2025-03-08 16:16:52,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:16:52,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-08 16:16:52,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:52,041 INFO L225 Difference]: With dead ends: 343 [2025-03-08 16:16:52,041 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 16:16:52,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:16:52,042 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 183 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:52,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 297 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:16:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 16:16:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-03-08 16:16:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 157 states have (on average 1.2038216560509554) internal successors, (189), 158 states have internal predecessors, (189), 28 states have call successors, (28), 11 states have call predecessors, (28), 11 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:16:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 245 transitions. [2025-03-08 16:16:52,056 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 245 transitions. Word has length 131 [2025-03-08 16:16:52,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:52,057 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 245 transitions. [2025-03-08 16:16:52,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:16:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 245 transitions. [2025-03-08 16:16:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:16:52,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:52,058 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:16:52,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:16:52,058 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:52,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:52,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2143782081, now seen corresponding path program 1 times [2025-03-08 16:16:52,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:16:52,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440336016] [2025-03-08 16:16:52,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:52,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:16:52,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:16:52,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:16:52,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:52,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:16:52,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:16:52,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440336016] [2025-03-08 16:16:52,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440336016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:16:52,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137214291] [2025-03-08 16:16:52,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:52,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:16:52,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:16:52,592 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:16:52,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 16:16:52,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:16:52,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:16:52,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:52,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:52,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 16:16:52,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:16:52,868 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 13 [2025-03-08 16:16:53,415 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 38 treesize of output 16 [2025-03-08 16:16:53,448 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 27 treesize of output 22 [2025-03-08 16:16:53,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:16:53,503 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 34 treesize of output 12 [2025-03-08 16:16:53,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 16:16:53,590 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 28 treesize of output 10 [2025-03-08 16:16:53,625 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 283 proven. 54 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-03-08 16:16:53,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:16:54,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-08 16:16:54,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2025-03-08 16:16:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 54 proven. 63 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2025-03-08 16:16:54,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137214291] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:16:54,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:16:54,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 20] total 46 [2025-03-08 16:16:54,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814486649] [2025-03-08 16:16:54,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:16:54,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 16:16:54,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:16:54,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 16:16:54,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1699, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 16:16:54,714 INFO L87 Difference]: Start difference. First operand 197 states and 245 transitions. Second operand has 46 states, 39 states have (on average 3.3333333333333335) internal successors, (130), 44 states have internal predecessors, (130), 14 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (38), 9 states have call predecessors, (38), 14 states have call successors, (38) [2025-03-08 16:16:56,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:56,307 INFO L93 Difference]: Finished difference Result 367 states and 447 transitions. [2025-03-08 16:16:56,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 16:16:56,307 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 39 states have (on average 3.3333333333333335) internal successors, (130), 44 states have internal predecessors, (130), 14 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (38), 9 states have call predecessors, (38), 14 states have call successors, (38) Word has length 131 [2025-03-08 16:16:56,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:56,309 INFO L225 Difference]: With dead ends: 367 [2025-03-08 16:16:56,310 INFO L226 Difference]: Without dead ends: 221 [2025-03-08 16:16:56,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1042, Invalid=3928, Unknown=0, NotChecked=0, Total=4970 [2025-03-08 16:16:56,315 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 624 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:56,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 1096 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1347 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:16:56,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-08 16:16:56,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 197. [2025-03-08 16:16:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 159 states have (on average 1.1949685534591195) internal successors, (190), 160 states have internal predecessors, (190), 24 states have call successors, (24), 13 states have call predecessors, (24), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 16:16:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 238 transitions. [2025-03-08 16:16:56,335 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 238 transitions. Word has length 131 [2025-03-08 16:16:56,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:56,338 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 238 transitions. [2025-03-08 16:16:56,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 39 states have (on average 3.3333333333333335) internal successors, (130), 44 states have internal predecessors, (130), 14 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (38), 9 states have call predecessors, (38), 14 states have call successors, (38) [2025-03-08 16:16:56,338 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 238 transitions. [2025-03-08 16:16:56,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 16:16:56,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:56,339 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:16:56,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 16:16:56,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 16:16:56,540 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:56,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:56,540 INFO L85 PathProgramCache]: Analyzing trace with hash 394746961, now seen corresponding path program 1 times [2025-03-08 16:16:56,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:16:56,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880445414] [2025-03-08 16:16:56,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:56,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:16:56,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:16:56,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:16:56,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:56,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:16:56,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:16:56,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880445414] [2025-03-08 16:16:56,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880445414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:16:56,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45898660] [2025-03-08 16:16:56,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:56,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:16:56,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:16:56,667 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:16:56,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 16:16:56,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:16:56,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:16:56,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:56,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:56,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:16:56,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:16:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:16:56,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:16:56,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45898660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:56,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:16:56,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-08 16:16:56,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41504120] [2025-03-08 16:16:56,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:56,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:16:56,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:16:56,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:16:56,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:16:56,876 INFO L87 Difference]: Start difference. First operand 197 states and 238 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:16:56,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:56,930 INFO L93 Difference]: Finished difference Result 355 states and 430 transitions. [2025-03-08 16:16:56,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:16:56,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2025-03-08 16:16:56,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:56,932 INFO L225 Difference]: With dead ends: 355 [2025-03-08 16:16:56,932 INFO L226 Difference]: Without dead ends: 201 [2025-03-08 16:16:56,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:16:56,933 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:56,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 656 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:16:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-08 16:16:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2025-03-08 16:16:56,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 160 states have (on average 1.19375) internal successors, (191), 161 states have internal predecessors, (191), 24 states have call successors, (24), 13 states have call predecessors, (24), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 16:16:56,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 239 transitions. [2025-03-08 16:16:56,956 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 239 transitions. Word has length 133 [2025-03-08 16:16:56,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:56,957 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 239 transitions. [2025-03-08 16:16:56,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:16:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 239 transitions. [2025-03-08 16:16:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:16:56,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:56,958 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:16:56,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 16:16:57,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 16:16:57,163 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:57,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:57,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2108827514, now seen corresponding path program 1 times [2025-03-08 16:16:57,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:16:57,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369471169] [2025-03-08 16:16:57,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:57,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:16:57,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:16:57,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:16:57,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:57,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:16:57,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218892451] [2025-03-08 16:16:57,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:57,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:16:57,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:16:57,232 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:16:57,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 16:16:57,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:16:57,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:16:57,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:57,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:57,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 16:16:57,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:16:57,517 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-03-08 16:16:57,568 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 13 [2025-03-08 16:16:57,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-08 16:16:57,769 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 73 treesize of output 59 [2025-03-08 16:16:57,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 69 [2025-03-08 16:16:57,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 9 [2025-03-08 16:16:57,863 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-03-08 16:16:57,884 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 49 treesize of output 40 [2025-03-08 16:16:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-08 16:16:57,949 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:16:57,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:16:57,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369471169] [2025-03-08 16:16:57,950 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:16:57,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218892451] [2025-03-08 16:16:57,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218892451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:57,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:57,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:16:57,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207958718] [2025-03-08 16:16:57,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:57,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:16:57,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:16:57,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:16:57,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:16:57,951 INFO L87 Difference]: Start difference. First operand 198 states and 239 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:16:58,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:58,269 INFO L93 Difference]: Finished difference Result 482 states and 588 transitions. [2025-03-08 16:16:58,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:16:58,269 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2025-03-08 16:16:58,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:58,272 INFO L225 Difference]: With dead ends: 482 [2025-03-08 16:16:58,272 INFO L226 Difference]: Without dead ends: 327 [2025-03-08 16:16:58,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:16:58,272 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 113 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:58,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 531 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:16:58,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-08 16:16:58,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 234. [2025-03-08 16:16:58,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 186 states have (on average 1.1720430107526882) internal successors, (218), 186 states have internal predecessors, (218), 30 states have call successors, (30), 17 states have call predecessors, (30), 17 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:16:58,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 278 transitions. [2025-03-08 16:16:58,295 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 278 transitions. Word has length 135 [2025-03-08 16:16:58,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:58,295 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 278 transitions. [2025-03-08 16:16:58,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:16:58,295 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 278 transitions. [2025-03-08 16:16:58,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:16:58,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:58,297 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:16:58,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 16:16:58,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 16:16:58,501 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:58,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:58,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1835339845, now seen corresponding path program 1 times [2025-03-08 16:16:58,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:16:58,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819805105] [2025-03-08 16:16:58,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:58,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:16:58,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:16:58,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:16:58,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:58,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:16:58,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2011684368] [2025-03-08 16:16:58,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:58,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:16:58,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:16:58,565 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:16:58,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 16:16:58,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:16:58,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:16:58,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:58,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:16:58,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 16:16:58,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:16:58,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 19 treesize of output 1 [2025-03-08 16:16:58,845 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 13 [2025-03-08 16:16:58,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-08 16:16:58,923 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-03-08 16:16:58,926 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 64 treesize of output 51 [2025-03-08 16:16:58,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2025-03-08 16:16:58,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 [2025-03-08 16:16:58,989 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 43 treesize of output 34 [2025-03-08 16:16:59,080 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 32 treesize of output 20 [2025-03-08 16:16:59,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:16:59,086 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 40 treesize of output 16 [2025-03-08 16:16:59,139 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-08 16:16:59,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:16:59,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:16:59,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819805105] [2025-03-08 16:16:59,140 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:16:59,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011684368] [2025-03-08 16:16:59,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011684368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:16:59,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:16:59,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:16:59,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248955917] [2025-03-08 16:16:59,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:16:59,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:16:59,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:16:59,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:16:59,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:16:59,141 INFO L87 Difference]: Start difference. First operand 234 states and 278 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:16:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:16:59,516 INFO L93 Difference]: Finished difference Result 391 states and 470 transitions. [2025-03-08 16:16:59,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:16:59,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2025-03-08 16:16:59,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:16:59,517 INFO L225 Difference]: With dead ends: 391 [2025-03-08 16:16:59,518 INFO L226 Difference]: Without dead ends: 236 [2025-03-08 16:16:59,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:16:59,518 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 190 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:16:59,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 655 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:16:59,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-08 16:16:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-03-08 16:16:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 188 states have (on average 1.1702127659574468) internal successors, (220), 188 states have internal predecessors, (220), 30 states have call successors, (30), 17 states have call predecessors, (30), 17 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:16:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 280 transitions. [2025-03-08 16:16:59,541 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 280 transitions. Word has length 135 [2025-03-08 16:16:59,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:16:59,541 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 280 transitions. [2025-03-08 16:16:59,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:16:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 280 transitions. [2025-03-08 16:16:59,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:16:59,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:16:59,542 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:16:59,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 16:16:59,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:16:59,743 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:16:59,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:16:59,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2050803226, now seen corresponding path program 1 times [2025-03-08 16:16:59,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:16:59,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122620189] [2025-03-08 16:16:59,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:59,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:16:59,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:16:59,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:16:59,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:16:59,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:16:59,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1719208190] [2025-03-08 16:16:59,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:16:59,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:16:59,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:16:59,798 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:16:59,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 16:16:59,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:17:00,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:17:00,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:00,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:17:00,140 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:17:00,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:17:00,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:17:00,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:00,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:17:00,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:17:00,483 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:17:00,485 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:17:00,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 16:17:00,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:17:00,689 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-03-08 16:17:00,765 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:17:00,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:17:00 BoogieIcfgContainer [2025-03-08 16:17:00,769 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:17:00,770 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:17:00,770 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:17:00,770 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:17:00,771 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:16:40" (3/4) ... [2025-03-08 16:17:00,772 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:17:00,773 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:17:00,774 INFO L158 Benchmark]: Toolchain (without parser) took 20869.90ms. Allocated memory was 167.8MB in the beginning and 587.2MB in the end (delta: 419.4MB). Free memory was 122.9MB in the beginning and 373.1MB in the end (delta: -250.2MB). Peak memory consumption was 168.5MB. Max. memory is 16.1GB. [2025-03-08 16:17:00,774 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:17:00,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.14ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 108.6MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:17:00,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.68ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 104.3MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:17:00,774 INFO L158 Benchmark]: Boogie Preprocessor took 68.56ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 100.3MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:17:00,775 INFO L158 Benchmark]: IcfgBuilder took 517.90ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 63.4MB in the end (delta: 36.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 16:17:00,775 INFO L158 Benchmark]: TraceAbstraction took 20037.29ms. Allocated memory was 167.8MB in the beginning and 587.2MB in the end (delta: 419.4MB). Free memory was 63.4MB in the beginning and 373.2MB in the end (delta: -309.8MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. [2025-03-08 16:17:00,775 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 587.2MB. Free memory was 373.2MB in the beginning and 373.1MB in the end (delta: 189.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:17:00,776 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.19ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.14ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 108.6MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.68ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 104.3MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.56ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 100.3MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 517.90ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 63.4MB in the end (delta: 36.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20037.29ms. Allocated memory was 167.8MB in the beginning and 587.2MB in the end (delta: 419.4MB). Free memory was 63.4MB in the beginning and 373.2MB in the end (delta: -309.8MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 587.2MB. Free memory was 373.2MB in the beginning and 373.1MB in the end (delta: 189.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[1] = { 25.1 }; [L22-L24] float float_Array_0[1] = { 25.1 }; [L25-L27] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L25-L27] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L25-L27] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L25-L27] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L25-L27] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L25-L27] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L28-L30] signed long int signed_long_int_Array_0[2] = { -128, 256 }; [L28-L30] signed long int signed_long_int_Array_0[2] = { -128, 256 }; [L28-L30] signed long int signed_long_int_Array_0[2] = { -128, 256 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -16 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -16 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 8 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 8 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 8 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 2531521428 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 2531521428 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 100, 59049 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 100, 59049 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 100, 59049 }; VAL [float_Array_0={4:0}, isInitial=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] FCALL updateLastVariables() [L105] CALL updateVariables() [L70] float_Array_0[0] = __VERIFIER_nondet_float() [L71] EXPR float_Array_0[0] [L71] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L71] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L71] EXPR float_Array_0[0] [L71] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L71] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L71] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L71] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L71] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L72] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L73] EXPR signed_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L73] CALL assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L73] RET assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L74] EXPR signed_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[0] <= 31) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[0] <= 31) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L75] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L76] EXPR signed_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L76] CALL assume_abort_if_not(signed_char_Array_0[1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L76] RET assume_abort_if_not(signed_char_Array_0[1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L77] EXPR signed_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L79] EXPR signed_char_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L79] CALL assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L79] RET assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] EXPR signed_char_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L81] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L84] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L85] EXPR unsigned_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L86] EXPR unsigned_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L86] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967295) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L86] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967295) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L88] EXPR unsigned_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] EXPR unsigned_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L90] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 32767) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 32767) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L92] EXPR unsigned_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L105] RET updateVariables() [L106] CALL step() [L46] EXPR signed_char_Array_0[1] [L46] signed_long_int_Array_0[0] = signed_char_Array_0[1] [L47] EXPR signed_long_int_Array_0[0] [L47] signed_short_int_Array_0[0] = signed_long_int_Array_0[0] [L48] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L48] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) [L48] EXPR signed_long_int_Array_0[0] [L48] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L48] signed long int stepLocal_0 = (((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])); [L49] EXPR unsigned_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L49] COND FALSE !(unsigned_short_int_Array_0[1] <= stepLocal_0) [L52] EXPR signed_char_Array_0[2] [L52] signed_char_Array_0[3] = signed_char_Array_0[2] [L54] EXPR signed_short_int_Array_0[0] [L54] signed_long_int_Array_0[1] = signed_short_int_Array_0[0] [L55] EXPR unsigned_short_int_Array_0[1] [L55] EXPR unsigned_short_int_Array_0[0] [L55] EXPR signed_long_int_Array_0[1] [L55] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L55] EXPR (unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L55] COND FALSE !(((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) [L58] EXPR unsigned_char_Array_0[0] [L58] unsigned_char_Array_0[1] = unsigned_char_Array_0[0] [L60] EXPR unsigned_char_Array_0[1] [L60] unsigned char stepLocal_1 = unsigned_char_Array_0[1]; [L61] EXPR float_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L61] COND FALSE !(2.75f > float_Array_0[0]) [L64] EXPR unsigned_long_int_Array_0[0] [L64] EXPR signed_long_int_Array_0[0] [L64] EXPR signed_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L64] EXPR ((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1]) [L64] EXPR signed_char_Array_0[1] [L64] EXPR ((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=0, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L64] COND TRUE (unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > stepLocal_1 [L65] EXPR signed_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L65] EXPR ((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5)) [L65] EXPR signed_char_Array_0[1] [L65] EXPR ((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5)) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L65] EXPR signed_char_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L65] EXPR ((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]) [L65] EXPR signed_char_Array_0[2] [L65] EXPR ((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L65] signed_char_Array_0[4] = ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))) [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR unsigned_short_int_Array_0[1] [L97] EXPR unsigned_short_int_Array_0[0] [L97] EXPR signed_long_int_Array_0[1] [L97] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) [L97] EXPR unsigned_char_Array_0[1] [L97] EXPR unsigned_char_Array_0[0] [L97] EXPR (((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2]))) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2]))) [L97] EXPR unsigned_short_int_Array_0[1] [L97] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) [L97] EXPR signed_long_int_Array_0[0] [L97] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])) [L97] EXPR signed_char_Array_0[3] [L97] EXPR signed_char_Array_0[2] [L97] EXPR (unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2]))) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1)) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1)) [L97] EXPR float_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1) [L97] EXPR signed_char_Array_0[4] [L97] EXPR signed_char_Array_0[2] [L97] EXPR signed_char_Array_0[1] [L97] EXPR (2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1)) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) && (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) && (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) && (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[0]))) && (signed_short_int_Array_0[0] == ((signed short int) signed_long_int_Array_0[0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) && (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[0]))) && (signed_short_int_Array_0[0] == ((signed short int) signed_long_int_Array_0[0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97-L98] return ((((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) && (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[0]))) && (signed_short_int_Array_0[0] == ((signed short int) signed_long_int_Array_0[0])) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L19] reach_error() VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 167 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.9s, OverallIterations: 19, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3151 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3140 mSDsluCounter, 10498 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8054 mSDsCounter, 650 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4616 IncrementalHoareTripleChecker+Invalid, 5266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 650 mSolverCounterUnsat, 2444 mSDtfsCounter, 4616 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1503 GetRequests, 1280 SyntacticMatches, 4 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1731 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=18, InterpolantAutomatonStates: 159, 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, 221 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 3491 NumberOfCodeBlocks, 3491 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3310 ConstructedInterpolants, 1 QuantifiedInterpolants, 15782 SizeOfPredicates, 55 NumberOfNonLiveVariables, 3543 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 26 InterpolantComputations, 15 PerfectInterpolantSequences, 10574/10920 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-03-08 16:17:00,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 90de0053d184a453dc3a33f57409c1c246f48963f5fd9431c484b6f29206cf7b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:17:02,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:17:02,766 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:17:02,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:17:02,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:17:02,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:17:02,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:17:02,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:17:02,795 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:17:02,796 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:17:02,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:17:02,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:17:02,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:17:02,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:17:02,797 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:17:02,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:17:02,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:17:02,798 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:17:02,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:17:02,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:17:02,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:17:02,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:17:02,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:17:02,798 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:17:02,799 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:17:02,799 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:17:02,799 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:17:02,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:17:02,799 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:17:02,799 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:17:02,799 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:17:02,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:17:02,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:17:02,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:17:02,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:17:02,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:17:02,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:17:02,800 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:17:02,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:17:02,800 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:17:02,800 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:17:02,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:17:02,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:17:02,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:17:02,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:17:02,801 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/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 -> 90de0053d184a453dc3a33f57409c1c246f48963f5fd9431c484b6f29206cf7b [2025-03-08 16:17:03,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:17:03,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:17:03,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:17:03,043 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:17:03,043 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:17:03,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i [2025-03-08 16:17:04,192 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad4462700/86d373e5729c4e35b14e2220aac52376/FLAG4b8c10402 [2025-03-08 16:17:04,393 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:17:04,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i [2025-03-08 16:17:04,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad4462700/86d373e5729c4e35b14e2220aac52376/FLAG4b8c10402 [2025-03-08 16:17:04,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad4462700/86d373e5729c4e35b14e2220aac52376 [2025-03-08 16:17:04,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:17:04,765 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:17:04,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:17:04,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:17:04,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:17:04,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:17:04" (1/1) ... [2025-03-08 16:17:04,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@163fcfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:04, skipping insertion in model container [2025-03-08 16:17:04,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:17:04" (1/1) ... [2025-03-08 16:17:04,780 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:17:04,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i[916,929] [2025-03-08 16:17:04,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:17:04,919 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:17:04,927 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i[916,929] [2025-03-08 16:17:04,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:17:04,964 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:17:04,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:04 WrapperNode [2025-03-08 16:17:04,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:17:04,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:17:04,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:17:04,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:17:04,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:04" (1/1) ... [2025-03-08 16:17:04,984 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:04" (1/1) ... [2025-03-08 16:17:05,018 INFO L138 Inliner]: procedures = 36, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 450 [2025-03-08 16:17:05,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:17:05,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:17:05,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:17:05,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:17:05,030 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:04" (1/1) ... [2025-03-08 16:17:05,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:04" (1/1) ... [2025-03-08 16:17:05,038 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:04" (1/1) ... [2025-03-08 16:17:05,059 INFO L175 MemorySlicer]: Split 124 memory accesses to 8 slices as follows [2, 8, 52, 20, 7, 15, 6, 14]. 42 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 2, 1, 2, 1, 2]. The 17 writes are split as follows [0, 1, 7, 2, 1, 3, 1, 2]. [2025-03-08 16:17:05,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:04" (1/1) ... [2025-03-08 16:17:05,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:04" (1/1) ... [2025-03-08 16:17:05,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:04" (1/1) ... [2025-03-08 16:17:05,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:04" (1/1) ... [2025-03-08 16:17:05,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:04" (1/1) ... [2025-03-08 16:17:05,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:04" (1/1) ... [2025-03-08 16:17:05,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:17:05,103 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:17:05,103 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:17:05,103 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:17:05,104 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:04" (1/1) ... [2025-03-08 16:17:05,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:17:05,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:17:05,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:17:05,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:17:05,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:17:05,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:17:05,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:17:05,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-08 16:17:05,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-08 16:17:05,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-08 16:17:05,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-08 16:17:05,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-08 16:17:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-08 16:17:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-08 16:17:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-08 16:17:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-08 16:17:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-08 16:17:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-08 16:17:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-08 16:17:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-08 16:17:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-08 16:17:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-08 16:17:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-08 16:17:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-08 16:17:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-08 16:17:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-08 16:17:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-08 16:17:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:17:05,158 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:17:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:17:05,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:17:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:17:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:17:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-08 16:17:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-08 16:17:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-08 16:17:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-08 16:17:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-08 16:17:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-08 16:17:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-08 16:17:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-08 16:17:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-08 16:17:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-08 16:17:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-08 16:17:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-08 16:17:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-08 16:17:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-03-08 16:17:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 16:17:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 16:17:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-08 16:17:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-08 16:17:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-08 16:17:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-08 16:17:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-08 16:17:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-08 16:17:05,286 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:17:05,288 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:17:05,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite78#1;havoc property_#t~mem75#1;havoc property_#t~mem74#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem83#1;havoc property_#t~mem79#1;havoc property_#t~ite82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~short91#1;havoc property_#t~mem92#1;havoc property_#t~ite114#1;havoc property_#t~mem95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem101#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem102#1;havoc property_#t~ite113#1;havoc property_#t~mem112#1;havoc property_#t~mem103#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem106#1;havoc property_#t~ite111#1;havoc property_#t~mem107#1;havoc property_#t~ite109#1;havoc property_#t~mem108#1;havoc property_#t~mem110#1;havoc property_#t~short115#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short124#1; [2025-03-08 16:17:05,751 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-03-08 16:17:05,751 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:17:05,761 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:17:05,762 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:17:05,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:17:05 BoogieIcfgContainer [2025-03-08 16:17:05,762 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:17:05,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:17:05,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:17:05,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:17:05,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:17:04" (1/3) ... [2025-03-08 16:17:05,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69355689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:17:05, skipping insertion in model container [2025-03-08 16:17:05,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:04" (2/3) ... [2025-03-08 16:17:05,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69355689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:17:05, skipping insertion in model container [2025-03-08 16:17:05,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:17:05" (3/3) ... [2025-03-08 16:17:05,770 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-37.i [2025-03-08 16:17:05,779 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:17:05,780 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-37.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:17:05,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:17:05,821 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;@68b4d776, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:17:05,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:17:05,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:17:05,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:17:05,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:05,834 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:05,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:05,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:05,839 INFO L85 PathProgramCache]: Analyzing trace with hash 563256062, now seen corresponding path program 1 times [2025-03-08 16:17:05,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:05,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080006039] [2025-03-08 16:17:05,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:05,847 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-03-08 16:17:05,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:05,849 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:05,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:05,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:17:06,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:17:06,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:06,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:06,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:17:06,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-08 16:17:06,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:17:06,148 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:06,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080006039] [2025-03-08 16:17:06,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080006039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:17:06,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:17:06,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:17:06,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773220982] [2025-03-08 16:17:06,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:06,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:17:06,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:06,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:17:06,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:17:06,173 INFO L87 Difference]: Start difference. First operand has 96 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:17:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:06,190 INFO L93 Difference]: Finished difference Result 186 states and 286 transitions. [2025-03-08 16:17:06,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:17:06,191 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2025-03-08 16:17:06,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:06,195 INFO L225 Difference]: With dead ends: 186 [2025-03-08 16:17:06,196 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 16:17:06,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 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-03-08 16:17:06,200 INFO L435 NwaCegarLoop]: 133 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, 133 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-03-08 16:17:06,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:17:06,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 16:17:06,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-08 16:17:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:17:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2025-03-08 16:17:06,229 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 122 [2025-03-08 16:17:06,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:06,229 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2025-03-08 16:17:06,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:17:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2025-03-08 16:17:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:17:06,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:06,234 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:06,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:06,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:06,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:06,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:06,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1458994097, now seen corresponding path program 1 times [2025-03-08 16:17:06,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:06,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776481213] [2025-03-08 16:17:06,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:06,437 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-03-08 16:17:06,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:06,438 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:06,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:06,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:17:06,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:17:06,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:06,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:06,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:17:06,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:06,704 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:17:06,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:17:06,704 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:06,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776481213] [2025-03-08 16:17:06,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776481213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:17:06,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:17:06,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:17:06,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092362868] [2025-03-08 16:17:06,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:06,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:17:06,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:06,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:17:06,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:17:06,708 INFO L87 Difference]: Start difference. First operand 93 states and 133 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:06,764 INFO L93 Difference]: Finished difference Result 188 states and 270 transitions. [2025-03-08 16:17:06,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:17:06,765 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-03-08 16:17:06,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:06,768 INFO L225 Difference]: With dead ends: 188 [2025-03-08 16:17:06,768 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 16:17:06,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:17:06,770 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:06,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 496 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:17:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 16:17:06,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-08 16:17:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:17:06,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2025-03-08 16:17:06,784 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 122 [2025-03-08 16:17:06,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:06,786 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2025-03-08 16:17:06,787 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:06,787 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2025-03-08 16:17:06,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:17:06,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:06,789 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:06,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:06,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:06,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:06,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:06,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1028518736, now seen corresponding path program 1 times [2025-03-08 16:17:06,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:06,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122976608] [2025-03-08 16:17:06,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:06,991 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-03-08 16:17:06,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:06,993 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:06,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:07,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:17:07,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:17:07,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:07,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:07,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:17:07,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:17:07,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:17:07,256 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:07,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122976608] [2025-03-08 16:17:07,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122976608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:17:07,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:17:07,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:17:07,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410155031] [2025-03-08 16:17:07,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:07,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:17:07,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:07,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:17:07,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:17:07,258 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:07,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:07,318 INFO L93 Difference]: Finished difference Result 194 states and 275 transitions. [2025-03-08 16:17:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:17:07,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-03-08 16:17:07,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:07,322 INFO L225 Difference]: With dead ends: 194 [2025-03-08 16:17:07,322 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 16:17:07,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 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-03-08 16:17:07,323 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:07,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 610 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:17:07,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 16:17:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-03-08 16:17:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.329268292682927) internal successors, (109), 82 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:17:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2025-03-08 16:17:07,331 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 122 [2025-03-08 16:17:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:07,331 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2025-03-08 16:17:07,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:07,331 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2025-03-08 16:17:07,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:17:07,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:07,334 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:07,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:07,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:07,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:07,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:07,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1916022417, now seen corresponding path program 1 times [2025-03-08 16:17:07,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:07,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940659738] [2025-03-08 16:17:07,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:07,535 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-03-08 16:17:07,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:07,537 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:07,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:07,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:17:07,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:17:07,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:07,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:07,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:17:07,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:07,769 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:17:07,769 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:17:07,769 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:07,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940659738] [2025-03-08 16:17:07,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940659738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:17:07,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:17:07,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:17:07,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746482731] [2025-03-08 16:17:07,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:07,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:17:07,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:07,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:17:07,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:17:07,771 INFO L87 Difference]: Start difference. First operand 99 states and 139 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:07,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:07,822 INFO L93 Difference]: Finished difference Result 198 states and 279 transitions. [2025-03-08 16:17:07,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:17:07,822 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-03-08 16:17:07,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:07,823 INFO L225 Difference]: With dead ends: 198 [2025-03-08 16:17:07,823 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 16:17:07,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 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-03-08 16:17:07,824 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 725 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:07,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 725 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:17:07,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 16:17:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-08 16:17:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 84 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:17:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2025-03-08 16:17:07,829 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 122 [2025-03-08 16:17:07,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:07,829 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2025-03-08 16:17:07,829 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:07,829 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2025-03-08 16:17:07,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:17:07,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:07,830 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:07,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:08,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:08,031 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:08,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:08,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1916945938, now seen corresponding path program 1 times [2025-03-08 16:17:08,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:08,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677749072] [2025-03-08 16:17:08,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:08,032 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-03-08 16:17:08,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:08,037 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:08,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:08,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:17:08,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:17:08,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:08,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:08,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 16:17:08,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:08,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2025-03-08 16:17:08,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 16:17:08,394 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 25 treesize of output 13 [2025-03-08 16:17:08,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-08 16:17:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 92 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-08 16:17:08,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:17:08,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2025-03-08 16:17:08,630 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:08,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677749072] [2025-03-08 16:17:08,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677749072] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:17:08,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [103788558] [2025-03-08 16:17:08,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:08,630 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:17:08,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:17:08,651 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 16:17:08,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-08 16:17:08,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:17:09,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:17:09,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:09,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:09,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 16:17:09,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:09,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2025-03-08 16:17:09,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 16:17:09,133 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 25 treesize of output 13 [2025-03-08 16:17:09,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-08 16:17:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 92 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-08 16:17:09,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:17:09,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2025-03-08 16:17:09,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [103788558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:17:09,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:17:09,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-08 16:17:09,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628759888] [2025-03-08 16:17:09,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:17:09,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:17:09,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:09,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:17:09,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:17:09,260 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 16:17:09,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:09,707 INFO L93 Difference]: Finished difference Result 207 states and 287 transitions. [2025-03-08 16:17:09,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:17:09,708 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 122 [2025-03-08 16:17:09,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:09,709 INFO L225 Difference]: With dead ends: 207 [2025-03-08 16:17:09,709 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 16:17:09,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 281 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:17:09,711 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 109 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:09,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 648 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:17:09,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 16:17:09,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2025-03-08 16:17:09,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.303370786516854) internal successors, (116), 89 states have internal predecessors, (116), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:17:09,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2025-03-08 16:17:09,722 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 146 transitions. Word has length 122 [2025-03-08 16:17:09,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:09,722 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 146 transitions. [2025-03-08 16:17:09,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 16:17:09,724 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 146 transitions. [2025-03-08 16:17:09,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:17:09,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:09,725 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:09,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-03-08 16:17:09,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:10,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:10,126 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:10,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:10,126 INFO L85 PathProgramCache]: Analyzing trace with hash 2128296851, now seen corresponding path program 1 times [2025-03-08 16:17:10,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:10,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524073662] [2025-03-08 16:17:10,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:10,127 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-03-08 16:17:10,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:10,130 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:10,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:10,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:17:10,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:17:10,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:10,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:10,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 16:17:10,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:10,367 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-03-08 16:17:10,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:17:10,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 16:17:10,565 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 16:17:10,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:17:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:17:10,752 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:10,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524073662] [2025-03-08 16:17:10,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524073662] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:17:10,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:17:10,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2025-03-08 16:17:10,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56721254] [2025-03-08 16:17:10,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:17:10,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:17:10,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:10,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:17:10,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:17:10,755 INFO L87 Difference]: Start difference. First operand 107 states and 146 transitions. Second operand has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-08 16:17:11,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:11,099 INFO L93 Difference]: Finished difference Result 215 states and 292 transitions. [2025-03-08 16:17:11,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:17:11,100 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) Word has length 122 [2025-03-08 16:17:11,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:11,101 INFO L225 Difference]: With dead ends: 215 [2025-03-08 16:17:11,101 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 16:17:11,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:17:11,102 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 244 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:11,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 370 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:17:11,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 16:17:11,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2025-03-08 16:17:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.288888888888889) internal successors, (116), 90 states have internal predecessors, (116), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:17:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 146 transitions. [2025-03-08 16:17:11,114 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 146 transitions. Word has length 122 [2025-03-08 16:17:11,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:11,114 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 146 transitions. [2025-03-08 16:17:11,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-08 16:17:11,114 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 146 transitions. [2025-03-08 16:17:11,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:17:11,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:11,117 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:11,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:11,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:11,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:11,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:11,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1133256877, now seen corresponding path program 1 times [2025-03-08 16:17:11,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:11,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353013672] [2025-03-08 16:17:11,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:11,319 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-03-08 16:17:11,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:11,321 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:11,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:11,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:17:11,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:17:11,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:11,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:11,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 16:17:11,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:11,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2025-03-08 16:17:11,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 13 treesize of output 9 [2025-03-08 16:17:11,598 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 25 treesize of output 13 [2025-03-08 16:17:11,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-08 16:17:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 92 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-08 16:17:11,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:17:11,723 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 32 treesize of output 20 [2025-03-08 16:17:11,765 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:11,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353013672] [2025-03-08 16:17:11,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353013672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:17:11,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [522640672] [2025-03-08 16:17:11,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:11,765 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:17:11,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:17:11,768 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 16:17:11,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-08 16:17:11,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:17:12,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:17:12,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:12,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:12,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 16:17:12,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:12,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2025-03-08 16:17:12,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 16:17:12,250 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 25 treesize of output 13 [2025-03-08 16:17:12,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-08 16:17:12,281 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 92 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-08 16:17:12,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:17:12,295 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 32 treesize of output 20 [2025-03-08 16:17:12,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [522640672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:17:12,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:17:12,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-08 16:17:12,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646036610] [2025-03-08 16:17:12,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:17:12,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:17:12,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:12,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:17:12,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:17:12,345 INFO L87 Difference]: Start difference. First operand 109 states and 146 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 16:17:12,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:12,737 INFO L93 Difference]: Finished difference Result 217 states and 291 transitions. [2025-03-08 16:17:12,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:17:12,739 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 122 [2025-03-08 16:17:12,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:12,740 INFO L225 Difference]: With dead ends: 217 [2025-03-08 16:17:12,740 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 16:17:12,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 281 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:17:12,741 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 105 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:12,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 642 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:17:12,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 16:17:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2025-03-08 16:17:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 90 states have internal predecessors, (115), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:17:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 145 transitions. [2025-03-08 16:17:12,751 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 145 transitions. Word has length 122 [2025-03-08 16:17:12,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:12,751 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 145 transitions. [2025-03-08 16:17:12,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 16:17:12,751 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 145 transitions. [2025-03-08 16:17:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:17:12,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:12,752 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:12,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:12,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-03-08 16:17:13,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 16:17:13,153 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:13,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:13,153 INFO L85 PathProgramCache]: Analyzing trace with hash -921905964, now seen corresponding path program 1 times [2025-03-08 16:17:13,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:13,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240340464] [2025-03-08 16:17:13,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:13,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:17:13,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:13,155 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:13,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:13,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:17:13,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:17:13,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:13,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:13,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 16:17:13,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:13,407 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-03-08 16:17:13,507 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-03-08 16:17:13,645 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-03-08 16:17:13,775 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 29 treesize of output 13 [2025-03-08 16:17:13,997 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 42 treesize of output 24 [2025-03-08 16:17:14,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 16:17:14,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-08 16:17:14,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-03-08 16:17:14,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-03-08 16:17:14,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:17:14,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2025-03-08 16:17:14,197 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 260 proven. 54 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-08 16:17:14,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:17:17,532 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:17,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240340464] [2025-03-08 16:17:17,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240340464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:17:17,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1092602749] [2025-03-08 16:17:17,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:17,533 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:17:17,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:17:17,535 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 16:17:17,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-03-08 16:17:17,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:17:18,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:17:18,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:18,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:18,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 16:17:18,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:18,305 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-03-08 16:17:18,896 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 33 treesize of output 17 [2025-03-08 16:17:20,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2025-03-08 16:17:20,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 16:17:20,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-08 16:17:21,209 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 57 treesize of output 44 [2025-03-08 16:17:21,427 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 193 proven. 6 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2025-03-08 16:17:21,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:17:28,628 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 73 treesize of output 49 [2025-03-08 16:17:30,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1092602749] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:17:30,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:17:30,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 35 [2025-03-08 16:17:30,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120219289] [2025-03-08 16:17:30,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:17:30,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 16:17:30,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:30,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 16:17:30,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=2118, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 16:17:30,328 INFO L87 Difference]: Start difference. First operand 109 states and 145 transitions. Second operand has 35 states, 29 states have (on average 3.8620689655172415) internal successors, (112), 32 states have internal predecessors, (112), 12 states have call successors, (30), 9 states have call predecessors, (30), 12 states have return successors, (30), 9 states have call predecessors, (30), 12 states have call successors, (30) [2025-03-08 16:17:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:38,325 INFO L93 Difference]: Finished difference Result 270 states and 351 transitions. [2025-03-08 16:17:38,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 16:17:38,326 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 29 states have (on average 3.8620689655172415) internal successors, (112), 32 states have internal predecessors, (112), 12 states have call successors, (30), 9 states have call predecessors, (30), 12 states have return successors, (30), 9 states have call predecessors, (30), 12 states have call successors, (30) Word has length 122 [2025-03-08 16:17:38,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:38,327 INFO L225 Difference]: With dead ends: 270 [2025-03-08 16:17:38,327 INFO L226 Difference]: Without dead ends: 164 [2025-03-08 16:17:38,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2200 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=1396, Invalid=6976, Unknown=0, NotChecked=0, Total=8372 [2025-03-08 16:17:38,330 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 565 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 1886 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:38,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1252 Invalid, 2080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1886 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 16:17:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-08 16:17:38,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 157. [2025-03-08 16:17:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 122 states have (on average 1.221311475409836) internal successors, (149), 123 states have internal predecessors, (149), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 16:17:38,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 201 transitions. [2025-03-08 16:17:38,356 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 201 transitions. Word has length 122 [2025-03-08 16:17:38,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:38,357 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 201 transitions. [2025-03-08 16:17:38,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 29 states have (on average 3.8620689655172415) internal successors, (112), 32 states have internal predecessors, (112), 12 states have call successors, (30), 9 states have call predecessors, (30), 12 states have return successors, (30), 9 states have call predecessors, (30), 12 states have call successors, (30) [2025-03-08 16:17:38,357 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 201 transitions. [2025-03-08 16:17:38,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:17:38,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:38,358 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:38,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:38,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2025-03-08 16:17:38,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 16:17:38,759 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:38,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:38,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1766377835, now seen corresponding path program 1 times [2025-03-08 16:17:38,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:38,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643855742] [2025-03-08 16:17:38,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:38,760 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-03-08 16:17:38,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:38,762 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:38,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:38,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:17:38,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:17:38,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:38,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:38,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 16:17:38,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:38,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2025-03-08 16:17:38,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 16:17:38,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-08 16:17:39,026 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 50 treesize of output 41 [2025-03-08 16:17:39,419 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 74 treesize of output 58 [2025-03-08 16:17:39,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:17:39,432 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 93 treesize of output 55 [2025-03-08 16:17:39,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:17:39,442 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 50 treesize of output 30 [2025-03-08 16:17:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:17:39,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:17:39,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:39,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643855742] [2025-03-08 16:17:39,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643855742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:17:39,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:17:39,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:17:39,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2372602] [2025-03-08 16:17:39,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:39,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:17:39,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:39,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:17:39,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:17:39,614 INFO L87 Difference]: Start difference. First operand 157 states and 201 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:41,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:41,029 INFO L93 Difference]: Finished difference Result 297 states and 374 transitions. [2025-03-08 16:17:41,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:17:41,029 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-03-08 16:17:41,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:41,030 INFO L225 Difference]: With dead ends: 297 [2025-03-08 16:17:41,030 INFO L226 Difference]: Without dead ends: 179 [2025-03-08 16:17:41,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:17:41,031 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 121 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:41,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 730 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 16:17:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-08 16:17:41,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2025-03-08 16:17:41,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 135 states have (on average 1.1925925925925926) internal successors, (161), 136 states have internal predecessors, (161), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:17:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 221 transitions. [2025-03-08 16:17:41,048 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 221 transitions. Word has length 122 [2025-03-08 16:17:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:41,048 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 221 transitions. [2025-03-08 16:17:41,048 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:41,048 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 221 transitions. [2025-03-08 16:17:41,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:17:41,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:41,049 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:41,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:41,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:41,250 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:41,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:41,250 INFO L85 PathProgramCache]: Analyzing trace with hash -258826026, now seen corresponding path program 1 times [2025-03-08 16:17:41,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:41,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092870158] [2025-03-08 16:17:41,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:41,251 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-03-08 16:17:41,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:41,252 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:41,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-03-08 16:17:41,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:17:41,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:17:41,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:41,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:41,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 16:17:41,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:41,516 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-03-08 16:17:41,530 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-03-08 16:17:41,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:17:41,546 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 60 treesize of output 30 [2025-03-08 16:17:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:17:41,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:17:41,560 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:41,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092870158] [2025-03-08 16:17:41,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092870158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:17:41,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:17:41,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:17:41,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237273664] [2025-03-08 16:17:41,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:41,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:17:41,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:41,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:17:41,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:17:41,561 INFO L87 Difference]: Start difference. First operand 177 states and 221 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:41,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:41,651 INFO L93 Difference]: Finished difference Result 297 states and 371 transitions. [2025-03-08 16:17:41,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:17:41,652 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-03-08 16:17:41,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:41,653 INFO L225 Difference]: With dead ends: 297 [2025-03-08 16:17:41,653 INFO L226 Difference]: Without dead ends: 179 [2025-03-08 16:17:41,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 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-03-08 16:17:41,654 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 91 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:41,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 523 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:17:41,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-08 16:17:41,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-03-08 16:17:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 136 states have (on average 1.1838235294117647) internal successors, (161), 137 states have internal predecessors, (161), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:17:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 221 transitions. [2025-03-08 16:17:41,672 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 221 transitions. Word has length 122 [2025-03-08 16:17:41,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:41,673 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 221 transitions. [2025-03-08 16:17:41,673 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 221 transitions. [2025-03-08 16:17:41,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:17:41,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:41,674 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:41,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-03-08 16:17:41,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:41,874 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:41,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:41,875 INFO L85 PathProgramCache]: Analyzing trace with hash -722136084, now seen corresponding path program 1 times [2025-03-08 16:17:41,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:41,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100617601] [2025-03-08 16:17:41,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:41,875 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-03-08 16:17:41,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:41,878 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:41,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:41,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:17:42,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:17:42,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:42,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:42,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 16:17:42,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:42,157 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-03-08 16:17:42,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-03-08 16:17:42,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:17:42,473 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 41 treesize of output 23 [2025-03-08 16:17:42,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 16:17:42,506 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 13 [2025-03-08 16:17:42,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 16:17:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 192 proven. 33 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2025-03-08 16:17:42,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:17:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:17:42,756 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:42,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100617601] [2025-03-08 16:17:42,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100617601] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:17:42,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:17:42,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2025-03-08 16:17:42,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477186300] [2025-03-08 16:17:42,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:17:42,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:17:42,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:42,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:17:42,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:17:42,757 INFO L87 Difference]: Start difference. First operand 179 states and 221 transitions. Second operand has 14 states, 12 states have (on average 7.5) internal successors, (90), 14 states have internal predecessors, (90), 5 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2025-03-08 16:17:43,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:43,761 INFO L93 Difference]: Finished difference Result 309 states and 380 transitions. [2025-03-08 16:17:43,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 16:17:43,761 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 14 states have internal predecessors, (90), 5 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) Word has length 125 [2025-03-08 16:17:43,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:43,762 INFO L225 Difference]: With dead ends: 309 [2025-03-08 16:17:43,762 INFO L226 Difference]: Without dead ends: 189 [2025-03-08 16:17:43,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2025-03-08 16:17:43,764 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 394 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:43,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 629 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:17:43,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-08 16:17:43,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 179. [2025-03-08 16:17:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 136 states have (on average 1.1764705882352942) internal successors, (160), 137 states have internal predecessors, (160), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:17:43,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 220 transitions. [2025-03-08 16:17:43,784 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 220 transitions. Word has length 125 [2025-03-08 16:17:43,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:43,784 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 220 transitions. [2025-03-08 16:17:43,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 14 states have internal predecessors, (90), 5 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2025-03-08 16:17:43,784 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 220 transitions. [2025-03-08 16:17:43,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:17:43,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:43,785 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:43,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:43,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:43,985 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:43,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:43,986 INFO L85 PathProgramCache]: Analyzing trace with hash 785415725, now seen corresponding path program 1 times [2025-03-08 16:17:43,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:43,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638128758] [2025-03-08 16:17:43,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:43,986 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-03-08 16:17:43,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:43,988 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:43,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:44,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:17:44,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:17:44,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:44,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:44,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 16:17:44,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:44,272 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-03-08 16:17:44,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-03-08 16:17:44,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:17:44,691 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 41 treesize of output 23 [2025-03-08 16:17:44,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 16:17:44,746 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 13 [2025-03-08 16:17:44,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-08 16:17:44,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 16:17:44,876 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 252 proven. 33 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-08 16:17:44,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:17:45,132 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 33 treesize of output 21 [2025-03-08 16:17:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:17:45,167 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:45,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638128758] [2025-03-08 16:17:45,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638128758] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:17:45,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:17:45,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-03-08 16:17:45,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276191678] [2025-03-08 16:17:45,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:17:45,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 16:17:45,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:45,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 16:17:45,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:17:45,169 INFO L87 Difference]: Start difference. First operand 179 states and 220 transitions. Second operand has 21 states, 18 states have (on average 5.444444444444445) internal successors, (98), 21 states have internal predecessors, (98), 8 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (27), 5 states have call predecessors, (27), 8 states have call successors, (27) [2025-03-08 16:17:47,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:47,991 INFO L93 Difference]: Finished difference Result 317 states and 384 transitions. [2025-03-08 16:17:47,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 16:17:47,991 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 5.444444444444445) internal successors, (98), 21 states have internal predecessors, (98), 8 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (27), 5 states have call predecessors, (27), 8 states have call successors, (27) Word has length 125 [2025-03-08 16:17:47,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:47,993 INFO L225 Difference]: With dead ends: 317 [2025-03-08 16:17:47,993 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 16:17:47,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=624, Invalid=2682, Unknown=0, NotChecked=0, Total=3306 [2025-03-08 16:17:47,994 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 508 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:47,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 737 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 16:17:47,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 16:17:48,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 167. [2025-03-08 16:17:48,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 129 states have (on average 1.178294573643411) internal successors, (152), 130 states have internal predecessors, (152), 26 states have call successors, (26), 11 states have call predecessors, (26), 11 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 16:17:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 204 transitions. [2025-03-08 16:17:48,012 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 204 transitions. Word has length 125 [2025-03-08 16:17:48,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:48,012 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 204 transitions. [2025-03-08 16:17:48,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 5.444444444444445) internal successors, (98), 21 states have internal predecessors, (98), 8 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (27), 5 states have call predecessors, (27), 8 states have call successors, (27) [2025-03-08 16:17:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 204 transitions. [2025-03-08 16:17:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:17:48,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:48,013 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:48,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:48,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:48,214 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:48,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:48,214 INFO L85 PathProgramCache]: Analyzing trace with hash 279857100, now seen corresponding path program 1 times [2025-03-08 16:17:48,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:48,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232260381] [2025-03-08 16:17:48,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:48,215 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-03-08 16:17:48,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:48,216 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:48,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:48,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:17:48,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:17:48,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:48,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:48,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 16:17:48,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:48,448 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-03-08 16:17:48,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 35 [2025-03-08 16:17:48,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:17:48,923 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 69 treesize of output 38 [2025-03-08 16:17:48,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:17:48,991 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 98 treesize of output 44 [2025-03-08 16:17:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 48 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-03-08 16:17:49,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:17:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:17:49,154 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:49,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232260381] [2025-03-08 16:17:49,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232260381] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:17:49,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:17:49,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 17 [2025-03-08 16:17:49,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733285151] [2025-03-08 16:17:49,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:49,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:17:49,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:49,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:17:49,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:17:49,155 INFO L87 Difference]: Start difference. First operand 167 states and 204 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:49,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:49,356 INFO L93 Difference]: Finished difference Result 289 states and 352 transitions. [2025-03-08 16:17:49,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:17:49,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2025-03-08 16:17:49,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:49,358 INFO L225 Difference]: With dead ends: 289 [2025-03-08 16:17:49,358 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 16:17:49,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:17:49,359 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 75 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:49,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 539 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:17:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 16:17:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-03-08 16:17:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 131 states have internal predecessors, (152), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 16:17:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 204 transitions. [2025-03-08 16:17:49,384 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 204 transitions. Word has length 125 [2025-03-08 16:17:49,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:49,384 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 204 transitions. [2025-03-08 16:17:49,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 204 transitions. [2025-03-08 16:17:49,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 16:17:49,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:49,385 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:49,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:49,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:49,585 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:49,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:49,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1793878169, now seen corresponding path program 1 times [2025-03-08 16:17:49,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:49,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004573299] [2025-03-08 16:17:49,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:49,586 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-03-08 16:17:49,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:49,588 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:49,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:49,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:17:49,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:17:49,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:49,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:49,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 16:17:49,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:49,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-08 16:17:50,044 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 47 treesize of output 34 [2025-03-08 16:17:50,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-08 16:17:50,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-08 16:17:50,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:17:50,721 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 55 treesize of output 36 [2025-03-08 16:17:50,782 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 48 treesize of output 28 [2025-03-08 16:17:50,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:17:50,845 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 55 treesize of output 36 [2025-03-08 16:17:51,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:17:51,126 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 36 treesize of output 18 [2025-03-08 16:17:51,190 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 51 treesize of output 39 [2025-03-08 16:17:51,193 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 52 treesize of output 32 [2025-03-08 16:17:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 60 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-03-08 16:17:51,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:17:51,405 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:17:51,405 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:51,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004573299] [2025-03-08 16:17:51,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004573299] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:17:51,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:17:51,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 20 [2025-03-08 16:17:51,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306820541] [2025-03-08 16:17:51,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:51,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:17:51,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:51,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:17:51,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:17:51,406 INFO L87 Difference]: Start difference. First operand 169 states and 204 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:51,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:51,531 INFO L93 Difference]: Finished difference Result 196 states and 232 transitions. [2025-03-08 16:17:51,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:17:51,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-03-08 16:17:51,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:51,533 INFO L225 Difference]: With dead ends: 196 [2025-03-08 16:17:51,533 INFO L226 Difference]: Without dead ends: 194 [2025-03-08 16:17:51,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2025-03-08 16:17:51,534 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 101 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:51,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 728 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:17:51,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-08 16:17:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 172. [2025-03-08 16:17:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 133 states have (on average 1.1654135338345866) internal successors, (155), 134 states have internal predecessors, (155), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 16:17:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 207 transitions. [2025-03-08 16:17:51,554 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 207 transitions. Word has length 127 [2025-03-08 16:17:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:51,554 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 207 transitions. [2025-03-08 16:17:51,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:51,555 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 207 transitions. [2025-03-08 16:17:51,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 16:17:51,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:51,555 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:51,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:51,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:51,756 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:51,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:51,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1792954648, now seen corresponding path program 1 times [2025-03-08 16:17:51,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:51,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133836824] [2025-03-08 16:17:51,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:51,757 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-03-08 16:17:51,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:51,759 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:51,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:51,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:17:51,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:17:51,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:51,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:51,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 16:17:51,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:51,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-08 16:17:52,014 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:17:52,014 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:17:52,014 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:52,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133836824] [2025-03-08 16:17:52,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133836824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:17:52,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:17:52,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:17:52,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257918613] [2025-03-08 16:17:52,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:52,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:17:52,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:52,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:17:52,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:17:52,015 INFO L87 Difference]: Start difference. First operand 172 states and 207 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:52,094 INFO L93 Difference]: Finished difference Result 319 states and 380 transitions. [2025-03-08 16:17:52,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:17:52,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-03-08 16:17:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:52,095 INFO L225 Difference]: With dead ends: 319 [2025-03-08 16:17:52,095 INFO L226 Difference]: Without dead ends: 194 [2025-03-08 16:17:52,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 123 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-03-08 16:17:52,096 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 101 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:52,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 571 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:17:52,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-08 16:17:52,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 172. [2025-03-08 16:17:52,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 133 states have (on average 1.1578947368421053) internal successors, (154), 134 states have internal predecessors, (154), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 16:17:52,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 206 transitions. [2025-03-08 16:17:52,124 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 206 transitions. Word has length 127 [2025-03-08 16:17:52,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:52,124 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 206 transitions. [2025-03-08 16:17:52,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:52,124 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 206 transitions. [2025-03-08 16:17:52,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 16:17:52,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:52,125 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:52,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2025-03-08 16:17:52,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:52,325 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:52,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:52,326 INFO L85 PathProgramCache]: Analyzing trace with hash -905450967, now seen corresponding path program 1 times [2025-03-08 16:17:52,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:52,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691445249] [2025-03-08 16:17:52,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:52,326 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-03-08 16:17:52,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:52,328 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:52,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:52,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:17:52,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:17:52,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:52,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:52,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 16:17:52,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:52,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-08 16:17:52,639 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 30 treesize of output 14 [2025-03-08 16:17:52,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-08 16:17:52,799 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 23 [2025-03-08 16:17:52,807 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 35 treesize of output 19 [2025-03-08 16:17:52,827 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 23 [2025-03-08 16:17:52,934 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-08 16:17:52,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:17:52,935 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:52,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691445249] [2025-03-08 16:17:52,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691445249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:17:52,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:17:52,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:17:52,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353558102] [2025-03-08 16:17:52,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:52,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:17:52,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:52,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:17:52,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:17:52,936 INFO L87 Difference]: Start difference. First operand 172 states and 206 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:17:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:53,178 INFO L93 Difference]: Finished difference Result 297 states and 355 transitions. [2025-03-08 16:17:53,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:17:53,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2025-03-08 16:17:53,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:53,180 INFO L225 Difference]: With dead ends: 297 [2025-03-08 16:17:53,180 INFO L226 Difference]: Without dead ends: 172 [2025-03-08 16:17:53,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:17:53,180 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 83 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:53,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 331 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:17:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-08 16:17:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-03-08 16:17:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 133 states have (on average 1.150375939849624) internal successors, (153), 134 states have internal predecessors, (153), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 16:17:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 205 transitions. [2025-03-08 16:17:53,202 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 205 transitions. Word has length 127 [2025-03-08 16:17:53,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:53,203 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 205 transitions. [2025-03-08 16:17:53,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:17:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 205 transitions. [2025-03-08 16:17:53,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 16:17:53,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:53,203 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:53,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2025-03-08 16:17:53,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:53,406 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:53,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:53,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1582061866, now seen corresponding path program 1 times [2025-03-08 16:17:53,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:53,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287290901] [2025-03-08 16:17:53,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:53,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-03-08 16:17:53,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:53,408 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:53,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2025-03-08 16:17:53,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:17:53,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:17:53,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:53,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:53,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 16:17:53,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:53,728 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-03-08 16:17:53,812 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 42 treesize of output 20 [2025-03-08 16:17:54,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:17:54,464 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 64 treesize of output 39 [2025-03-08 16:17:54,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:17:54,496 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 78 treesize of output 56 [2025-03-08 16:17:54,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:17:54,670 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 146 treesize of output 68 [2025-03-08 16:17:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 197 proven. 96 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-08 16:17:54,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:17:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:17:54,878 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:54,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287290901] [2025-03-08 16:17:54,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287290901] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:17:54,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:17:54,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [22] total 24 [2025-03-08 16:17:54,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567489404] [2025-03-08 16:17:54,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:54,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:17:54,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:54,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:17:54,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:17:54,879 INFO L87 Difference]: Start difference. First operand 172 states and 205 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:55,069 INFO L93 Difference]: Finished difference Result 357 states and 426 transitions. [2025-03-08 16:17:55,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:17:55,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-03-08 16:17:55,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:55,071 INFO L225 Difference]: With dead ends: 357 [2025-03-08 16:17:55,071 INFO L226 Difference]: Without dead ends: 232 [2025-03-08 16:17:55,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2025-03-08 16:17:55,072 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 56 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 624 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-03-08 16:17:55,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 624 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:17:55,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-08 16:17:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 185. [2025-03-08 16:17:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 146 states have (on average 1.143835616438356) internal successors, (167), 147 states have internal predecessors, (167), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 16:17:55,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 219 transitions. [2025-03-08 16:17:55,103 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 219 transitions. Word has length 127 [2025-03-08 16:17:55,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:55,103 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 219 transitions. [2025-03-08 16:17:55,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:55,103 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2025-03-08 16:17:55,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:17:55,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:55,104 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:55,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2025-03-08 16:17:55,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:55,304 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:55,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:55,305 INFO L85 PathProgramCache]: Analyzing trace with hash 87451133, now seen corresponding path program 1 times [2025-03-08 16:17:55,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:55,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401034591] [2025-03-08 16:17:55,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:55,305 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-03-08 16:17:55,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:55,307 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:55,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2025-03-08 16:17:55,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:17:55,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:17:55,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:55,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:55,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 16:17:55,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:56,310 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 70 treesize of output 34 [2025-03-08 16:17:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:17:56,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:17:56,342 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:56,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401034591] [2025-03-08 16:17:56,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401034591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:17:56,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:17:56,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:17:56,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405589639] [2025-03-08 16:17:56,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:56,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:17:56,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:56,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:17:56,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:17:56,343 INFO L87 Difference]: Start difference. First operand 185 states and 219 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:56,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:56,823 INFO L93 Difference]: Finished difference Result 479 states and 561 transitions. [2025-03-08 16:17:56,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:17:56,827 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-08 16:17:56,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:56,829 INFO L225 Difference]: With dead ends: 479 [2025-03-08 16:17:56,829 INFO L226 Difference]: Without dead ends: 341 [2025-03-08 16:17:56,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:17:56,829 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 209 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:56,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 513 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:17:56,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-08 16:17:56,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 296. [2025-03-08 16:17:56,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 219 states have (on average 1.1050228310502284) internal successors, (242), 221 states have internal predecessors, (242), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:17:56,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 346 transitions. [2025-03-08 16:17:56,873 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 346 transitions. Word has length 129 [2025-03-08 16:17:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:56,874 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 346 transitions. [2025-03-08 16:17:56,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 346 transitions. [2025-03-08 16:17:56,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:17:56,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:56,876 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:56,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2025-03-08 16:17:57,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:57,076 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:57,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:57,077 INFO L85 PathProgramCache]: Analyzing trace with hash 560970076, now seen corresponding path program 1 times [2025-03-08 16:17:57,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:57,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057577474] [2025-03-08 16:17:57,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:57,077 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-03-08 16:17:57,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:57,079 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:57,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2025-03-08 16:17:57,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:17:57,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:17:57,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:57,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:57,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:17:57,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:17:57,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:17:57,266 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:57,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057577474] [2025-03-08 16:17:57,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057577474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:17:57,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:17:57,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:17:57,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923994727] [2025-03-08 16:17:57,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:57,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:17:57,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:57,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:17:57,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:17:57,267 INFO L87 Difference]: Start difference. First operand 296 states and 346 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:57,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:57,331 INFO L93 Difference]: Finished difference Result 543 states and 632 transitions. [2025-03-08 16:17:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:17:57,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-08 16:17:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:57,337 INFO L225 Difference]: With dead ends: 543 [2025-03-08 16:17:57,337 INFO L226 Difference]: Without dead ends: 296 [2025-03-08 16:17:57,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 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-03-08 16:17:57,338 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:57,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 362 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:17:57,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-08 16:17:57,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-03-08 16:17:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 219 states have (on average 1.095890410958904) internal successors, (240), 221 states have internal predecessors, (240), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:17:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 344 transitions. [2025-03-08 16:17:57,379 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 344 transitions. Word has length 129 [2025-03-08 16:17:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:57,379 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 344 transitions. [2025-03-08 16:17:57,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 344 transitions. [2025-03-08 16:17:57,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:17:57,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:57,380 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:57,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2025-03-08 16:17:57,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:57,580 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:57,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:57,581 INFO L85 PathProgramCache]: Analyzing trace with hash -556923841, now seen corresponding path program 1 times [2025-03-08 16:17:57,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:57,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349509879] [2025-03-08 16:17:57,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:57,581 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-03-08 16:17:57,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:57,585 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:57,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2025-03-08 16:17:57,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:17:57,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:17:57,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:57,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:57,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 16:17:57,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:58,445 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 69 treesize of output 33 [2025-03-08 16:17:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:17:58,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:17:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:17:58,621 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:58,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349509879] [2025-03-08 16:17:58,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349509879] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:17:58,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:17:58,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-03-08 16:17:58,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222348706] [2025-03-08 16:17:58,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:58,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:17:58,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:58,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:17:58,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:17:58,622 INFO L87 Difference]: Start difference. First operand 296 states and 344 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:58,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:58,745 INFO L93 Difference]: Finished difference Result 538 states and 623 transitions. [2025-03-08 16:17:58,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:17:58,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-08 16:17:58,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:58,747 INFO L225 Difference]: With dead ends: 538 [2025-03-08 16:17:58,747 INFO L226 Difference]: Without dead ends: 328 [2025-03-08 16:17:58,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:17:58,748 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 47 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:58,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 505 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:17:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-08 16:17:58,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 296. [2025-03-08 16:17:58,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 219 states have (on average 1.091324200913242) internal successors, (239), 221 states have internal predecessors, (239), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:17:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 343 transitions. [2025-03-08 16:17:58,795 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 343 transitions. Word has length 131 [2025-03-08 16:17:58,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:58,795 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 343 transitions. [2025-03-08 16:17:58,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 343 transitions. [2025-03-08 16:17:58,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:17:58,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:58,796 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:58,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2025-03-08 16:17:58,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:58,996 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:58,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:58,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1106869478, now seen corresponding path program 1 times [2025-03-08 16:17:58,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:58,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012159698] [2025-03-08 16:17:58,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:58,997 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-03-08 16:17:58,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:58,999 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:59,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2025-03-08 16:17:59,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:17:59,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:17:59,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:59,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:59,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:17:59,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:17:59,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:17:59,227 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:59,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012159698] [2025-03-08 16:17:59,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012159698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:17:59,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:17:59,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:17:59,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646806898] [2025-03-08 16:17:59,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:59,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:17:59,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:59,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:17:59,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:17:59,228 INFO L87 Difference]: Start difference. First operand 296 states and 343 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:59,310 INFO L93 Difference]: Finished difference Result 510 states and 588 transitions. [2025-03-08 16:17:59,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:17:59,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-08 16:17:59,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:59,312 INFO L225 Difference]: With dead ends: 510 [2025-03-08 16:17:59,312 INFO L226 Difference]: Without dead ends: 300 [2025-03-08 16:17:59,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 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-03-08 16:17:59,313 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:59,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 596 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:17:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-08 16:17:59,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2025-03-08 16:17:59,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 220 states have (on average 1.0909090909090908) internal successors, (240), 222 states have internal predecessors, (240), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:17:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 344 transitions. [2025-03-08 16:17:59,361 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 344 transitions. Word has length 131 [2025-03-08 16:17:59,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:59,361 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 344 transitions. [2025-03-08 16:17:59,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:17:59,361 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 344 transitions. [2025-03-08 16:17:59,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:17:59,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:59,362 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:17:59,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2025-03-08 16:17:59,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:59,563 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:59,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1778916703, now seen corresponding path program 1 times [2025-03-08 16:17:59,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:59,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327869587] [2025-03-08 16:17:59,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:59,564 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-03-08 16:17:59,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:59,566 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:17:59,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2025-03-08 16:17:59,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:17:59,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:17:59,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:59,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:59,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 16:17:59,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:18:00,627 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 70 treesize of output 34 [2025-03-08 16:18:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:18:00,659 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:18:00,659 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:18:00,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327869587] [2025-03-08 16:18:00,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327869587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:18:00,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:18:00,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:18:00,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724844097] [2025-03-08 16:18:00,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:18:00,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:18:00,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:18:00,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:18:00,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:18:00,661 INFO L87 Difference]: Start difference. First operand 297 states and 344 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:18:01,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:18:01,131 INFO L93 Difference]: Finished difference Result 531 states and 609 transitions. [2025-03-08 16:18:01,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:18:01,133 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-03-08 16:18:01,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:18:01,135 INFO L225 Difference]: With dead ends: 531 [2025-03-08 16:18:01,135 INFO L226 Difference]: Without dead ends: 320 [2025-03-08 16:18:01,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:18:01,136 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 135 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:18:01,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 511 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:18:01,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-08 16:18:01,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 307. [2025-03-08 16:18:01,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 230 states have (on average 1.0869565217391304) internal successors, (250), 232 states have internal predecessors, (250), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:18:01,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 354 transitions. [2025-03-08 16:18:01,185 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 354 transitions. Word has length 135 [2025-03-08 16:18:01,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:18:01,185 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 354 transitions. [2025-03-08 16:18:01,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:18:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 354 transitions. [2025-03-08 16:18:01,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 16:18:01,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:18:01,186 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:18:01,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2025-03-08 16:18:01,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:18:01,387 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:18:01,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:18:01,387 INFO L85 PathProgramCache]: Analyzing trace with hash 843874849, now seen corresponding path program 1 times [2025-03-08 16:18:01,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:18:01,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785810078] [2025-03-08 16:18:01,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:01,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:18:01,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:18:01,389 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:18:01,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2025-03-08 16:18:01,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 16:18:01,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 16:18:01,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:01,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:01,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 16:18:01,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:18:02,183 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 68 treesize of output 32 [2025-03-08 16:18:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:18:02,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:18:02,324 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:18:02,324 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:18:02,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785810078] [2025-03-08 16:18:02,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785810078] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:18:02,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:18:02,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-03-08 16:18:02,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215421445] [2025-03-08 16:18:02,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:18:02,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:18:02,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:18:02,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:18:02,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:18:02,325 INFO L87 Difference]: Start difference. First operand 307 states and 354 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:18:02,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:18:02,419 INFO L93 Difference]: Finished difference Result 541 states and 618 transitions. [2025-03-08 16:18:02,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:18:02,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2025-03-08 16:18:02,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:18:02,422 INFO L225 Difference]: With dead ends: 541 [2025-03-08 16:18:02,422 INFO L226 Difference]: Without dead ends: 320 [2025-03-08 16:18:02,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:18:02,423 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 28 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:18:02,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 347 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:18:02,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-08 16:18:02,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 297. [2025-03-08 16:18:02,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 220 states have (on average 1.0863636363636364) internal successors, (239), 222 states have internal predecessors, (239), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:18:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 343 transitions. [2025-03-08 16:18:02,473 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 343 transitions. Word has length 137 [2025-03-08 16:18:02,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:18:02,473 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 343 transitions. [2025-03-08 16:18:02,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:18:02,473 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 343 transitions. [2025-03-08 16:18:02,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:18:02,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:18:02,474 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:18:02,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2025-03-08 16:18:02,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:18:02,674 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:18:02,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:18:02,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1186208908, now seen corresponding path program 1 times [2025-03-08 16:18:02,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:18:02,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489751834] [2025-03-08 16:18:02,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:02,675 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-03-08 16:18:02,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:18:02,677 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-08 16:18:02,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2025-03-08 16:18:02,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:18:02,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:18:02,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:02,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:02,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 16:18:02,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:18:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 212 proven. 15 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2025-03-08 16:18:03,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:18:03,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-08 16:18:03,490 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:18:03,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489751834] [2025-03-08 16:18:03,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489751834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:18:03,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [602782692] [2025-03-08 16:18:03,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:03,491 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:18:03,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:18:03,493 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 16:18:03,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2025-03-08 16:18:03,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:18:04,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:18:04,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:04,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:04,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 16:18:04,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:18:04,151 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 15 treesize of output 7