./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 05:22:56,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:22:56,152 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:22:56,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:22:56,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:22:56,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:22:56,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:22:56,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:22:56,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:22:56,175 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:22:56,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:22:56,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:22:56,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:22:56,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:22:56,176 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:22:56,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:22:56,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:22:56,177 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:22:56,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:22:56,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:22:56,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:22:56,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:22:56,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:22:56,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:22:56,178 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:22:56,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:22:56,178 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:22:56,178 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:22:56,178 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:22:56,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:22:56,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:22:56,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:22:56,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:22:56,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:22:56,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:22:56,179 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:22:56,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:22:56,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:22:56,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:22:56,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:22:56,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:22:56,179 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:22:56,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:22:56,179 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-17 05:22:56,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:22:56,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:22:56,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:22:56,415 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:22:56,416 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:22:56,417 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-17 05:22:57,544 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00b19102e/c5f4cbd9aeac4b888d235960ca6fea64/FLAG43853cafc [2025-03-17 05:22:57,760 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:22:57,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i [2025-03-17 05:22:57,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00b19102e/c5f4cbd9aeac4b888d235960ca6fea64/FLAG43853cafc [2025-03-17 05:22:58,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00b19102e/c5f4cbd9aeac4b888d235960ca6fea64 [2025-03-17 05:22:58,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:22:58,114 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:22:58,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:22:58,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:22:58,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:22:58,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:22:58" (1/1) ... [2025-03-17 05:22:58,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4893e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:58, skipping insertion in model container [2025-03-17 05:22:58,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:22:58" (1/1) ... [2025-03-17 05:22:58,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:22:58,220 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-17 05:22:58,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:22:58,266 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:22:58,274 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-17 05:22:58,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:22:58,320 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:22:58,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:58 WrapperNode [2025-03-17 05:22:58,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:22:58,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:22:58,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:22:58,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:22:58,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:58" (1/1) ... [2025-03-17 05:22:58,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:58" (1/1) ... [2025-03-17 05:22:58,371 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 475 [2025-03-17 05:22:58,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:22:58,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:22:58,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:22:58,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:22:58,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:58" (1/1) ... [2025-03-17 05:22:58,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:58" (1/1) ... [2025-03-17 05:22:58,382 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:58" (1/1) ... [2025-03-17 05:22:58,398 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-17 05:22:58,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:58" (1/1) ... [2025-03-17 05:22:58,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:58" (1/1) ... [2025-03-17 05:22:58,413 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:58" (1/1) ... [2025-03-17 05:22:58,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:58" (1/1) ... [2025-03-17 05:22:58,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:58" (1/1) ... [2025-03-17 05:22:58,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:58" (1/1) ... [2025-03-17 05:22:58,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:22:58,434 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:22:58,435 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:22:58,435 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:22:58,435 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:58" (1/1) ... [2025-03-17 05:22:58,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:22:58,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:22:58,461 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-17 05:22:58,464 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-17 05:22:58,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:22:58,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:22:58,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:22:58,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:22:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:22:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:22:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:22:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-17 05:22:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-17 05:22:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:22:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:22:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:22:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:22:58,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:22:58,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:22:58,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:22:58,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:22:58,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:22:58,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:22:58,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:22:58,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:22:58,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:22:58,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:22:58,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-17 05:22:58,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-17 05:22:58,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:22:58,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:22:58,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:22:58,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:22:58,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:22:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:22:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:22:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:22:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:22:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:22:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:22:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:22:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:22:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:22:58,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-17 05:22:58,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-17 05:22:58,487 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:22:58,487 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:22:58,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:22:58,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:22:58,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:22:58,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:22:58,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:22:58,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:22:58,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:22:58,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:22:58,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:22:58,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:22:58,593 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:22:58,594 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:22:58,899 INFO L1322 $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-17 05:22:58,928 INFO L? ?]: Removed 138 outVars from TransFormulas that were not future-live. [2025-03-17 05:22:58,929 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:22:58,944 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:22:58,945 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:22:58,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:22:58 BoogieIcfgContainer [2025-03-17 05:22:58,945 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:22:58,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:22:58,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:22:58,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:22:58,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:22:58" (1/3) ... [2025-03-17 05:22:58,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aeedd5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:22:58, skipping insertion in model container [2025-03-17 05:22:58,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:58" (2/3) ... [2025-03-17 05:22:58,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aeedd5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:22:58, skipping insertion in model container [2025-03-17 05:22:58,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:22:58" (3/3) ... [2025-03-17 05:22:58,953 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-37.i [2025-03-17 05:22:58,963 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:22:58,965 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-37.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:22:59,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:22:59,017 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;@5105a53e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:22:59,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:22:59,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 82 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-17 05:22:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:22:59,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:59,027 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] [2025-03-17 05:22:59,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:59,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:59,030 INFO L85 PathProgramCache]: Analyzing trace with hash -514605387, now seen corresponding path program 1 times [2025-03-17 05:22:59,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:59,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007250034] [2025-03-17 05:22:59,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:59,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:59,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:22:59,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:22:59,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:59,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:59,290 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-17 05:22:59,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:59,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007250034] [2025-03-17 05:22:59,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007250034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:59,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125691429] [2025-03-17 05:22:59,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:59,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:22:59,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:22:59,293 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-17 05:22:59,306 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-17 05:22:59,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:22:59,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:22:59,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:59,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:59,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:22:59,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:59,502 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-17 05:22:59,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:59,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125691429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:59,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:22:59,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:22:59,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140063921] [2025-03-17 05:22:59,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:59,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:22:59,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:59,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:22:59,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:22:59,522 INFO L87 Difference]: Start difference. First operand has 99 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 82 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) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (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-17 05:22:59,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:59,550 INFO L93 Difference]: Finished difference Result 195 states and 307 transitions. [2025-03-17 05:22:59,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:22:59,553 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (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 120 [2025-03-17 05:22:59,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:59,558 INFO L225 Difference]: With dead ends: 195 [2025-03-17 05:22:59,558 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 05:22:59,560 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-17 05:22:59,563 INFO L435 NwaCegarLoop]: 141 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, 141 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-17 05:22:59,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:22:59,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 05:22:59,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-17 05:22:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 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-17 05:22:59,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2025-03-17 05:22:59,593 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 120 [2025-03-17 05:22:59,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:59,594 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2025-03-17 05:22:59,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (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-17 05:22:59,594 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2025-03-17 05:22:59,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:22:59,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:59,597 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] [2025-03-17 05:22:59,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:22:59,801 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-17 05:22:59,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:59,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:59,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1220149124, now seen corresponding path program 1 times [2025-03-17 05:22:59,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:59,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557718661] [2025-03-17 05:22:59,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:59,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:59,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:22:59,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:22:59,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:59,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:00,148 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-17 05:23:00,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:00,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557718661] [2025-03-17 05:23:00,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557718661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:00,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:00,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:23:00,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295368201] [2025-03-17 05:23:00,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:00,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:23:00,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:00,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:23:00,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:23:00,150 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (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-17 05:23:00,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:00,196 INFO L93 Difference]: Finished difference Result 196 states and 289 transitions. [2025-03-17 05:23:00,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:23:00,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (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 120 [2025-03-17 05:23:00,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:00,198 INFO L225 Difference]: With dead ends: 196 [2025-03-17 05:23:00,198 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 05:23:00,199 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-17 05:23:00,199 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 403 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-17 05:23:00,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 403 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:00,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 05:23:00,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-03-17 05:23:00,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 82 states have internal predecessors, (115), 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-17 05:23:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2025-03-17 05:23:00,212 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 120 [2025-03-17 05:23:00,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:00,213 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 145 transitions. [2025-03-17 05:23:00,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (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-17 05:23:00,213 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 145 transitions. [2025-03-17 05:23:00,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:23:00,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:00,217 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] [2025-03-17 05:23:00,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:23:00,218 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:00,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:00,218 INFO L85 PathProgramCache]: Analyzing trace with hash -587305339, now seen corresponding path program 1 times [2025-03-17 05:23:00,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:00,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283263389] [2025-03-17 05:23:00,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:00,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:00,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:23:00,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:23:00,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:00,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:00,378 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-17 05:23:00,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:00,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283263389] [2025-03-17 05:23:00,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283263389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:00,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:00,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:23:00,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300223836] [2025-03-17 05:23:00,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:00,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:23:00,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:00,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:23:00,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:23:00,381 INFO L87 Difference]: Start difference. First operand 99 states and 145 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (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-17 05:23:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:00,415 INFO L93 Difference]: Finished difference Result 200 states and 293 transitions. [2025-03-17 05:23:00,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:23:00,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (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 120 [2025-03-17 05:23:00,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:00,417 INFO L225 Difference]: With dead ends: 200 [2025-03-17 05:23:00,417 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 05:23:00,417 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-17 05:23:00,418 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 404 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-17 05:23:00,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 404 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:00,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 05:23:00,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-17 05:23:00,425 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-17 05:23:00,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2025-03-17 05:23:00,426 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 120 [2025-03-17 05:23:00,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:00,426 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2025-03-17 05:23:00,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (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-17 05:23:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2025-03-17 05:23:00,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:23:00,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:00,429 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] [2025-03-17 05:23:00,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:23:00,429 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:00,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:00,429 INFO L85 PathProgramCache]: Analyzing trace with hash 300198342, now seen corresponding path program 1 times [2025-03-17 05:23:00,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:00,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446728378] [2025-03-17 05:23:00,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:00,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:00,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:23:00,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:23:00,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:00,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:00,574 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-17 05:23:00,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:00,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446728378] [2025-03-17 05:23:00,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446728378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:00,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:00,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:23:00,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397558266] [2025-03-17 05:23:00,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:00,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:23:00,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:00,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:23:00,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:23:00,576 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (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-17 05:23:00,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:00,601 INFO L93 Difference]: Finished difference Result 204 states and 297 transitions. [2025-03-17 05:23:00,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:23:00,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (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 120 [2025-03-17 05:23:00,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:00,604 INFO L225 Difference]: With dead ends: 204 [2025-03-17 05:23:00,604 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 05:23:00,604 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-17 05:23:00,605 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 406 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-17 05:23:00,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 406 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:00,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 05:23:00,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-03-17 05:23:00,609 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-17 05:23:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2025-03-17 05:23:00,610 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 120 [2025-03-17 05:23:00,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:00,611 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2025-03-17 05:23:00,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (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-17 05:23:00,611 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2025-03-17 05:23:00,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:23:00,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:00,612 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] [2025-03-17 05:23:00,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:23:00,612 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:00,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:00,613 INFO L85 PathProgramCache]: Analyzing trace with hash 301121863, now seen corresponding path program 1 times [2025-03-17 05:23:00,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:00,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787157117] [2025-03-17 05:23:00,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:00,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:00,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:23:00,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:23:00,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:00,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:01,454 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-17 05:23:01,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:01,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787157117] [2025-03-17 05:23:01,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787157117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:01,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:01,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:23:01,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450007682] [2025-03-17 05:23:01,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:01,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:23:01,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:01,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:23:01,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:23:01,456 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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-17 05:23:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:01,562 INFO L93 Difference]: Finished difference Result 229 states and 330 transitions. [2025-03-17 05:23:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:23:01,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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 120 [2025-03-17 05:23:01,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:01,565 INFO L225 Difference]: With dead ends: 229 [2025-03-17 05:23:01,565 INFO L226 Difference]: Without dead ends: 127 [2025-03-17 05:23:01,566 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-17 05:23:01,566 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 97 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 696 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-17 05:23:01,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 696 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:23:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-17 05:23:01,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2025-03-17 05:23:01,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 102 states have internal predecessors, (136), 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-17 05:23:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2025-03-17 05:23:01,588 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 120 [2025-03-17 05:23:01,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:01,588 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2025-03-17 05:23:01,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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-17 05:23:01,588 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2025-03-17 05:23:01,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:23:01,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:01,590 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] [2025-03-17 05:23:01,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:23:01,590 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:01,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:01,591 INFO L85 PathProgramCache]: Analyzing trace with hash 539996281, now seen corresponding path program 1 times [2025-03-17 05:23:01,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:01,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808054024] [2025-03-17 05:23:01,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:01,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:01,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:23:01,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:23:01,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:01,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:02,114 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-17 05:23:02,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:02,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808054024] [2025-03-17 05:23:02,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808054024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:02,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:02,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:23:02,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137635060] [2025-03-17 05:23:02,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:02,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:23:02,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:02,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:23:02,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:23:02,116 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (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-17 05:23:02,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:02,227 INFO L93 Difference]: Finished difference Result 337 states and 478 transitions. [2025-03-17 05:23:02,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:23:02,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (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 123 [2025-03-17 05:23:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:02,229 INFO L225 Difference]: With dead ends: 337 [2025-03-17 05:23:02,229 INFO L226 Difference]: Without dead ends: 231 [2025-03-17 05:23:02,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-17 05:23:02,230 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 126 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:02,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 466 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:23:02,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-17 05:23:02,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2025-03-17 05:23:02,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 186 states have (on average 1.3494623655913978) internal successors, (251), 188 states have internal predecessors, (251), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 05:23:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 325 transitions. [2025-03-17 05:23:02,257 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 325 transitions. Word has length 123 [2025-03-17 05:23:02,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:02,258 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 325 transitions. [2025-03-17 05:23:02,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (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-17 05:23:02,259 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 325 transitions. [2025-03-17 05:23:02,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:23:02,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:02,260 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] [2025-03-17 05:23:02,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:23:02,261 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:02,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:02,262 INFO L85 PathProgramCache]: Analyzing trace with hash -967555528, now seen corresponding path program 1 times [2025-03-17 05:23:02,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:02,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597270209] [2025-03-17 05:23:02,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:02,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:02,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:23:02,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:23:02,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:02,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:02,694 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-17 05:23:02,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:02,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597270209] [2025-03-17 05:23:02,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597270209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:02,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860831352] [2025-03-17 05:23:02,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:02,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:23:02,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:23:02,697 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-17 05:23:02,698 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-17 05:23:02,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:23:02,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:23:02,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:02,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:02,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:23:02,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:02,964 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-17 05:23:03,060 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-17 05:23:03,069 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-17 05:23:03,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:03,219 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-17 05:23:03,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860831352] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:23:03,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:23:03,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-17 05:23:03,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134313580] [2025-03-17 05:23:03,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:23:03,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:23:03,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:03,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:23:03,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:23:03,222 INFO L87 Difference]: Start difference. First operand 228 states and 325 transitions. Second operand has 12 states, 9 states have (on average 7.111111111111111) internal successors, (64), 12 states have internal predecessors, (64), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 5 states have call successors, (28) [2025-03-17 05:23:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:03,458 INFO L93 Difference]: Finished difference Result 366 states and 512 transitions. [2025-03-17 05:23:03,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:23:03,459 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 7.111111111111111) internal successors, (64), 12 states have internal predecessors, (64), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 5 states have call successors, (28) Word has length 123 [2025-03-17 05:23:03,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:03,461 INFO L225 Difference]: With dead ends: 366 [2025-03-17 05:23:03,461 INFO L226 Difference]: Without dead ends: 158 [2025-03-17 05:23:03,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:23:03,463 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 184 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:03,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 405 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:23:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-17 05:23:03,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2025-03-17 05:23:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 118 states have (on average 1.2881355932203389) internal successors, (152), 119 states have internal predecessors, (152), 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-17 05:23:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 212 transitions. [2025-03-17 05:23:03,478 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 212 transitions. Word has length 123 [2025-03-17 05:23:03,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:03,479 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 212 transitions. [2025-03-17 05:23:03,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 7.111111111111111) internal successors, (64), 12 states have internal predecessors, (64), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 5 states have call successors, (28) [2025-03-17 05:23:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 212 transitions. [2025-03-17 05:23:03,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:23:03,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:03,480 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] [2025-03-17 05:23:03,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:23:03,680 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,SelfDestructingSolverStorable6 [2025-03-17 05:23:03,681 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:03,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:03,681 INFO L85 PathProgramCache]: Analyzing trace with hash 285259736, now seen corresponding path program 1 times [2025-03-17 05:23:03,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:03,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39381310] [2025-03-17 05:23:03,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:03,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:03,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:23:03,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:23:03,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:03,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:04,164 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-17 05:23:04,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:04,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39381310] [2025-03-17 05:23:04,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39381310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:04,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293062718] [2025-03-17 05:23:04,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:04,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:23:04,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:23:04,166 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-17 05:23:04,168 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-17 05:23:04,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:23:04,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:23:04,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:04,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:04,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 05:23:04,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:04,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 05:23:04,381 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-17 05:23:04,539 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-17 05:23:04,543 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-17 05:23:04,584 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-17 05:23:04,589 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-17 05:23:04,642 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-17 05:23:04,662 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-17 05:23:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 215 proven. 3 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-17 05:23:04,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:04,926 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-17 05:23:05,031 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-17 05:23:05,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293062718] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:23:05,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:23:05,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-03-17 05:23:05,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284770265] [2025-03-17 05:23:05,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:23:05,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 05:23:05,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:05,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 05:23:05,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:23:05,033 INFO L87 Difference]: Start difference. First operand 154 states and 212 transitions. Second operand has 24 states, 22 states have (on average 5.045454545454546) internal successors, (111), 24 states have internal predecessors, (111), 8 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 6 states have call predecessors, (39), 8 states have call successors, (39) [2025-03-17 05:23:05,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:05,986 INFO L93 Difference]: Finished difference Result 286 states and 383 transitions. [2025-03-17 05:23:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 05:23:05,987 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 5.045454545454546) internal successors, (111), 24 states have internal predecessors, (111), 8 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 6 states have call predecessors, (39), 8 states have call successors, (39) Word has length 123 [2025-03-17 05:23:05,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:05,988 INFO L225 Difference]: With dead ends: 286 [2025-03-17 05:23:05,988 INFO L226 Difference]: Without dead ends: 176 [2025-03-17 05:23:05,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=307, Invalid=1175, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 05:23:05,989 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 695 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:05,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 658 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:23:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-17 05:23:05,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 159. [2025-03-17 05:23:06,000 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), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:23:06,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 212 transitions. [2025-03-17 05:23:06,001 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 212 transitions. Word has length 123 [2025-03-17 05:23:06,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:06,001 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 212 transitions. [2025-03-17 05:23:06,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 5.045454545454546) internal successors, (111), 24 states have internal predecessors, (111), 8 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 6 states have call predecessors, (39), 8 states have call successors, (39) [2025-03-17 05:23:06,001 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 212 transitions. [2025-03-17 05:23:06,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:23:06,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:06,002 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] [2025-03-17 05:23:06,010 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-17 05:23:06,207 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-17 05:23:06,207 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:06,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:06,207 INFO L85 PathProgramCache]: Analyzing trace with hash -189279082, now seen corresponding path program 1 times [2025-03-17 05:23:06,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:06,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199434452] [2025-03-17 05:23:06,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:06,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:06,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:23:06,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:23:06,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:06,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:06,490 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-17 05:23:06,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:06,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199434452] [2025-03-17 05:23:06,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199434452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:06,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:06,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:23:06,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232487701] [2025-03-17 05:23:06,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:06,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:23:06,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:06,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:23:06,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:23:06,492 INFO L87 Difference]: Start difference. First operand 159 states and 212 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (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-17 05:23:06,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:06,613 INFO L93 Difference]: Finished difference Result 285 states and 377 transitions. [2025-03-17 05:23:06,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:23:06,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (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 123 [2025-03-17 05:23:06,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:06,615 INFO L225 Difference]: With dead ends: 285 [2025-03-17 05:23:06,616 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 05:23:06,616 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-17 05:23:06,617 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 94 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:06,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 578 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:23:06,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 05:23:06,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-03-17 05:23:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.255813953488372) internal successors, (162), 130 states have internal predecessors, (162), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:23:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 218 transitions. [2025-03-17 05:23:06,631 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 218 transitions. Word has length 123 [2025-03-17 05:23:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:06,631 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 218 transitions. [2025-03-17 05:23:06,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (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-17 05:23:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 218 transitions. [2025-03-17 05:23:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:23:06,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:06,632 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] [2025-03-17 05:23:06,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:23:06,632 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:06,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:06,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1191272266, now seen corresponding path program 1 times [2025-03-17 05:23:06,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:06,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060914013] [2025-03-17 05:23:06,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:06,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:06,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:23:06,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:23:06,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:06,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:06,806 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-17 05:23:06,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:06,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060914013] [2025-03-17 05:23:06,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060914013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:06,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:06,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:23:06,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601561985] [2025-03-17 05:23:06,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:06,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:23:06,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:06,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:23:06,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:23:06,807 INFO L87 Difference]: Start difference. First operand 166 states and 218 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (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-17 05:23:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:06,905 INFO L93 Difference]: Finished difference Result 299 states and 387 transitions. [2025-03-17 05:23:06,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:23:06,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (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 123 [2025-03-17 05:23:06,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:06,907 INFO L225 Difference]: With dead ends: 299 [2025-03-17 05:23:06,907 INFO L226 Difference]: Without dead ends: 173 [2025-03-17 05:23:06,907 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-17 05:23:06,908 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 123 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 558 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-17 05:23:06,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 558 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:23:06,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-17 05:23:06,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 160. [2025-03-17 05:23:06,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 123 states have (on average 1.2439024390243902) internal successors, (153), 124 states have internal predecessors, (153), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:23:06,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2025-03-17 05:23:06,919 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 123 [2025-03-17 05:23:06,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:06,919 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2025-03-17 05:23:06,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (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-17 05:23:06,919 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2025-03-17 05:23:06,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:23:06,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:06,920 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-17 05:23:06,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:23:06,920 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:06,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:06,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1662183087, now seen corresponding path program 1 times [2025-03-17 05:23:06,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:06,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114563756] [2025-03-17 05:23:06,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:06,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:06,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:23:06,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:23:06,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:06,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:07,719 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-17 05:23:07,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:07,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114563756] [2025-03-17 05:23:07,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114563756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:07,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:07,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:23:07,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578685958] [2025-03-17 05:23:07,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:07,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:23:07,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:07,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:23:07,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:23:07,721 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 05:23:08,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:08,172 INFO L93 Difference]: Finished difference Result 178 states and 227 transitions. [2025-03-17 05:23:08,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:23:08,172 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2025-03-17 05:23:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:08,174 INFO L225 Difference]: With dead ends: 178 [2025-03-17 05:23:08,174 INFO L226 Difference]: Without dead ends: 176 [2025-03-17 05:23:08,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:23:08,178 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 193 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:08,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 868 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:23:08,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-17 05:23:08,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 163. [2025-03-17 05:23:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 126 states have (on average 1.2380952380952381) internal successors, (156), 127 states have internal predecessors, (156), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:23:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 212 transitions. [2025-03-17 05:23:08,192 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 212 transitions. Word has length 125 [2025-03-17 05:23:08,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:08,192 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 212 transitions. [2025-03-17 05:23:08,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 05:23:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 212 transitions. [2025-03-17 05:23:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:23:08,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:08,193 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-17 05:23:08,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:23:08,193 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:08,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:08,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1661259566, now seen corresponding path program 1 times [2025-03-17 05:23:08,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:08,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748560007] [2025-03-17 05:23:08,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:08,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:08,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:23:08,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:23:08,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:08,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:08,329 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-17 05:23:08,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:08,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748560007] [2025-03-17 05:23:08,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748560007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:08,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:08,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:23:08,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983698993] [2025-03-17 05:23:08,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:08,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:23:08,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:08,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:23:08,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:23:08,331 INFO L87 Difference]: Start difference. First operand 163 states and 212 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (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-17 05:23:08,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:08,387 INFO L93 Difference]: Finished difference Result 299 states and 383 transitions. [2025-03-17 05:23:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:23:08,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (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-17 05:23:08,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:08,389 INFO L225 Difference]: With dead ends: 299 [2025-03-17 05:23:08,389 INFO L226 Difference]: Without dead ends: 176 [2025-03-17 05:23:08,389 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-17 05:23:08,390 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 113 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 591 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-17 05:23:08,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 591 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:08,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-17 05:23:08,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 163. [2025-03-17 05:23:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 127 states have internal predecessors, (155), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:23:08,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 211 transitions. [2025-03-17 05:23:08,407 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 211 transitions. Word has length 125 [2025-03-17 05:23:08,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:08,407 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 211 transitions. [2025-03-17 05:23:08,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (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-17 05:23:08,407 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 211 transitions. [2025-03-17 05:23:08,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:23:08,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:08,410 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-17 05:23:08,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:23:08,410 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:08,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:08,410 INFO L85 PathProgramCache]: Analyzing trace with hash -773755885, now seen corresponding path program 1 times [2025-03-17 05:23:08,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:08,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762309287] [2025-03-17 05:23:08,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:08,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:08,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:23:08,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:23:08,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:08,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:08,651 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-17 05:23:08,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:08,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762309287] [2025-03-17 05:23:08,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762309287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:08,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:08,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:23:08,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965966832] [2025-03-17 05:23:08,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:08,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:23:08,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:08,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:23:08,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:23:08,652 INFO L87 Difference]: Start difference. First operand 163 states and 211 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (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-17 05:23:08,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:08,753 INFO L93 Difference]: Finished difference Result 290 states and 371 transitions. [2025-03-17 05:23:08,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:23:08,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (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-17 05:23:08,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:08,755 INFO L225 Difference]: With dead ends: 290 [2025-03-17 05:23:08,755 INFO L226 Difference]: Without dead ends: 167 [2025-03-17 05:23:08,756 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-17 05:23:08,756 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 77 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 405 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-17 05:23:08,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 405 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:23:08,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-17 05:23:08,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-03-17 05:23:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 129 states have (on average 1.2170542635658914) internal successors, (157), 130 states have internal predecessors, (157), 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-17 05:23:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 213 transitions. [2025-03-17 05:23:08,774 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 213 transitions. Word has length 125 [2025-03-17 05:23:08,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:08,774 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 213 transitions. [2025-03-17 05:23:08,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (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-17 05:23:08,775 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 213 transitions. [2025-03-17 05:23:08,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:23:08,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:08,776 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-17 05:23:08,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:23:08,776 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:08,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:08,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1713756948, now seen corresponding path program 1 times [2025-03-17 05:23:08,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:08,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166239092] [2025-03-17 05:23:08,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:08,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:08,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:23:08,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:23:08,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:08,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:09,569 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-17 05:23:09,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:09,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166239092] [2025-03-17 05:23:09,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166239092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:09,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:09,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:23:09,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281514437] [2025-03-17 05:23:09,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:09,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:23:09,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:09,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:23:09,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:23:09,572 INFO L87 Difference]: Start difference. First operand 167 states and 213 transitions. Second operand has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 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-17 05:23:09,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:09,833 INFO L93 Difference]: Finished difference Result 357 states and 452 transitions. [2025-03-17 05:23:09,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:23:09,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 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 125 [2025-03-17 05:23:09,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:09,835 INFO L225 Difference]: With dead ends: 357 [2025-03-17 05:23:09,835 INFO L226 Difference]: Without dead ends: 230 [2025-03-17 05:23:09,836 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-17 05:23:09,836 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 208 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 740 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-17 05:23:09,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 740 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:23:09,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-17 05:23:09,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 184. [2025-03-17 05:23:09,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 146 states have (on average 1.226027397260274) internal successors, (179), 147 states have internal predecessors, (179), 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-17 05:23:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 235 transitions. [2025-03-17 05:23:09,852 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 235 transitions. Word has length 125 [2025-03-17 05:23:09,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:09,852 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 235 transitions. [2025-03-17 05:23:09,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 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-17 05:23:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 235 transitions. [2025-03-17 05:23:09,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:23:09,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:09,853 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-17 05:23:09,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:23:09,853 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:09,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:09,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1199695553, now seen corresponding path program 1 times [2025-03-17 05:23:09,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:09,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077095644] [2025-03-17 05:23:09,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:09,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:09,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:23:09,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:23:09,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:09,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:10,066 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-17 05:23:10,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:10,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077095644] [2025-03-17 05:23:10,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077095644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:10,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:10,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:23:10,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403141451] [2025-03-17 05:23:10,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:10,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:23:10,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:10,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:23:10,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:23:10,068 INFO L87 Difference]: Start difference. First operand 184 states and 235 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-17 05:23:10,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:10,159 INFO L93 Difference]: Finished difference Result 332 states and 419 transitions. [2025-03-17 05:23:10,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:23:10,159 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-17 05:23:10,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:10,160 INFO L225 Difference]: With dead ends: 332 [2025-03-17 05:23:10,160 INFO L226 Difference]: Without dead ends: 188 [2025-03-17 05:23:10,161 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-17 05:23:10,161 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 110 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:10,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 315 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:23:10,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-17 05:23:10,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-03-17 05:23:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 149 states have (on average 1.2147651006711409) internal successors, (181), 150 states have internal predecessors, (181), 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-17 05:23:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 237 transitions. [2025-03-17 05:23:10,183 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 237 transitions. Word has length 127 [2025-03-17 05:23:10,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:10,185 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 237 transitions. [2025-03-17 05:23:10,185 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-17 05:23:10,185 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 237 transitions. [2025-03-17 05:23:10,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:23:10,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:10,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] [2025-03-17 05:23:10,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:23:10,186 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:10,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:10,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1132688800, now seen corresponding path program 1 times [2025-03-17 05:23:10,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:10,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870267090] [2025-03-17 05:23:10,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:10,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:10,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:23:10,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:23:10,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:10,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:10,705 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-17 05:23:10,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:10,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870267090] [2025-03-17 05:23:10,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870267090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:10,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470506924] [2025-03-17 05:23:10,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:10,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:23:10,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:23:10,708 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-17 05:23:10,710 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-17 05:23:10,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:23:11,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:23:11,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:11,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:11,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-17 05:23:11,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:11,254 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 9 treesize of output 3 [2025-03-17 05:23:11,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:11,308 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 34 treesize of output 25 [2025-03-17 05:23:11,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-03-17 05:23:11,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:11,492 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 38 treesize of output 25 [2025-03-17 05:23:12,152 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 72 treesize of output 59 [2025-03-17 05:23:12,164 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-17 05:23:12,168 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 11 [2025-03-17 05:23:12,173 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 18 treesize of output 17 [2025-03-17 05:23:12,177 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-17 05:23:12,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:12,323 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 47 treesize of output 28 [2025-03-17 05:23:12,364 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-17 05:23:12,498 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-17 05:23:12,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:12,565 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 37 treesize of output 13 [2025-03-17 05:23:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 154 proven. 198 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-17 05:23:12,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:13,267 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-17 05:23:13,511 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-17 05:23:13,768 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-17 05:23:13,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470506924] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:23:13,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:23:13,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 22] total 52 [2025-03-17 05:23:13,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299588866] [2025-03-17 05:23:13,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:23:13,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-17 05:23:13,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:13,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-17 05:23:13,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=2192, Unknown=0, NotChecked=0, Total=2652 [2025-03-17 05:23:13,771 INFO L87 Difference]: Start difference. First operand 188 states and 237 transitions. Second operand has 52 states, 45 states have (on average 3.2) internal successors, (144), 50 states have internal predecessors, (144), 16 states have call successors, (42), 6 states have call predecessors, (42), 12 states have return successors, (42), 11 states have call predecessors, (42), 16 states have call successors, (42) [2025-03-17 05:23:15,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:15,876 INFO L93 Difference]: Finished difference Result 388 states and 478 transitions. [2025-03-17 05:23:15,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-17 05:23:15,877 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 45 states have (on average 3.2) internal successors, (144), 50 states have internal predecessors, (144), 16 states have call successors, (42), 6 states have call predecessors, (42), 12 states have return successors, (42), 11 states have call predecessors, (42), 16 states have call successors, (42) Word has length 127 [2025-03-17 05:23:15,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:15,878 INFO L225 Difference]: With dead ends: 388 [2025-03-17 05:23:15,879 INFO L226 Difference]: Without dead ends: 244 [2025-03-17 05:23:15,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2166 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1484, Invalid=6526, Unknown=0, NotChecked=0, Total=8010 [2025-03-17 05:23:15,882 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1133 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 1601 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 1601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:15,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 1214 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 1601 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 05:23:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-17 05:23:15,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 194. [2025-03-17 05:23:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 155 states have (on average 1.2) internal successors, (186), 156 states have internal predecessors, (186), 25 states have call successors, (25), 13 states have call predecessors, (25), 13 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:23:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 236 transitions. [2025-03-17 05:23:15,902 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 236 transitions. Word has length 127 [2025-03-17 05:23:15,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:15,903 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 236 transitions. [2025-03-17 05:23:15,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 45 states have (on average 3.2) internal successors, (144), 50 states have internal predecessors, (144), 16 states have call successors, (42), 6 states have call predecessors, (42), 12 states have return successors, (42), 11 states have call predecessors, (42), 16 states have call successors, (42) [2025-03-17 05:23:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 236 transitions. [2025-03-17 05:23:15,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 05:23:15,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:15,905 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-17 05:23:15,913 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-17 05:23:16,109 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,SelfDestructingSolverStorable15 [2025-03-17 05:23:16,109 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:16,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:16,110 INFO L85 PathProgramCache]: Analyzing trace with hash -603287280, now seen corresponding path program 1 times [2025-03-17 05:23:16,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:16,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190594390] [2025-03-17 05:23:16,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:16,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:16,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:23:16,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:23:16,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:16,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:16,237 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-17 05:23:16,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:16,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190594390] [2025-03-17 05:23:16,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190594390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:16,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963548505] [2025-03-17 05:23:16,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:16,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:23:16,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:23:16,240 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-17 05:23:16,242 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-17 05:23:16,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:23:16,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:23:16,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:16,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:16,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:23:16,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:16,442 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-17 05:23:16,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:16,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963548505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:16,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:23:16,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-17 05:23:16,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588314554] [2025-03-17 05:23:16,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:16,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:23:16,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:16,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:23:16,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:23:16,444 INFO L87 Difference]: Start difference. First operand 194 states and 236 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 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-17 05:23:16,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:16,487 INFO L93 Difference]: Finished difference Result 346 states and 423 transitions. [2025-03-17 05:23:16,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:23:16,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 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-17 05:23:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:16,490 INFO L225 Difference]: With dead ends: 346 [2025-03-17 05:23:16,490 INFO L226 Difference]: Without dead ends: 198 [2025-03-17 05:23:16,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 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-17 05:23:16,491 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 636 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-17 05:23:16,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 636 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:16,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-17 05:23:16,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2025-03-17 05:23:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 156 states have (on average 1.1987179487179487) internal successors, (187), 157 states have internal predecessors, (187), 25 states have call successors, (25), 13 states have call predecessors, (25), 13 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:23:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 237 transitions. [2025-03-17 05:23:16,509 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 237 transitions. Word has length 129 [2025-03-17 05:23:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:16,510 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 237 transitions. [2025-03-17 05:23:16,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 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-17 05:23:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 237 transitions. [2025-03-17 05:23:16,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:23:16,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:16,511 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-17 05:23:16,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 05:23:16,712 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,SelfDestructingSolverStorable16 [2025-03-17 05:23:16,712 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:16,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:16,713 INFO L85 PathProgramCache]: Analyzing trace with hash 775628825, now seen corresponding path program 1 times [2025-03-17 05:23:16,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:16,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342861995] [2025-03-17 05:23:16,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:16,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:16,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:23:16,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:23:16,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:16,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:23:16,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1783080118] [2025-03-17 05:23:16,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:16,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:23:16,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:23:16,779 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-17 05:23:16,781 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-17 05:23:16,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:23:17,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:23:17,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:17,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:17,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 05:23:17,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:17,049 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-17 05:23:17,057 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-17 05:23:17,062 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-17 05:23:17,067 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-17 05:23:17,073 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-17 05:23:17,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-03-17 05:23:17,166 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 87 treesize of output 66 [2025-03-17 05:23:17,291 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-17 05:23:17,365 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-17 05:23:17,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:17,369 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 44 treesize of output 16 [2025-03-17 05:23:17,425 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-17 05:23:17,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:17,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:17,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342861995] [2025-03-17 05:23:17,426 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:23:17,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783080118] [2025-03-17 05:23:17,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783080118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:17,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:17,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:23:17,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960147483] [2025-03-17 05:23:17,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:17,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:23:17,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:17,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:23:17,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:23:17,427 INFO L87 Difference]: Start difference. First operand 195 states and 237 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 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-17 05:23:18,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:18,029 INFO L93 Difference]: Finished difference Result 468 states and 570 transitions. [2025-03-17 05:23:18,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:23:18,030 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 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-17 05:23:18,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:18,032 INFO L225 Difference]: With dead ends: 468 [2025-03-17 05:23:18,032 INFO L226 Difference]: Without dead ends: 319 [2025-03-17 05:23:18,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:23:18,032 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 297 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:18,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1038 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:23:18,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-17 05:23:18,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 204. [2025-03-17 05:23:18,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 165 states have (on average 1.206060606060606) internal successors, (199), 166 states have internal predecessors, (199), 25 states have call successors, (25), 13 states have call predecessors, (25), 13 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:23:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 249 transitions. [2025-03-17 05:23:18,052 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 249 transitions. Word has length 131 [2025-03-17 05:23:18,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:18,052 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 249 transitions. [2025-03-17 05:23:18,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 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-17 05:23:18,053 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 249 transitions. [2025-03-17 05:23:18,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:23:18,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:18,054 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-17 05:23:18,063 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-17 05:23:18,255 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,SelfDestructingSolverStorable17 [2025-03-17 05:23:18,255 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:18,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:18,256 INFO L85 PathProgramCache]: Analyzing trace with hash 366804600, now seen corresponding path program 1 times [2025-03-17 05:23:18,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:18,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563636759] [2025-03-17 05:23:18,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:18,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:18,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:23:18,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:23:18,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:18,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:23:18,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1412585284] [2025-03-17 05:23:18,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:18,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:23:18,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:23:18,319 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-17 05:23:18,320 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-17 05:23:18,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:23:18,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:23:18,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:18,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:23:18,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:23:18,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:23:18,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:23:18,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:18,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:23:18,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:23:18,963 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:23:18,964 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:23:18,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 05:23:19,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:23:19,168 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-17 05:23:19,232 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:23:19,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:23:19 BoogieIcfgContainer [2025-03-17 05:23:19,234 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:23:19,235 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:23:19,235 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:23:19,235 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:23:19,235 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:22:58" (3/4) ... [2025-03-17 05:23:19,237 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:23:19,237 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:23:19,238 INFO L158 Benchmark]: Toolchain (without parser) took 21124.41ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 133.9MB in the beginning and 338.3MB in the end (delta: -204.3MB). Peak memory consumption was 131.3MB. Max. memory is 16.1GB. [2025-03-17 05:23:19,238 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:23:19,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.12ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 119.1MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:23:19,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.29ms. Allocated memory is still 167.8MB. Free memory was 119.1MB in the beginning and 115.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:23:19,238 INFO L158 Benchmark]: Boogie Preprocessor took 55.95ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 110.8MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:23:19,238 INFO L158 Benchmark]: IcfgBuilder took 511.02ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 74.3MB in the end (delta: 36.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:23:19,239 INFO L158 Benchmark]: TraceAbstraction took 20286.53ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 73.5MB in the beginning and 338.4MB in the end (delta: -264.9MB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. [2025-03-17 05:23:19,239 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 503.3MB. Free memory was 338.4MB in the beginning and 338.3MB in the end (delta: 161.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:23:19,240 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.55ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.12ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 119.1MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.29ms. Allocated memory is still 167.8MB. Free memory was 119.1MB in the beginning and 115.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.95ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 110.8MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 511.02ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 74.3MB in the end (delta: 36.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20286.53ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 73.5MB in the beginning and 338.4MB in the end (delta: -264.9MB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 503.3MB. Free memory was 338.4MB in the beginning and 338.3MB in the end (delta: 161.6kB). 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 61, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 97, 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 }; [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=2531521430, 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, 99 locations, 162 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 19, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3463 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3453 mSDsluCounter, 10522 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8093 mSDsCounter, 737 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4742 IncrementalHoareTripleChecker+Invalid, 5479 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 737 mSolverCounterUnsat, 2429 mSDtfsCounter, 4742 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1352 GetRequests, 1122 SyntacticMatches, 3 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=6, InterpolantAutomatonStates: 168, 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, 281 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 3244 NumberOfCodeBlocks, 3244 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3198 ConstructedInterpolants, 1 QuantifiedInterpolants, 14264 SizeOfPredicates, 52 NumberOfNonLiveVariables, 2986 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 26 InterpolantComputations, 15 PerfectInterpolantSequences, 10487/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-17 05:23:19,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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-?-8fc3dc6-m [2025-03-17 05:23:21,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:23:21,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:23:21,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:23:21,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:23:21,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:23:21,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:23:21,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:23:21,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:23:21,146 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:23:21,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:23:21,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:23:21,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:23:21,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:23:21,147 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:23:21,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:23:21,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:23:21,148 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:23:21,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:23:21,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:23:21,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:23:21,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:23:21,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:23:21,148 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:23:21,148 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:23:21,148 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:23:21,148 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:23:21,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:23:21,148 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:23:21,148 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:23:21,149 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:23:21,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:23:21,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:23:21,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:23:21,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:23:21,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:23:21,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:23:21,149 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:23:21,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:23:21,149 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:23:21,149 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:23:21,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:23:21,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:23:21,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:23:21,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:23:21,150 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-17 05:23:21,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:23:21,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:23:21,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:23:21,395 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:23:21,395 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:23:21,398 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-17 05:23:22,550 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/280e2a4fa/59401fcee1c84721ab2b740bf3d44ee1/FLAG47a1b669d [2025-03-17 05:23:22,711 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:23:22,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i [2025-03-17 05:23:22,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/280e2a4fa/59401fcee1c84721ab2b740bf3d44ee1/FLAG47a1b669d [2025-03-17 05:23:23,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/280e2a4fa/59401fcee1c84721ab2b740bf3d44ee1 [2025-03-17 05:23:23,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:23:23,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:23:23,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:23:23,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:23:23,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:23:23,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:23:23" (1/1) ... [2025-03-17 05:23:23,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa7c92a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:23, skipping insertion in model container [2025-03-17 05:23:23,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:23:23" (1/1) ... [2025-03-17 05:23:23,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:23:23,206 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-17 05:23:23,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:23:23,259 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:23:23,266 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-17 05:23:23,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:23:23,323 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:23:23,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:23 WrapperNode [2025-03-17 05:23:23,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:23:23,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:23:23,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:23:23,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:23:23,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:23" (1/1) ... [2025-03-17 05:23:23,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:23" (1/1) ... [2025-03-17 05:23:23,378 INFO L138 Inliner]: procedures = 36, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 450 [2025-03-17 05:23:23,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:23:23,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:23:23,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:23:23,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:23:23,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:23" (1/1) ... [2025-03-17 05:23:23,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:23" (1/1) ... [2025-03-17 05:23:23,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:23" (1/1) ... [2025-03-17 05:23:23,419 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-17 05:23:23,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:23" (1/1) ... [2025-03-17 05:23:23,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:23" (1/1) ... [2025-03-17 05:23:23,448 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:23" (1/1) ... [2025-03-17 05:23:23,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:23" (1/1) ... [2025-03-17 05:23:23,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:23" (1/1) ... [2025-03-17 05:23:23,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:23" (1/1) ... [2025-03-17 05:23:23,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:23:23,473 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:23:23,473 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:23:23,473 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:23:23,474 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:23" (1/1) ... [2025-03-17 05:23:23,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:23:23,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:23:23,500 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-17 05:23:23,502 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-17 05:23:23,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:23:23,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:23:23,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:23:23,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:23:23,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:23:23,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:23:23,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:23:23,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 05:23:23,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-17 05:23:23,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:23:23,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:23:23,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:23:23,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:23:23,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:23:23,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-17 05:23:23,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-17 05:23:23,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-17 05:23:23,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:23:23,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:23:23,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:23:23,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:23:23,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:23:23,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:23:23,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 05:23:23,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-17 05:23:23,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:23:23,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:23:23,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:23:23,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:23:23,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:23:23,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:23:23,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-17 05:23:23,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-17 05:23:23,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:23:23,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:23:23,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:23:23,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:23:23,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:23:23,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:23:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-17 05:23:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-17 05:23:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:23:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:23:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:23:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:23:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:23:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:23:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-17 05:23:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-17 05:23:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:23:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:23:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:23:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:23:23,522 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:23:23,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:23:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:23:23,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:23:23,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:23:23,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:23:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:23:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:23:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 05:23:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-17 05:23:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:23:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:23:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:23:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:23:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:23:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-17 05:23:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-17 05:23:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-03-17 05:23:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:23:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:23:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:23:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:23:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:23:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:23:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-17 05:23:23,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-17 05:23:23,663 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:23:23,664 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:23:24,060 INFO L1322 $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-17 05:23:24,114 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2025-03-17 05:23:24,115 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:23:24,121 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:23:24,122 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:23:24,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:23:24 BoogieIcfgContainer [2025-03-17 05:23:24,123 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:23:24,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:23:24,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:23:24,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:23:24,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:23:23" (1/3) ... [2025-03-17 05:23:24,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f3210d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:23:24, skipping insertion in model container [2025-03-17 05:23:24,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:23" (2/3) ... [2025-03-17 05:23:24,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f3210d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:23:24, skipping insertion in model container [2025-03-17 05:23:24,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:23:24" (3/3) ... [2025-03-17 05:23:24,130 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-37.i [2025-03-17 05:23:24,139 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:23:24,140 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-37.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:23:24,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:23:24,180 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;@6592674c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:23:24,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:23:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 74 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-17 05:23:24,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:23:24,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:24,190 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] [2025-03-17 05:23:24,190 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:24,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:24,194 INFO L85 PathProgramCache]: Analyzing trace with hash 876454943, now seen corresponding path program 1 times [2025-03-17 05:23:24,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:24,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847241178] [2025-03-17 05:23:24,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:24,201 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-17 05:23:24,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:24,203 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-17 05:23:24,206 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-17 05:23:24,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:23:24,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:23:24,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:24,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:24,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:23:24,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 05:23:24,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:24,467 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:24,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847241178] [2025-03-17 05:23:24,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847241178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:24,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:24,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:23:24,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054730114] [2025-03-17 05:23:24,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:24,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:23:24,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:24,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:23:24,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:23:24,487 INFO L87 Difference]: Start difference. First operand has 91 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 74 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) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (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-17 05:23:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:24,503 INFO L93 Difference]: Finished difference Result 179 states and 279 transitions. [2025-03-17 05:23:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:23:24,504 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (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 118 [2025-03-17 05:23:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:24,507 INFO L225 Difference]: With dead ends: 179 [2025-03-17 05:23:24,507 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 05:23:24,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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-17 05:23:24,511 INFO L435 NwaCegarLoop]: 129 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, 129 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-17 05:23:24,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:24,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 05:23:24,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-17 05:23:24,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 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-17 05:23:24,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2025-03-17 05:23:24,539 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 118 [2025-03-17 05:23:24,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:24,540 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2025-03-17 05:23:24,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (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-17 05:23:24,540 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2025-03-17 05:23:24,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:23:24,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:24,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] [2025-03-17 05:23:24,549 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-17 05:23:24,747 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-17 05:23:24,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:24,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:24,748 INFO L85 PathProgramCache]: Analyzing trace with hash -158610258, now seen corresponding path program 1 times [2025-03-17 05:23:24,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:24,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624763909] [2025-03-17 05:23:24,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:24,749 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-17 05:23:24,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:24,751 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-17 05:23:24,752 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-17 05:23:24,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:23:24,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:23:24,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:24,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:25,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:23:25,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:25,054 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-17 05:23:25,054 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:25,054 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:25,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624763909] [2025-03-17 05:23:25,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624763909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:25,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:25,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:23:25,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996567333] [2025-03-17 05:23:25,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:25,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:23:25,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:25,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:23:25,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:23:25,057 INFO L87 Difference]: Start difference. First operand 89 states and 129 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-17 05:23:25,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:25,112 INFO L93 Difference]: Finished difference Result 182 states and 264 transitions. [2025-03-17 05:23:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:23:25,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 118 [2025-03-17 05:23:25,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:25,115 INFO L225 Difference]: With dead ends: 182 [2025-03-17 05:23:25,115 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 05:23:25,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 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-17 05:23:25,117 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 480 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-17 05:23:25,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 480 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:25,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 05:23:25,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-03-17 05:23:25,127 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-17 05:23:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2025-03-17 05:23:25,130 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 118 [2025-03-17 05:23:25,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:25,131 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2025-03-17 05:23:25,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-17 05:23:25,131 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2025-03-17 05:23:25,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:23:25,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:25,132 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] [2025-03-17 05:23:25,140 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-17 05:23:25,332 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-17 05:23:25,333 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:25,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:25,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1966064721, now seen corresponding path program 1 times [2025-03-17 05:23:25,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:25,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742383156] [2025-03-17 05:23:25,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:25,334 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-17 05:23:25,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:25,335 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-17 05:23:25,337 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-17 05:23:25,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:23:25,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:23:25,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:25,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:25,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:23:25,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:25,597 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-17 05:23:25,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:25,598 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:25,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742383156] [2025-03-17 05:23:25,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742383156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:25,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:25,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:23:25,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642211648] [2025-03-17 05:23:25,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:25,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:23:25,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:25,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:23:25,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:23:25,599 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (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-17 05:23:25,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:25,642 INFO L93 Difference]: Finished difference Result 188 states and 269 transitions. [2025-03-17 05:23:25,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:23:25,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (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 118 [2025-03-17 05:23:25,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:25,644 INFO L225 Difference]: With dead ends: 188 [2025-03-17 05:23:25,644 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 05:23:25,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 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-17 05:23:25,645 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 590 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-17 05:23:25,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 590 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:25,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 05:23:25,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-03-17 05:23:25,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 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-17 05:23:25,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2025-03-17 05:23:25,653 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 118 [2025-03-17 05:23:25,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:25,654 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2025-03-17 05:23:25,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (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-17 05:23:25,654 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2025-03-17 05:23:25,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:23:25,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:25,655 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] [2025-03-17 05:23:25,662 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 (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:23:25,856 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-17 05:23:25,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:25,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:25,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1078561040, now seen corresponding path program 1 times [2025-03-17 05:23:25,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:25,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024206522] [2025-03-17 05:23:25,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:25,859 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-17 05:23:25,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:25,861 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-17 05:23:25,864 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-17 05:23:25,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:23:26,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:23:26,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:26,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:26,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:23:26,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:26,106 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-17 05:23:26,106 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:26,106 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:26,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024206522] [2025-03-17 05:23:26,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024206522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:26,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:26,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:23:26,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870145678] [2025-03-17 05:23:26,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:26,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:23:26,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:26,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:23:26,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:23:26,107 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (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-17 05:23:26,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:26,158 INFO L93 Difference]: Finished difference Result 192 states and 273 transitions. [2025-03-17 05:23:26,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:23:26,158 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (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 118 [2025-03-17 05:23:26,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:26,159 INFO L225 Difference]: With dead ends: 192 [2025-03-17 05:23:26,159 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 05:23:26,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 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-17 05:23:26,161 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 1 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 701 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-17 05:23:26,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 701 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:26,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 05:23:26,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-17 05:23:26,167 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-17 05:23:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2025-03-17 05:23:26,171 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 118 [2025-03-17 05:23:26,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:26,171 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2025-03-17 05:23:26,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (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-17 05:23:26,171 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2025-03-17 05:23:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:23:26,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:26,172 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] [2025-03-17 05:23:26,180 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-17 05:23:26,373 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-17 05:23:26,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:26,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:26,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1077637519, now seen corresponding path program 1 times [2025-03-17 05:23:26,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:26,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874239960] [2025-03-17 05:23:26,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:26,374 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-17 05:23:26,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:26,379 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-17 05:23:26,380 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-17 05:23:26,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:23:26,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:23:26,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:26,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:26,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 05:23:26,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:26,660 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-17 05:23:26,666 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-17 05:23:26,703 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-17 05:23:26,757 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-17 05:23:26,794 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-17 05:23:26,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:26,865 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-17 05:23:26,914 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:26,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874239960] [2025-03-17 05:23:26,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874239960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:26,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [43779313] [2025-03-17 05:23:26,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:26,914 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:23:26,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:23:26,916 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-17 05:23:26,918 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-17 05:23:27,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:23:27,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:23:27,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:27,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:27,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:23:27,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:27,356 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-17 05:23:27,360 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-17 05:23:27,385 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-17 05:23:27,405 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-17 05:23:27,426 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-17 05:23:27,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:27,441 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-17 05:23:27,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [43779313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:27,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:23:27,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-17 05:23:27,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531887912] [2025-03-17 05:23:27,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:23:27,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:23:27,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:27,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:23:27,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:23:27,488 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 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-17 05:23:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:27,926 INFO L93 Difference]: Finished difference Result 201 states and 281 transitions. [2025-03-17 05:23:27,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:23:27,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 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 118 [2025-03-17 05:23:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:27,927 INFO L225 Difference]: With dead ends: 201 [2025-03-17 05:23:27,927 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 05:23:27,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 271 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-17 05:23:27,928 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 106 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 620 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-17 05:23:27,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 620 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:23:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 05:23:27,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2025-03-17 05:23:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 85 states have internal predecessors, (112), 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-17 05:23:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 142 transitions. [2025-03-17 05:23:27,936 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 142 transitions. Word has length 118 [2025-03-17 05:23:27,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:27,937 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 142 transitions. [2025-03-17 05:23:27,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 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-17 05:23:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 142 transitions. [2025-03-17 05:23:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:23:27,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:27,938 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] [2025-03-17 05:23:27,945 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-17 05:23:28,144 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-17 05:23:28,338 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-17 05:23:28,339 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:28,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:28,339 INFO L85 PathProgramCache]: Analyzing trace with hash -866286606, now seen corresponding path program 1 times [2025-03-17 05:23:28,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:28,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700421775] [2025-03-17 05:23:28,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:28,340 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-17 05:23:28,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:28,341 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-17 05:23:28,342 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-17 05:23:28,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:23:28,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:23:28,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:28,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:28,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:23:28,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:28,572 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-17 05:23:28,610 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-17 05:23:28,726 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-17 05:23:28,744 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-17 05:23:28,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:28,932 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-17 05:23:28,933 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:28,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700421775] [2025-03-17 05:23:28,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700421775] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:23:28,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:23:28,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2025-03-17 05:23:28,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660150987] [2025-03-17 05:23:28,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:23:28,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:23:28,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:28,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:23:28,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:23:28,935 INFO L87 Difference]: Start difference. First operand 103 states and 142 transitions. Second operand has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 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-17 05:23:29,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:29,303 INFO L93 Difference]: Finished difference Result 209 states and 286 transitions. [2025-03-17 05:23:29,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:23:29,304 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 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 118 [2025-03-17 05:23:29,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:29,305 INFO L225 Difference]: With dead ends: 209 [2025-03-17 05:23:29,305 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 05:23:29,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:23:29,305 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 81 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:29,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 430 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:23:29,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 05:23:29,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2025-03-17 05:23:29,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 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-17 05:23:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 142 transitions. [2025-03-17 05:23:29,320 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 142 transitions. Word has length 118 [2025-03-17 05:23:29,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:29,321 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 142 transitions. [2025-03-17 05:23:29,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 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-17 05:23:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 142 transitions. [2025-03-17 05:23:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:23:29,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:29,323 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] [2025-03-17 05:23:29,331 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-17 05:23:29,523 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-17 05:23:29,524 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:29,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:29,524 INFO L85 PathProgramCache]: Analyzing trace with hash 167126962, now seen corresponding path program 1 times [2025-03-17 05:23:29,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:29,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585260404] [2025-03-17 05:23:29,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:29,525 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-17 05:23:29,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:29,527 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-17 05:23:29,528 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-17 05:23:29,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:23:29,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:23:29,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:29,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:29,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 05:23:29,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:29,755 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-17 05:23:29,758 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-17 05:23:29,793 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-17 05:23:29,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-17 05:23:29,854 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-17 05:23:29,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:29,916 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-17 05:23:29,956 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:29,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585260404] [2025-03-17 05:23:29,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585260404] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:29,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2144092762] [2025-03-17 05:23:29,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:29,956 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:23:29,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:23:29,958 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-17 05:23:29,960 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-17 05:23:30,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:23:30,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:23:30,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:30,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:30,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:23:30,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:30,392 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-17 05:23:30,396 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-17 05:23:30,429 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-17 05:23:30,452 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-17 05:23:30,474 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-17 05:23:30,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:30,496 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-17 05:23:30,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2144092762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:30,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:23:30,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-17 05:23:30,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251353130] [2025-03-17 05:23:30,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:23:30,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:23:30,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:30,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:23:30,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:23:30,543 INFO L87 Difference]: Start difference. First operand 105 states and 142 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 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-17 05:23:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:30,919 INFO L93 Difference]: Finished difference Result 211 states and 285 transitions. [2025-03-17 05:23:30,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:23:30,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 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 118 [2025-03-17 05:23:30,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:30,920 INFO L225 Difference]: With dead ends: 211 [2025-03-17 05:23:30,920 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 05:23:30,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 271 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-17 05:23:30,921 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 102 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:30,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 614 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:23:30,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 05:23:30,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2025-03-17 05:23:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 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-17 05:23:30,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 141 transitions. [2025-03-17 05:23:30,935 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 141 transitions. Word has length 118 [2025-03-17 05:23:30,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:30,936 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 141 transitions. [2025-03-17 05:23:30,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 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-17 05:23:30,936 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 141 transitions. [2025-03-17 05:23:30,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:23:30,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:30,938 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] [2025-03-17 05:23:30,944 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-17 05:23:31,144 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-17 05:23:31,338 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-17 05:23:31,339 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:31,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:31,339 INFO L85 PathProgramCache]: Analyzing trace with hash 378477875, now seen corresponding path program 1 times [2025-03-17 05:23:31,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:31,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646209271] [2025-03-17 05:23:31,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:31,340 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-17 05:23:31,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:31,341 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-17 05:23:31,342 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-17 05:23:31,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:23:31,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:23:31,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:31,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:31,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 05:23:31,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:31,577 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-17 05:23:31,686 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-17 05:23:31,813 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-17 05:23:32,069 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 37 treesize of output 17 [2025-03-17 05:23:32,385 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-17 05:23:32,388 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-17 05:23:32,400 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-17 05:23:32,531 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-17 05:23:32,533 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-17 05:23:32,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:32,544 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 47 treesize of output 23 [2025-03-17 05:23:32,604 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 290 proven. 54 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-17 05:23:32,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:36,557 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:36,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646209271] [2025-03-17 05:23:36,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646209271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:36,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [558992649] [2025-03-17 05:23:36,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:36,557 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:23:36,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:23:36,560 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-17 05:23:36,561 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-17 05:23:36,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:23:37,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:23:37,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:37,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:37,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 05:23:37,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:37,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-17 05:23:38,017 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-17 05:23:39,955 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-17 05:23:39,959 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-17 05:23:39,970 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-17 05:23:40,754 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-17 05:23:41,040 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-17 05:23:41,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:41,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2025-03-17 05:23:41,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:41,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 27 [2025-03-17 05:23:41,229 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-17 05:23:41,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:48,036 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-17 05:23:49,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [558992649] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:49,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:23:49,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 37 [2025-03-17 05:23:49,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792226336] [2025-03-17 05:23:49,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:23:49,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-17 05:23:49,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:49,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-17 05:23:49,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=2210, Unknown=0, NotChecked=0, Total=2550 [2025-03-17 05:23:49,840 INFO L87 Difference]: Start difference. First operand 105 states and 141 transitions. Second operand has 37 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 34 states have internal predecessors, (111), 13 states have call successors, (30), 10 states have call predecessors, (30), 13 states have return successors, (30), 10 states have call predecessors, (30), 13 states have call successors, (30) [2025-03-17 05:24:00,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:00,066 INFO L93 Difference]: Finished difference Result 263 states and 344 transitions. [2025-03-17 05:24:00,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-17 05:24:00,067 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 34 states have internal predecessors, (111), 13 states have call successors, (30), 10 states have call predecessors, (30), 13 states have return successors, (30), 10 states have call predecessors, (30), 13 states have call successors, (30) Word has length 118 [2025-03-17 05:24:00,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:00,068 INFO L225 Difference]: With dead ends: 263 [2025-03-17 05:24:00,068 INFO L226 Difference]: Without dead ends: 159 [2025-03-17 05:24:00,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2332 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=1520, Invalid=7410, Unknown=0, NotChecked=0, Total=8930 [2025-03-17 05:24:00,071 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 519 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 2149 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 2314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 2149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:00,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1291 Invalid, 2314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 2149 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-17 05:24:00,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-17 05:24:00,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 152. [2025-03-17 05:24:00,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 117 states have (on average 1.2222222222222223) internal successors, (143), 118 states have internal predecessors, (143), 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-17 05:24:00,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 195 transitions. [2025-03-17 05:24:00,092 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 195 transitions. Word has length 118 [2025-03-17 05:24:00,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:00,092 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 195 transitions. [2025-03-17 05:24:00,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 34 states have internal predecessors, (111), 13 states have call successors, (30), 10 states have call predecessors, (30), 13 states have return successors, (30), 10 states have call predecessors, (30), 13 states have call successors, (30) [2025-03-17 05:24:00,093 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 195 transitions. [2025-03-17 05:24:00,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:24:00,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:00,093 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] [2025-03-17 05:24:00,102 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 (11)] Forceful destruction successful, exit code 0 [2025-03-17 05:24:00,302 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-17 05:24:00,494 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-17 05:24:00,494 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:00,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:00,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1041557813, now seen corresponding path program 1 times [2025-03-17 05:24:00,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:00,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408388679] [2025-03-17 05:24:00,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:00,495 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-17 05:24:00,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:00,497 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-17 05:24:00,498 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-17 05:24:00,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:24:00,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:24:00,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:00,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:00,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:24:00,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:00,761 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-17 05:24:00,766 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-17 05:24:00,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:00,786 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-17 05:24:00,798 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-17 05:24:00,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:00,798 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:00,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408388679] [2025-03-17 05:24:00,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408388679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:00,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:00,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:24:00,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755624575] [2025-03-17 05:24:00,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:00,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:24:00,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:00,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:24:00,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:24:00,799 INFO L87 Difference]: Start difference. First operand 152 states and 195 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-17 05:24:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:00,876 INFO L93 Difference]: Finished difference Result 270 states and 343 transitions. [2025-03-17 05:24:00,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:24:00,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 118 [2025-03-17 05:24:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:00,878 INFO L225 Difference]: With dead ends: 270 [2025-03-17 05:24:00,878 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 05:24:00,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 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-17 05:24:00,879 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 90 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 504 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.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:00,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 504 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 05:24:00,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-17 05:24:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 118 states have (on average 1.2118644067796611) internal successors, (143), 119 states have internal predecessors, (143), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:24:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 195 transitions. [2025-03-17 05:24:00,895 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 195 transitions. Word has length 118 [2025-03-17 05:24:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:00,895 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 195 transitions. [2025-03-17 05:24:00,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-17 05:24:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 195 transitions. [2025-03-17 05:24:00,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 05:24:00,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:00,896 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] [2025-03-17 05:24:00,905 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-17 05:24:01,096 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-17 05:24:01,097 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:01,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:01,097 INFO L85 PathProgramCache]: Analyzing trace with hash -84649525, now seen corresponding path program 1 times [2025-03-17 05:24:01,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:01,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5917075] [2025-03-17 05:24:01,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:01,098 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-17 05:24:01,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:01,099 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-17 05:24:01,100 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-17 05:24:01,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 05:24:01,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 05:24:01,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:01,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:01,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 05:24:01,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:01,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 05:24:01,450 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-17 05:24:01,635 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-17 05:24:01,639 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-17 05:24:01,694 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-17 05:24:01,739 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-17 05:24:01,769 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-17 05:24:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 219 proven. 33 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-17 05:24:01,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:02,032 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-17 05:24:02,066 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-17 05:24:02,067 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:02,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5917075] [2025-03-17 05:24:02,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5917075] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:24:02,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:24:02,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2025-03-17 05:24:02,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859669536] [2025-03-17 05:24:02,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:24:02,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 05:24:02,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:02,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 05:24:02,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:24:02,068 INFO L87 Difference]: Start difference. First operand 154 states and 195 transitions. Second operand has 20 states, 17 states have (on average 5.294117647058823) internal successors, (90), 20 states have internal predecessors, (90), 7 states have call successors, (27), 3 states have call predecessors, (27), 6 states have return successors, (27), 4 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-17 05:24:03,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:03,987 INFO L93 Difference]: Finished difference Result 302 states and 374 transitions. [2025-03-17 05:24:03,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-17 05:24:03,988 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 5.294117647058823) internal successors, (90), 20 states have internal predecessors, (90), 7 states have call successors, (27), 3 states have call predecessors, (27), 6 states have return successors, (27), 4 states have call predecessors, (27), 7 states have call successors, (27) Word has length 121 [2025-03-17 05:24:03,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:03,989 INFO L225 Difference]: With dead ends: 302 [2025-03-17 05:24:03,989 INFO L226 Difference]: Without dead ends: 184 [2025-03-17 05:24:03,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=494, Invalid=2056, Unknown=0, NotChecked=0, Total=2550 [2025-03-17 05:24:03,990 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 503 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:03,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 634 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 05:24:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-17 05:24:04,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 162. [2025-03-17 05:24:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 124 states have (on average 1.1935483870967742) internal successors, (148), 125 states have internal predecessors, (148), 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-17 05:24:04,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2025-03-17 05:24:04,015 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 200 transitions. Word has length 121 [2025-03-17 05:24:04,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:04,016 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 200 transitions. [2025-03-17 05:24:04,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 5.294117647058823) internal successors, (90), 20 states have internal predecessors, (90), 7 states have call successors, (27), 3 states have call predecessors, (27), 6 states have return successors, (27), 4 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-17 05:24:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 200 transitions. [2025-03-17 05:24:04,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 05:24:04,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:04,017 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] [2025-03-17 05:24:04,025 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-17 05:24:04,217 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-17 05:24:04,218 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:04,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:04,218 INFO L85 PathProgramCache]: Analyzing trace with hash -590208150, now seen corresponding path program 1 times [2025-03-17 05:24:04,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:04,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329285529] [2025-03-17 05:24:04,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:04,219 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-17 05:24:04,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:04,221 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-17 05:24:04,223 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-17 05:24:04,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 05:24:04,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 05:24:04,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:04,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:04,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 05:24:04,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:04,526 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-17 05:24:04,966 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-17 05:24:05,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:05,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2025-03-17 05:24:05,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:05,101 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 71 treesize of output 35 [2025-03-17 05:24:05,147 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-17 05:24:05,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:05,259 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-17 05:24:05,259 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:05,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329285529] [2025-03-17 05:24:05,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329285529] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:05,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:05,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 17 [2025-03-17 05:24:05,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116442133] [2025-03-17 05:24:05,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:05,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:24:05,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:05,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:24:05,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:24:05,260 INFO L87 Difference]: Start difference. First operand 162 states and 200 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-17 05:24:05,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:05,442 INFO L93 Difference]: Finished difference Result 282 states and 347 transitions. [2025-03-17 05:24:05,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:24:05,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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 121 [2025-03-17 05:24:05,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:05,445 INFO L225 Difference]: With dead ends: 282 [2025-03-17 05:24:05,445 INFO L226 Difference]: Without dead ends: 164 [2025-03-17 05:24:05,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 225 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-17 05:24:05,446 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 75 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 519 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-17 05:24:05,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 519 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:24:05,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-17 05:24:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-17 05:24:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 125 states have (on average 1.184) internal successors, (148), 126 states have internal predecessors, (148), 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-17 05:24:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 200 transitions. [2025-03-17 05:24:05,464 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 200 transitions. Word has length 121 [2025-03-17 05:24:05,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:05,464 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 200 transitions. [2025-03-17 05:24:05,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-17 05:24:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 200 transitions. [2025-03-17 05:24:05,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:24:05,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:05,465 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] [2025-03-17 05:24:05,472 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-17 05:24:05,665 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-17 05:24:05,665 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:05,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:05,665 INFO L85 PathProgramCache]: Analyzing trace with hash -407960795, now seen corresponding path program 1 times [2025-03-17 05:24:05,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:05,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493690685] [2025-03-17 05:24:05,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:05,666 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-17 05:24:05,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:05,668 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-17 05:24:05,669 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-17 05:24:05,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:24:05,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:24:05,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:05,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:05,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 05:24:05,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:05,992 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-17 05:24:06,024 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-17 05:24:06,141 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-17 05:24:06,143 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-17 05:24:06,150 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-17 05:24:06,193 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 22 [2025-03-17 05:24:06,329 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-17 05:24:06,331 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 31 [2025-03-17 05:24:06,361 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-17 05:24:06,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:06,471 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-17 05:24:06,471 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:06,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493690685] [2025-03-17 05:24:06,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493690685] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:06,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:06,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2025-03-17 05:24:06,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577092037] [2025-03-17 05:24:06,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:06,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:24:06,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:06,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:24:06,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:24:06,472 INFO L87 Difference]: Start difference. First operand 164 states and 200 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (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-17 05:24:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:06,582 INFO L93 Difference]: Finished difference Result 190 states and 227 transitions. [2025-03-17 05:24:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:24:06,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (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 123 [2025-03-17 05:24:06,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:06,583 INFO L225 Difference]: With dead ends: 190 [2025-03-17 05:24:06,583 INFO L226 Difference]: Without dead ends: 188 [2025-03-17 05:24:06,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:24:06,584 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 100 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:06,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 700 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:24:06,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-17 05:24:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 167. [2025-03-17 05:24:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 128 states have (on average 1.1796875) internal successors, (151), 129 states have internal predecessors, (151), 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-17 05:24:06,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 203 transitions. [2025-03-17 05:24:06,615 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 203 transitions. Word has length 123 [2025-03-17 05:24:06,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:06,616 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 203 transitions. [2025-03-17 05:24:06,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (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-17 05:24:06,616 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 203 transitions. [2025-03-17 05:24:06,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:24:06,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:06,616 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] [2025-03-17 05:24:06,624 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-17 05:24:06,817 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-17 05:24:06,817 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:06,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:06,817 INFO L85 PathProgramCache]: Analyzing trace with hash -407037274, now seen corresponding path program 1 times [2025-03-17 05:24:06,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:06,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245827611] [2025-03-17 05:24:06,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:06,818 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-17 05:24:06,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:06,820 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-17 05:24:06,821 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-17 05:24:06,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:24:07,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:24:07,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:07,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:07,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 05:24:07,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:07,030 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-17 05:24:07,075 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-17 05:24:07,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:07,075 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:07,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245827611] [2025-03-17 05:24:07,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245827611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:07,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:07,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:24:07,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51210967] [2025-03-17 05:24:07,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:07,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:24:07,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:07,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:24:07,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:24:07,076 INFO L87 Difference]: Start difference. First operand 167 states and 203 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (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-17 05:24:07,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:07,159 INFO L93 Difference]: Finished difference Result 311 states and 374 transitions. [2025-03-17 05:24:07,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:24:07,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (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 123 [2025-03-17 05:24:07,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:07,161 INFO L225 Difference]: With dead ends: 311 [2025-03-17 05:24:07,161 INFO L226 Difference]: Without dead ends: 188 [2025-03-17 05:24:07,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 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-17 05:24:07,161 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 100 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:07,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 549 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:07,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-17 05:24:07,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 167. [2025-03-17 05:24:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 128 states have (on average 1.171875) internal successors, (150), 129 states have internal predecessors, (150), 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-17 05:24:07,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 202 transitions. [2025-03-17 05:24:07,181 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 202 transitions. Word has length 123 [2025-03-17 05:24:07,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:07,181 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 202 transitions. [2025-03-17 05:24:07,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (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-17 05:24:07,182 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 202 transitions. [2025-03-17 05:24:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:24:07,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:07,182 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] [2025-03-17 05:24:07,190 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-17 05:24:07,383 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-17 05:24:07,383 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:07,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:07,383 INFO L85 PathProgramCache]: Analyzing trace with hash 480466407, now seen corresponding path program 1 times [2025-03-17 05:24:07,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:07,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589671816] [2025-03-17 05:24:07,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:07,384 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-17 05:24:07,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:07,386 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-17 05:24:07,387 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-17 05:24:07,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:24:07,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:24:07,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:07,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:07,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 05:24:07,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:07,668 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-17 05:24:07,671 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-17 05:24:07,674 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-17 05:24:07,690 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-17 05:24:07,694 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-17 05:24:07,701 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-17 05:24:07,732 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-17 05:24:07,732 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:07,732 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:07,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589671816] [2025-03-17 05:24:07,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589671816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:07,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:07,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:24:07,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983897111] [2025-03-17 05:24:07,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:07,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:24:07,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:07,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:24:07,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:24:07,733 INFO L87 Difference]: Start difference. First operand 167 states and 202 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (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-17 05:24:07,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:07,892 INFO L93 Difference]: Finished difference Result 290 states and 350 transitions. [2025-03-17 05:24:07,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:24:07,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (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 123 [2025-03-17 05:24:07,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:07,894 INFO L225 Difference]: With dead ends: 290 [2025-03-17 05:24:07,894 INFO L226 Difference]: Without dead ends: 167 [2025-03-17 05:24:07,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 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-17 05:24:07,895 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 64 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:07,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 363 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:24:07,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-17 05:24:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-03-17 05:24:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 128 states have (on average 1.1640625) internal successors, (149), 129 states have internal predecessors, (149), 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-17 05:24:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 201 transitions. [2025-03-17 05:24:07,912 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 201 transitions. Word has length 123 [2025-03-17 05:24:07,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:07,912 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 201 transitions. [2025-03-17 05:24:07,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (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-17 05:24:07,913 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 201 transitions. [2025-03-17 05:24:07,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:24:07,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:07,913 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] [2025-03-17 05:24:07,922 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-17 05:24:08,113 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-17 05:24:08,114 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:08,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:08,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1326988056, now seen corresponding path program 1 times [2025-03-17 05:24:08,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:08,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120471362] [2025-03-17 05:24:08,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:08,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:08,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:08,116 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-17 05:24:08,117 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-17 05:24:08,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:24:08,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:24:08,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:08,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:08,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 05:24:08,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:08,418 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-17 05:24:08,518 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 37 treesize of output 30 [2025-03-17 05:24:09,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:09,440 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 74 treesize of output 43 [2025-03-17 05:24:09,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:09,480 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 88 treesize of output 60 [2025-03-17 05:24:09,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:09,657 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 156 treesize of output 72 [2025-03-17 05:24:09,720 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-17 05:24:09,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:09,852 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-17 05:24:09,852 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:09,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120471362] [2025-03-17 05:24:09,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120471362] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:09,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:09,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [23] total 25 [2025-03-17 05:24:09,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701369631] [2025-03-17 05:24:09,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:09,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:24:09,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:09,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:24:09,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:24:09,853 INFO L87 Difference]: Start difference. First operand 167 states and 201 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (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-17 05:24:10,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:10,089 INFO L93 Difference]: Finished difference Result 349 states and 421 transitions. [2025-03-17 05:24:10,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:24:10,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (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 123 [2025-03-17 05:24:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:10,092 INFO L225 Difference]: With dead ends: 349 [2025-03-17 05:24:10,092 INFO L226 Difference]: Without dead ends: 226 [2025-03-17 05:24:10,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2025-03-17 05:24:10,092 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 56 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 605 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.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:10,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 605 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:24:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-17 05:24:10,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 180. [2025-03-17 05:24:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 141 states have (on average 1.1631205673758864) internal successors, (164), 142 states have internal predecessors, (164), 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-17 05:24:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2025-03-17 05:24:10,119 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 123 [2025-03-17 05:24:10,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:10,119 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2025-03-17 05:24:10,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (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-17 05:24:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2025-03-17 05:24:10,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:24:10,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:10,120 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-17 05:24:10,131 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-17 05:24:10,321 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-17 05:24:10,321 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:10,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:10,322 INFO L85 PathProgramCache]: Analyzing trace with hash 514185691, now seen corresponding path program 1 times [2025-03-17 05:24:10,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:10,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430720578] [2025-03-17 05:24:10,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:10,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:10,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:10,324 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-17 05:24:10,325 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-17 05:24:10,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:24:10,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:24:10,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:10,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:10,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:24:10,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:11,255 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-17 05:24:11,286 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-17 05:24:11,286 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:11,286 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:11,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430720578] [2025-03-17 05:24:11,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430720578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:11,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:11,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:24:11,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691431951] [2025-03-17 05:24:11,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:11,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:24:11,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:11,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:24:11,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:24:11,287 INFO L87 Difference]: Start difference. First operand 180 states and 216 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 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-17 05:24:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:11,688 INFO L93 Difference]: Finished difference Result 470 states and 557 transitions. [2025-03-17 05:24:11,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:24:11,689 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 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-17 05:24:11,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:11,690 INFO L225 Difference]: With dead ends: 470 [2025-03-17 05:24:11,690 INFO L226 Difference]: Without dead ends: 334 [2025-03-17 05:24:11,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 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-17 05:24:11,691 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 166 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 490 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.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:11,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 490 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:24:11,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-17 05:24:11,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 290. [2025-03-17 05:24:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 213 states have (on average 1.1173708920187793) internal successors, (238), 215 states have internal predecessors, (238), 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-17 05:24:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 342 transitions. [2025-03-17 05:24:11,727 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 342 transitions. Word has length 125 [2025-03-17 05:24:11,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:11,728 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 342 transitions. [2025-03-17 05:24:11,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 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-17 05:24:11,728 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 342 transitions. [2025-03-17 05:24:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:24:11,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:11,729 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-17 05:24:11,736 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-17 05:24:11,929 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-17 05:24:11,929 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:11,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:11,929 INFO L85 PathProgramCache]: Analyzing trace with hash 945102492, now seen corresponding path program 1 times [2025-03-17 05:24:11,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:11,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385702832] [2025-03-17 05:24:11,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:11,930 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-17 05:24:11,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:11,932 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-17 05:24:11,932 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-17 05:24:12,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:24:12,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:24:12,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:12,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:12,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:24:12,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:12,118 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-17 05:24:12,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:12,118 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:12,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1385702832] [2025-03-17 05:24:12,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1385702832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:12,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:12,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:24:12,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346045406] [2025-03-17 05:24:12,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:12,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:24:12,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:12,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:24:12,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:24:12,119 INFO L87 Difference]: Start difference. First operand 290 states and 342 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-17 05:24:12,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:12,172 INFO L93 Difference]: Finished difference Result 534 states and 627 transitions. [2025-03-17 05:24:12,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:24:12,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-17 05:24:12,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:12,174 INFO L225 Difference]: With dead ends: 534 [2025-03-17 05:24:12,174 INFO L226 Difference]: Without dead ends: 290 [2025-03-17 05:24:12,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 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-17 05:24:12,176 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 353 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-17 05:24:12,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 353 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:12,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-17 05:24:12,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-03-17 05:24:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 213 states have (on average 1.107981220657277) internal successors, (236), 215 states have internal predecessors, (236), 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-17 05:24:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 340 transitions. [2025-03-17 05:24:12,211 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 340 transitions. Word has length 125 [2025-03-17 05:24:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:12,211 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 340 transitions. [2025-03-17 05:24:12,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-17 05:24:12,211 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 340 transitions. [2025-03-17 05:24:12,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:24:12,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:12,212 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-17 05:24:12,219 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-17 05:24:12,412 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-17 05:24:12,413 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:12,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:12,413 INFO L85 PathProgramCache]: Analyzing trace with hash 529223001, now seen corresponding path program 1 times [2025-03-17 05:24:12,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:12,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152328998] [2025-03-17 05:24:12,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:12,414 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-17 05:24:12,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:12,416 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-17 05:24:12,418 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-17 05:24:12,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:24:12,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:24:12,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:12,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:12,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 05:24:12,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:13,167 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-17 05:24:13,201 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-17 05:24:13,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:13,305 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-17 05:24:13,305 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:13,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152328998] [2025-03-17 05:24:13,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152328998] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:13,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:13,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-03-17 05:24:13,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074672192] [2025-03-17 05:24:13,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:13,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:24:13,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:13,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:24:13,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:24:13,306 INFO L87 Difference]: Start difference. First operand 290 states and 340 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-17 05:24:13,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:13,418 INFO L93 Difference]: Finished difference Result 528 states and 617 transitions. [2025-03-17 05:24:13,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:24:13,419 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-17 05:24:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:13,420 INFO L225 Difference]: With dead ends: 528 [2025-03-17 05:24:13,420 INFO L226 Difference]: Without dead ends: 321 [2025-03-17 05:24:13,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 240 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-17 05:24:13,421 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 45 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 499 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-17 05:24:13,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 499 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:24:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-17 05:24:13,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 290. [2025-03-17 05:24:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 213 states have (on average 1.1032863849765258) internal successors, (235), 215 states have internal predecessors, (235), 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-17 05:24:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 339 transitions. [2025-03-17 05:24:13,460 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 339 transitions. Word has length 127 [2025-03-17 05:24:13,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:13,460 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 339 transitions. [2025-03-17 05:24:13,460 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-17 05:24:13,460 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 339 transitions. [2025-03-17 05:24:13,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:24:13,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:13,461 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-17 05:24:13,468 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-17 05:24:13,661 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-17 05:24:13,662 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:13,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:13,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1118080796, now seen corresponding path program 1 times [2025-03-17 05:24:13,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:13,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657716612] [2025-03-17 05:24:13,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:13,662 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-17 05:24:13,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:13,665 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-17 05:24:13,665 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-17 05:24:13,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:24:13,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:24:13,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:13,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:13,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:24:13,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:13,886 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-17 05:24:13,886 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:13,886 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:13,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657716612] [2025-03-17 05:24:13,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657716612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:13,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:13,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:24:13,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594989597] [2025-03-17 05:24:13,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:13,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:24:13,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:13,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:24:13,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:24:13,887 INFO L87 Difference]: Start difference. First operand 290 states and 339 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-17 05:24:13,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:13,942 INFO L93 Difference]: Finished difference Result 501 states and 583 transitions. [2025-03-17 05:24:13,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:24:13,942 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-17 05:24:13,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:13,944 INFO L225 Difference]: With dead ends: 501 [2025-03-17 05:24:13,944 INFO L226 Difference]: Without dead ends: 294 [2025-03-17 05:24:13,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 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-17 05:24:13,945 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 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-17 05:24:13,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:13,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-17 05:24:13,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2025-03-17 05:24:13,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 214 states have (on average 1.102803738317757) internal successors, (236), 216 states have internal predecessors, (236), 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-17 05:24:13,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 340 transitions. [2025-03-17 05:24:13,987 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 340 transitions. Word has length 127 [2025-03-17 05:24:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:13,987 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 340 transitions. [2025-03-17 05:24:13,987 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-17 05:24:13,987 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 340 transitions. [2025-03-17 05:24:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:24:13,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:13,988 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-17 05:24:13,996 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-17 05:24:14,188 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-17 05:24:14,189 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:14,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:14,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1154319971, now seen corresponding path program 1 times [2025-03-17 05:24:14,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:14,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25788115] [2025-03-17 05:24:14,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:14,190 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-17 05:24:14,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:14,191 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-17 05:24:14,192 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-17 05:24:14,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:24:14,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:24:14,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:14,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:14,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:24:14,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:15,296 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-17 05:24:15,328 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-17 05:24:15,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:15,328 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:15,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25788115] [2025-03-17 05:24:15,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25788115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:15,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:15,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:24:15,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691468727] [2025-03-17 05:24:15,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:15,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:24:15,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:15,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:24:15,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:24:15,329 INFO L87 Difference]: Start difference. First operand 291 states and 340 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 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-17 05:24:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:15,772 INFO L93 Difference]: Finished difference Result 521 states and 604 transitions. [2025-03-17 05:24:15,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:24:15,773 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 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-17 05:24:15,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:15,775 INFO L225 Difference]: With dead ends: 521 [2025-03-17 05:24:15,775 INFO L226 Difference]: Without dead ends: 313 [2025-03-17 05:24:15,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:24:15,778 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 148 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 488 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-17 05:24:15,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 488 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:24:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-17 05:24:15,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 301. [2025-03-17 05:24:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 224 states have (on average 1.1026785714285714) internal successors, (247), 226 states have internal predecessors, (247), 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-17 05:24:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 351 transitions. [2025-03-17 05:24:15,829 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 351 transitions. Word has length 131 [2025-03-17 05:24:15,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:15,830 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 351 transitions. [2025-03-17 05:24:15,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 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-17 05:24:15,830 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 351 transitions. [2025-03-17 05:24:15,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 05:24:15,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:15,831 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-17 05:24:15,839 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 (24)] Forceful destruction successful, exit code 0 [2025-03-17 05:24:16,032 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-17 05:24:16,032 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:16,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:16,033 INFO L85 PathProgramCache]: Analyzing trace with hash 843503259, now seen corresponding path program 1 times [2025-03-17 05:24:16,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:16,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124597005] [2025-03-17 05:24:16,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:16,033 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-17 05:24:16,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:16,036 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-17 05:24:16,037 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-17 05:24:16,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:24:16,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:24:16,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:16,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:16,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 05:24:16,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:16,837 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-17 05:24:16,883 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-17 05:24:16,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:16,984 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-17 05:24:16,984 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:16,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124597005] [2025-03-17 05:24:16,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124597005] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:16,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:16,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-03-17 05:24:16,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154078125] [2025-03-17 05:24:16,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:16,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:24:16,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:16,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:24:16,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:24:16,985 INFO L87 Difference]: Start difference. First operand 301 states and 351 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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-17 05:24:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:17,098 INFO L93 Difference]: Finished difference Result 531 states and 614 transitions. [2025-03-17 05:24:17,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:24:17,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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-17 05:24:17,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:17,100 INFO L225 Difference]: With dead ends: 531 [2025-03-17 05:24:17,100 INFO L226 Difference]: Without dead ends: 313 [2025-03-17 05:24:17,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 252 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-17 05:24:17,101 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 14 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:17,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 447 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:24:17,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-17 05:24:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 291. [2025-03-17 05:24:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 214 states have (on average 1.0981308411214954) internal successors, (235), 216 states have internal predecessors, (235), 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-17 05:24:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 339 transitions. [2025-03-17 05:24:17,140 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 339 transitions. Word has length 133 [2025-03-17 05:24:17,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:17,140 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 339 transitions. [2025-03-17 05:24:17,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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-17 05:24:17,140 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 339 transitions. [2025-03-17 05:24:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:24:17,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:17,141 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-17 05:24:17,148 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-17 05:24:17,341 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-17 05:24:17,342 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:17,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:17,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1543306994, now seen corresponding path program 1 times [2025-03-17 05:24:17,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:17,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20399659] [2025-03-17 05:24:17,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:17,342 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-17 05:24:17,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:17,345 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-17 05:24:17,346 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-17 05:24:17,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:24:17,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:24:17,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:17,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:17,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 05:24:17,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:17,816 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-17 05:24:17,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:17,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-17 05:24:18,148 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:18,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20399659] [2025-03-17 05:24:18,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20399659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:18,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [122138679] [2025-03-17 05:24:18,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:18,149 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:24:18,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:24:18,150 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:24:18,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2025-03-17 05:24:18,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:24:18,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:24:18,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:18,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:18,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 05:24:18,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:18,807 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