./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/sll-01-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:08:02,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:08:02,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:08:02,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:08:02,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:08:02,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:08:02,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:08:02,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:08:02,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:08:02,996 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:08:02,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:08:02,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:08:02,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:08:02,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:08:02,997 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:08:02,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:08:02,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:08:02,997 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:08:02,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:08:02,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:08:02,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:08:02,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:08:02,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:08:02,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:08:02,998 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:08:02,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:08:02,998 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:08:02,998 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:08:02,998 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:08:02,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:08:02,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:08:02,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:08:02,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:08:02,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:08:02,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:08:02,999 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:08:02,999 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:08:03,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:08:03,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:08:03,000 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:08:03,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:08:03,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:08:03,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:08:03,000 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2025-02-07 20:08:03,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:08:03,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:08:03,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:08:03,246 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:08:03,246 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:08:03,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-2.i [2025-02-07 20:08:04,397 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd5e9c09b/67e3d39c04704519bc6c7b7e00834bf4/FLAG94bc29990 [2025-02-07 20:08:04,650 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:08:04,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2025-02-07 20:08:04,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd5e9c09b/67e3d39c04704519bc6c7b7e00834bf4/FLAG94bc29990 [2025-02-07 20:08:04,965 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd5e9c09b/67e3d39c04704519bc6c7b7e00834bf4 [2025-02-07 20:08:04,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:08:04,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:08:04,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:08:04,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:08:04,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:08:04,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:08:04" (1/1) ... [2025-02-07 20:08:04,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76190fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:04, skipping insertion in model container [2025-02-07 20:08:04,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:08:04" (1/1) ... [2025-02-07 20:08:05,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:08:05,262 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2025-02-07 20:08:05,272 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2025-02-07 20:08:05,273 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2025-02-07 20:08:05,274 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2025-02-07 20:08:05,279 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2025-02-07 20:08:05,280 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2025-02-07 20:08:05,282 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2025-02-07 20:08:05,284 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2025-02-07 20:08:05,285 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2025-02-07 20:08:05,286 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2025-02-07 20:08:05,292 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2025-02-07 20:08:05,294 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2025-02-07 20:08:05,295 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2025-02-07 20:08:05,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:08:05,305 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:08:05,327 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2025-02-07 20:08:05,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2025-02-07 20:08:05,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2025-02-07 20:08:05,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2025-02-07 20:08:05,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2025-02-07 20:08:05,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2025-02-07 20:08:05,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2025-02-07 20:08:05,334 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2025-02-07 20:08:05,334 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2025-02-07 20:08:05,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2025-02-07 20:08:05,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2025-02-07 20:08:05,336 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2025-02-07 20:08:05,336 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2025-02-07 20:08:05,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:08:05,360 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:08:05,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:05 WrapperNode [2025-02-07 20:08:05,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:08:05,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:08:05,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:08:05,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:08:05,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:05" (1/1) ... [2025-02-07 20:08:05,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:05" (1/1) ... [2025-02-07 20:08:05,420 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 204 [2025-02-07 20:08:05,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:08:05,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:08:05,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:08:05,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:08:05,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:05" (1/1) ... [2025-02-07 20:08:05,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:05" (1/1) ... [2025-02-07 20:08:05,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:05" (1/1) ... [2025-02-07 20:08:05,451 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2025-02-07 20:08:05,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:05" (1/1) ... [2025-02-07 20:08:05,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:05" (1/1) ... [2025-02-07 20:08:05,461 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:05" (1/1) ... [2025-02-07 20:08:05,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:05" (1/1) ... [2025-02-07 20:08:05,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:05" (1/1) ... [2025-02-07 20:08:05,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:05" (1/1) ... [2025-02-07 20:08:05,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:08:05,468 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:08:05,468 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:08:05,468 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:08:05,471 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:05" (1/1) ... [2025-02-07 20:08:05,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:08:05,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:05,496 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 20:08:05,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 20:08:05,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 20:08:05,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:08:05,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 20:08:05,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 20:08:05,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 20:08:05,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 20:08:05,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 20:08:05,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:08:05,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 20:08:05,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:08:05,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:08:05,663 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:08:05,665 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:08:05,983 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-07 20:08:05,984 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:08:05,993 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:08:05,993 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:08:05,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:08:05 BoogieIcfgContainer [2025-02-07 20:08:05,993 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:08:05,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:08:05,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:08:05,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:08:05,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:08:04" (1/3) ... [2025-02-07 20:08:05,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b8fbe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:08:05, skipping insertion in model container [2025-02-07 20:08:05,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:05" (2/3) ... [2025-02-07 20:08:05,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b8fbe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:08:05, skipping insertion in model container [2025-02-07 20:08:05,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:08:05" (3/3) ... [2025-02-07 20:08:06,000 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2025-02-07 20:08:06,009 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:08:06,010 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-01-2.i that has 1 procedures, 88 locations, 1 initial locations, 17 loop locations, and 13 error locations. [2025-02-07 20:08:06,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:08:06,084 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;@5112ed6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:08:06,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-07 20:08:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 74 states have (on average 1.864864864864865) internal successors, (138), 87 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:06,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 20:08:06,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:06,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 20:08:06,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:08:06,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:06,102 INFO L85 PathProgramCache]: Analyzing trace with hash 5169662, now seen corresponding path program 1 times [2025-02-07 20:08:06,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:06,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263563288] [2025-02-07 20:08:06,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:06,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:06,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 20:08:06,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 20:08:06,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:06,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:06,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:06,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:06,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263563288] [2025-02-07 20:08:06,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263563288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:06,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:06,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:08:06,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470467643] [2025-02-07 20:08:06,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:06,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:08:06,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:06,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:08:06,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:08:06,301 INFO L87 Difference]: Start difference. First operand has 88 states, 74 states have (on average 1.864864864864865) internal successors, (138), 87 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:06,353 INFO L93 Difference]: Finished difference Result 192 states and 303 transitions. [2025-02-07 20:08:06,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:08:06,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-07 20:08:06,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:06,359 INFO L225 Difference]: With dead ends: 192 [2025-02-07 20:08:06,359 INFO L226 Difference]: Without dead ends: 103 [2025-02-07 20:08:06,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:08:06,363 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 91 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:06,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 106 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:08:06,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-07 20:08:06,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 84. [2025-02-07 20:08:06,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:06,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2025-02-07 20:08:06,391 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 4 [2025-02-07 20:08:06,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:06,391 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2025-02-07 20:08:06,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2025-02-07 20:08:06,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 20:08:06,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:06,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:06,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:08:06,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:08:06,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:06,392 INFO L85 PathProgramCache]: Analyzing trace with hash -976406089, now seen corresponding path program 1 times [2025-02-07 20:08:06,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:06,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691445135] [2025-02-07 20:08:06,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:06,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:06,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 20:08:06,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:08:06,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:06,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:06,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:06,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691445135] [2025-02-07 20:08:06,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691445135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:06,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:06,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:08:06,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573407625] [2025-02-07 20:08:06,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:06,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:08:06,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:06,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:08:06,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:08:06,647 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:06,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:06,715 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2025-02-07 20:08:06,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:08:06,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-07 20:08:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:06,718 INFO L225 Difference]: With dead ends: 85 [2025-02-07 20:08:06,718 INFO L226 Difference]: Without dead ends: 83 [2025-02-07 20:08:06,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:08:06,718 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:06,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:08:06,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-07 20:08:06,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-02-07 20:08:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.295774647887324) internal successors, (92), 81 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2025-02-07 20:08:06,731 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 10 [2025-02-07 20:08:06,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:06,731 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2025-02-07 20:08:06,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2025-02-07 20:08:06,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-07 20:08:06,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:06,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:06,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:08:06,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:08:06,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:06,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1448422124, now seen corresponding path program 1 times [2025-02-07 20:08:06,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:06,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614243196] [2025-02-07 20:08:06,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:06,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:06,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-07 20:08:06,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 20:08:06,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:06,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:06,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:06,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614243196] [2025-02-07 20:08:06,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614243196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:06,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:06,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:08:06,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425966722] [2025-02-07 20:08:06,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:06,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:08:06,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:06,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:08:06,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:08:06,797 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:06,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:06,841 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2025-02-07 20:08:06,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:08:06,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-07 20:08:06,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:06,843 INFO L225 Difference]: With dead ends: 85 [2025-02-07 20:08:06,843 INFO L226 Difference]: Without dead ends: 81 [2025-02-07 20:08:06,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:08:06,844 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 17 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 140 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-02-07 20:08:06,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 140 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:08:06,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-07 20:08:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2025-02-07 20:08:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 77 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2025-02-07 20:08:06,856 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 16 [2025-02-07 20:08:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:06,856 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2025-02-07 20:08:06,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2025-02-07 20:08:06,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-07 20:08:06,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:06,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:06,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:08:06,858 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:08:06,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:06,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1949627483, now seen corresponding path program 1 times [2025-02-07 20:08:06,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:06,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627756460] [2025-02-07 20:08:06,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:06,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:06,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-07 20:08:06,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 20:08:06,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:06,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:06,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:06,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627756460] [2025-02-07 20:08:06,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627756460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:06,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:06,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:08:06,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352307658] [2025-02-07 20:08:06,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:06,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:08:06,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:06,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:08:06,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:08:06,935 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:06,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:06,993 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2025-02-07 20:08:06,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:08:06,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-07 20:08:06,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:06,994 INFO L225 Difference]: With dead ends: 142 [2025-02-07 20:08:06,994 INFO L226 Difference]: Without dead ends: 121 [2025-02-07 20:08:06,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:08:06,995 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 149 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:06,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 129 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:08:07,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-07 20:08:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 77. [2025-02-07 20:08:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 76 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2025-02-07 20:08:07,008 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 17 [2025-02-07 20:08:07,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:07,008 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2025-02-07 20:08:07,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:07,008 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2025-02-07 20:08:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 20:08:07,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:07,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:07,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:08:07,009 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:08:07,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:07,009 INFO L85 PathProgramCache]: Analyzing trace with hash 998469805, now seen corresponding path program 1 times [2025-02-07 20:08:07,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:07,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946308158] [2025-02-07 20:08:07,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:07,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:07,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 20:08:07,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 20:08:07,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:07,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:07,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:07,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946308158] [2025-02-07 20:08:07,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946308158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:07,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:07,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:08:07,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128375188] [2025-02-07 20:08:07,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:07,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:08:07,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:07,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:08:07,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:08:07,087 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:07,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:07,108 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2025-02-07 20:08:07,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:08:07,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-07 20:08:07,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:07,110 INFO L225 Difference]: With dead ends: 128 [2025-02-07 20:08:07,110 INFO L226 Difference]: Without dead ends: 83 [2025-02-07 20:08:07,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:08:07,111 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 3 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:07,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 161 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:08:07,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-07 20:08:07,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2025-02-07 20:08:07,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:07,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2025-02-07 20:08:07,118 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 22 [2025-02-07 20:08:07,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:07,119 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2025-02-07 20:08:07,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:07,119 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2025-02-07 20:08:07,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 20:08:07,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:07,120 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:07,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 20:08:07,121 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:08:07,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:07,121 INFO L85 PathProgramCache]: Analyzing trace with hash 887762099, now seen corresponding path program 1 times [2025-02-07 20:08:07,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:07,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426438326] [2025-02-07 20:08:07,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:07,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:07,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 20:08:07,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:08:07,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:07,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:07,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:07,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426438326] [2025-02-07 20:08:07,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426438326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:07,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:07,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:08:07,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665759388] [2025-02-07 20:08:07,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:07,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:08:07,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:07,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:08:07,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:08:07,166 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:07,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:07,179 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2025-02-07 20:08:07,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:08:07,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-07 20:08:07,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:07,180 INFO L225 Difference]: With dead ends: 81 [2025-02-07 20:08:07,180 INFO L226 Difference]: Without dead ends: 79 [2025-02-07 20:08:07,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:08:07,180 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 13 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:07,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 142 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:08:07,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-07 20:08:07,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-07 20:08:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.25) internal successors, (90), 78 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:07,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2025-02-07 20:08:07,189 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 23 [2025-02-07 20:08:07,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:07,192 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2025-02-07 20:08:07,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2025-02-07 20:08:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 20:08:07,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:07,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:07,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 20:08:07,193 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:08:07,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:07,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1107211698, now seen corresponding path program 1 times [2025-02-07 20:08:07,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:07,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317264604] [2025-02-07 20:08:07,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:07,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:07,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 20:08:07,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 20:08:07,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:07,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:07,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:07,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317264604] [2025-02-07 20:08:07,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317264604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:07,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:07,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:08:07,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766128989] [2025-02-07 20:08:07,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:07,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:08:07,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:07,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:08:07,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:08:07,318 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:07,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:07,368 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2025-02-07 20:08:07,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:08:07,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-07 20:08:07,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:07,369 INFO L225 Difference]: With dead ends: 80 [2025-02-07 20:08:07,369 INFO L226 Difference]: Without dead ends: 78 [2025-02-07 20:08:07,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:08:07,370 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:07,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 128 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:08:07,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-07 20:08:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2025-02-07 20:08:07,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 76 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:07,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2025-02-07 20:08:07,381 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 25 [2025-02-07 20:08:07,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:07,381 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2025-02-07 20:08:07,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2025-02-07 20:08:07,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 20:08:07,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:07,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:07,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 20:08:07,382 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:08:07,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:07,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1086997977, now seen corresponding path program 1 times [2025-02-07 20:08:07,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:07,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086267426] [2025-02-07 20:08:07,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:07,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:07,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 20:08:07,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 20:08:07,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:07,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:07,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:07,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:07,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086267426] [2025-02-07 20:08:07,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086267426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:07,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:07,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:08:07,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968000119] [2025-02-07 20:08:07,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:07,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:08:07,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:07,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:08:07,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:08:07,660 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:07,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:07,770 INFO L93 Difference]: Finished difference Result 234 states and 264 transitions. [2025-02-07 20:08:07,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:08:07,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-07 20:08:07,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:07,772 INFO L225 Difference]: With dead ends: 234 [2025-02-07 20:08:07,772 INFO L226 Difference]: Without dead ends: 165 [2025-02-07 20:08:07,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:08:07,773 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 203 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:07,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 192 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:08:07,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-07 20:08:07,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 79. [2025-02-07 20:08:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 78 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2025-02-07 20:08:07,786 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 26 [2025-02-07 20:08:07,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:07,787 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2025-02-07 20:08:07,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2025-02-07 20:08:07,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 20:08:07,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:07,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:07,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 20:08:07,787 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:08:07,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:07,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1931469848, now seen corresponding path program 1 times [2025-02-07 20:08:07,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:07,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112776783] [2025-02-07 20:08:07,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:07,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:07,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 20:08:07,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 20:08:07,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:07,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:08,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:08,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112776783] [2025-02-07 20:08:08,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112776783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:08,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:08,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:08:08,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175061939] [2025-02-07 20:08:08,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:08,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:08:08,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:08,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:08:08,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:08:08,308 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:08,616 INFO L93 Difference]: Finished difference Result 205 states and 229 transitions. [2025-02-07 20:08:08,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:08:08,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-07 20:08:08,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:08,618 INFO L225 Difference]: With dead ends: 205 [2025-02-07 20:08:08,618 INFO L226 Difference]: Without dead ends: 203 [2025-02-07 20:08:08,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:08:08,619 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 269 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:08,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 338 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:08:08,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-07 20:08:08,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 96. [2025-02-07 20:08:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 90 states have (on average 1.211111111111111) internal successors, (109), 95 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:08,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2025-02-07 20:08:08,636 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 26 [2025-02-07 20:08:08,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:08,636 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2025-02-07 20:08:08,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:08,636 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2025-02-07 20:08:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 20:08:08,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:08,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:08,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 20:08:08,639 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:08:08,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:08,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1298348890, now seen corresponding path program 1 times [2025-02-07 20:08:08,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:08,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432589963] [2025-02-07 20:08:08,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:08,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:08,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 20:08:08,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 20:08:08,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:08,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:08,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:08,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432589963] [2025-02-07 20:08:08,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432589963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:08,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:08,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:08:08,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273814589] [2025-02-07 20:08:08,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:08,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:08:08,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:08,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:08:08,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:08:08,794 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:09,038 INFO L93 Difference]: Finished difference Result 236 states and 267 transitions. [2025-02-07 20:08:09,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:08:09,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-07 20:08:09,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:09,039 INFO L225 Difference]: With dead ends: 236 [2025-02-07 20:08:09,039 INFO L226 Difference]: Without dead ends: 189 [2025-02-07 20:08:09,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:08:09,040 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 154 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:09,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 463 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:08:09,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-07 20:08:09,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 118. [2025-02-07 20:08:09,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 112 states have (on average 1.2053571428571428) internal successors, (135), 117 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 135 transitions. [2025-02-07 20:08:09,055 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 135 transitions. Word has length 26 [2025-02-07 20:08:09,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:09,055 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 135 transitions. [2025-02-07 20:08:09,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 135 transitions. [2025-02-07 20:08:09,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-07 20:08:09,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:09,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:09,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 20:08:09,057 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:08:09,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:09,057 INFO L85 PathProgramCache]: Analyzing trace with hash -740465718, now seen corresponding path program 1 times [2025-02-07 20:08:09,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:09,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040915340] [2025-02-07 20:08:09,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:09,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:09,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 20:08:09,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 20:08:09,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:09,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:09,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:09,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040915340] [2025-02-07 20:08:09,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040915340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:09,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:09,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:08:09,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99268319] [2025-02-07 20:08:09,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:09,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:08:09,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:09,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:08:09,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:08:09,447 INFO L87 Difference]: Start difference. First operand 118 states and 135 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:09,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:09,686 INFO L93 Difference]: Finished difference Result 217 states and 244 transitions. [2025-02-07 20:08:09,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:08:09,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-07 20:08:09,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:09,687 INFO L225 Difference]: With dead ends: 217 [2025-02-07 20:08:09,687 INFO L226 Difference]: Without dead ends: 215 [2025-02-07 20:08:09,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:08:09,688 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 264 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:09,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 313 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:08:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-02-07 20:08:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 121. [2025-02-07 20:08:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 115 states have (on average 1.2) internal successors, (138), 120 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 138 transitions. [2025-02-07 20:08:09,698 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 138 transitions. Word has length 29 [2025-02-07 20:08:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:09,699 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 138 transitions. [2025-02-07 20:08:09,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 138 transitions. [2025-02-07 20:08:09,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-07 20:08:09,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:09,699 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:09,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 20:08:09,700 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:08:09,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:09,700 INFO L85 PathProgramCache]: Analyzing trace with hash 179964070, now seen corresponding path program 1 times [2025-02-07 20:08:09,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:09,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612271118] [2025-02-07 20:08:09,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:09,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:09,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 20:08:09,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 20:08:09,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:09,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:08:09,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:09,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612271118] [2025-02-07 20:08:09,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612271118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:09,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:09,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:08:09,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084430668] [2025-02-07 20:08:09,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:09,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:08:09,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:09,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:08:09,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:08:09,736 INFO L87 Difference]: Start difference. First operand 121 states and 138 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:09,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:09,773 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2025-02-07 20:08:09,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:08:09,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-07 20:08:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:09,774 INFO L225 Difference]: With dead ends: 122 [2025-02-07 20:08:09,774 INFO L226 Difference]: Without dead ends: 120 [2025-02-07 20:08:09,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:08:09,774 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 55 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:09,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 86 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:08:09,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-07 20:08:09,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-02-07 20:08:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 118 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2025-02-07 20:08:09,785 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 29 [2025-02-07 20:08:09,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:09,785 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2025-02-07 20:08:09,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2025-02-07 20:08:09,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-07 20:08:09,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:09,786 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:09,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 20:08:09,786 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:08:09,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:09,787 INFO L85 PathProgramCache]: Analyzing trace with hash -639421812, now seen corresponding path program 1 times [2025-02-07 20:08:09,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:09,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038906634] [2025-02-07 20:08:09,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:09,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:09,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 20:08:09,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 20:08:09,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:09,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:09,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:09,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038906634] [2025-02-07 20:08:09,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038906634] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:08:09,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031911448] [2025-02-07 20:08:09,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:09,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:09,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:09,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:08:09,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 20:08:10,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 20:08:10,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 20:08:10,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:10,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:10,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-07 20:08:10,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:10,097 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 6 treesize of output 5 [2025-02-07 20:08:10,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:10,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 16 treesize of output 16 [2025-02-07 20:08:10,157 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-07 20:08:10,158 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-07 20:08:10,167 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-07 20:08:10,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 15 [2025-02-07 20:08:10,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 24 treesize of output 12 [2025-02-07 20:08:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:10,265 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:08:10,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031911448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:10,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 20:08:10,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-07 20:08:10,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919506774] [2025-02-07 20:08:10,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:10,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:08:10,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:10,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:08:10,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:08:10,266 INFO L87 Difference]: Start difference. First operand 119 states and 136 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:10,452 INFO L93 Difference]: Finished difference Result 260 states and 294 transitions. [2025-02-07 20:08:10,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:08:10,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-07 20:08:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:10,453 INFO L225 Difference]: With dead ends: 260 [2025-02-07 20:08:10,453 INFO L226 Difference]: Without dead ends: 215 [2025-02-07 20:08:10,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-07 20:08:10,454 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 253 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:10,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 316 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:08:10,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-02-07 20:08:10,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 119. [2025-02-07 20:08:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.1842105263157894) internal successors, (135), 118 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2025-02-07 20:08:10,465 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 32 [2025-02-07 20:08:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:10,465 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2025-02-07 20:08:10,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2025-02-07 20:08:10,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-07 20:08:10,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:10,466 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:10,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 20:08:10,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-07 20:08:10,667 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:08:10,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:10,667 INFO L85 PathProgramCache]: Analyzing trace with hash 476173514, now seen corresponding path program 1 times [2025-02-07 20:08:10,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:10,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653375561] [2025-02-07 20:08:10,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:10,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:10,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 20:08:10,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 20:08:10,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:10,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:10,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:10,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653375561] [2025-02-07 20:08:10,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653375561] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:08:10,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070721349] [2025-02-07 20:08:10,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:10,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:10,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:10,769 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:08:10,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 20:08:10,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 20:08:10,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 20:08:10,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:10,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:10,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-07 20:08:10,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:10,853 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 11 treesize of output 7 [2025-02-07 20:08:10,856 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 11 treesize of output 7 [2025-02-07 20:08:10,895 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 19 treesize of output 18 [2025-02-07 20:08:10,901 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 19 treesize of output 18 [2025-02-07 20:08:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:11,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:08:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:11,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070721349] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:08:11,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:08:11,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 7 [2025-02-07 20:08:11,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587055474] [2025-02-07 20:08:11,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:08:11,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 20:08:11,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:11,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 20:08:11,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:08:11,194 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:11,408 INFO L93 Difference]: Finished difference Result 219 states and 248 transitions. [2025-02-07 20:08:11,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 20:08:11,408 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-07 20:08:11,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:11,409 INFO L225 Difference]: With dead ends: 219 [2025-02-07 20:08:11,410 INFO L226 Difference]: Without dead ends: 174 [2025-02-07 20:08:11,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-02-07 20:08:11,411 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 175 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:11,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 320 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:08:11,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-02-07 20:08:11,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 150. [2025-02-07 20:08:11,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.186206896551724) internal successors, (172), 149 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:11,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 172 transitions. [2025-02-07 20:08:11,427 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 172 transitions. Word has length 32 [2025-02-07 20:08:11,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:11,428 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 172 transitions. [2025-02-07 20:08:11,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:11,428 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 172 transitions. [2025-02-07 20:08:11,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 20:08:11,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:11,429 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:11,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 20:08:11,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:11,633 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:08:11,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:11,634 INFO L85 PathProgramCache]: Analyzing trace with hash -956117596, now seen corresponding path program 1 times [2025-02-07 20:08:11,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:11,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670110543] [2025-02-07 20:08:11,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:11,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:11,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-07 20:08:11,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 20:08:11,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:11,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:11,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:11,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:11,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670110543] [2025-02-07 20:08:11,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670110543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:11,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:11,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:08:11,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281570500] [2025-02-07 20:08:11,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:11,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:08:11,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:11,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:08:11,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:08:11,668 INFO L87 Difference]: Start difference. First operand 150 states and 172 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:11,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:11,697 INFO L93 Difference]: Finished difference Result 251 states and 295 transitions. [2025-02-07 20:08:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:08:11,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-07 20:08:11,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:11,699 INFO L225 Difference]: With dead ends: 251 [2025-02-07 20:08:11,699 INFO L226 Difference]: Without dead ends: 188 [2025-02-07 20:08:11,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:08:11,699 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 7 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:11,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 158 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:08:11,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-07 20:08:11,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 178. [2025-02-07 20:08:11,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.1907514450867052) internal successors, (206), 177 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:11,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 206 transitions. [2025-02-07 20:08:11,716 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 206 transitions. Word has length 35 [2025-02-07 20:08:11,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:11,716 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 206 transitions. [2025-02-07 20:08:11,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:11,716 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 206 transitions. [2025-02-07 20:08:11,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 20:08:11,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:11,716 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:11,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 20:08:11,717 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:08:11,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:11,717 INFO L85 PathProgramCache]: Analyzing trace with hash -695552919, now seen corresponding path program 1 times [2025-02-07 20:08:11,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:11,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102770729] [2025-02-07 20:08:11,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:11,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:11,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-07 20:08:11,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 20:08:11,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:11,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:11,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:11,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102770729] [2025-02-07 20:08:11,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102770729] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:08:11,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796320357] [2025-02-07 20:08:11,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:11,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:11,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:11,806 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:08:11,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 20:08:11,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-07 20:08:11,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 20:08:11,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:11,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:11,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-07 20:08:11,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:11,887 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 11 treesize of output 7 [2025-02-07 20:08:11,891 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 11 treesize of output 7 [2025-02-07 20:08:11,910 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 21 treesize of output 20 [2025-02-07 20:08:11,916 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 21 treesize of output 20 [2025-02-07 20:08:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:08:12,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:08:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:08:12,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796320357] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:08:12,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:08:12,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 3] total 7 [2025-02-07 20:08:12,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610153661] [2025-02-07 20:08:12,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:08:12,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:08:12,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:12,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:08:12,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:08:12,166 INFO L87 Difference]: Start difference. First operand 178 states and 206 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:12,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:12,397 INFO L93 Difference]: Finished difference Result 301 states and 343 transitions. [2025-02-07 20:08:12,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 20:08:12,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-07 20:08:12,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:12,399 INFO L225 Difference]: With dead ends: 301 [2025-02-07 20:08:12,399 INFO L226 Difference]: Without dead ends: 266 [2025-02-07 20:08:12,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:08:12,399 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 108 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:12,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 426 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:08:12,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-02-07 20:08:12,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 210. [2025-02-07 20:08:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.2146341463414634) internal successors, (249), 209 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:12,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 249 transitions. [2025-02-07 20:08:12,422 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 249 transitions. Word has length 35 [2025-02-07 20:08:12,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:12,423 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 249 transitions. [2025-02-07 20:08:12,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:12,423 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 249 transitions. [2025-02-07 20:08:12,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-07 20:08:12,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:12,423 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:12,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 20:08:12,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:12,638 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:08:12,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:12,638 INFO L85 PathProgramCache]: Analyzing trace with hash -970588449, now seen corresponding path program 1 times [2025-02-07 20:08:12,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:12,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344737827] [2025-02-07 20:08:12,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:12,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:12,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 20:08:12,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 20:08:12,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:12,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:08:12,667 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 20:08:12,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 20:08:12,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 20:08:12,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:12,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:08:12,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 20:08:12,690 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 20:08:12,690 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 13 remaining) [2025-02-07 20:08:12,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 13 remaining) [2025-02-07 20:08:12,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (10 of 13 remaining) [2025-02-07 20:08:12,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (9 of 13 remaining) [2025-02-07 20:08:12,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 13 remaining) [2025-02-07 20:08:12,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (7 of 13 remaining) [2025-02-07 20:08:12,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (6 of 13 remaining) [2025-02-07 20:08:12,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (5 of 13 remaining) [2025-02-07 20:08:12,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (4 of 13 remaining) [2025-02-07 20:08:12,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 13 remaining) [2025-02-07 20:08:12,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (2 of 13 remaining) [2025-02-07 20:08:12,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (1 of 13 remaining) [2025-02-07 20:08:12,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (0 of 13 remaining) [2025-02-07 20:08:12,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 20:08:12,696 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:12,721 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:08:12,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:08:12 BoogieIcfgContainer [2025-02-07 20:08:12,723 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:08:12,724 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:08:12,724 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:08:12,724 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:08:12,725 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:08:05" (3/4) ... [2025-02-07 20:08:12,725 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 20:08:12,765 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 33. [2025-02-07 20:08:12,824 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:08:12,828 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:08:12,828 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:08:12,829 INFO L158 Benchmark]: Toolchain (without parser) took 7859.33ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 102.7MB in the beginning and 231.3MB in the end (delta: -128.6MB). Peak memory consumption was 138.5MB. Max. memory is 16.1GB. [2025-02-07 20:08:12,829 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:08:12,832 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.76ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 83.5MB in the end (delta: 19.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 20:08:12,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.56ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 81.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:08:12,832 INFO L158 Benchmark]: Boogie Preprocessor took 44.91ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 79.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:08:12,832 INFO L158 Benchmark]: IcfgBuilder took 525.29ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 58.4MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 20:08:12,833 INFO L158 Benchmark]: TraceAbstraction took 6728.49ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 57.4MB in the beginning and 239.7MB in the end (delta: -182.3MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2025-02-07 20:08:12,833 INFO L158 Benchmark]: Witness Printer took 104.22ms. Allocated memory is still 411.0MB. Free memory was 239.7MB in the beginning and 231.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:08:12,834 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 390.76ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 83.5MB in the end (delta: 19.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.56ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 81.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.91ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 79.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 525.29ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 58.4MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6728.49ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 57.4MB in the beginning and 239.7MB in the end (delta: -182.3MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. * Witness Printer took 104.22ms. Allocated memory is still 411.0MB. Free memory was 239.7MB in the beginning and 231.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1036]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) [L1004] COND TRUE 0 VAL [list={-1:0}] [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1004] COND FALSE !(0) VAL [list={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) [L1004] EXPR list->inner [L1004] list->inner->next = ((void*)0) [L1004] EXPR list->inner [L1004] list->inner->inner = ((void*)0) [L1004] COND TRUE 0 [L1004] EXPR list->inner [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}] [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1004] COND FALSE !(0) VAL [list={-1:0}] [L1006] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1009] COND TRUE __VERIFIER_nondet_int() [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={-1:0}, list={-1:0}] [L1023] COND TRUE 0 VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(0) VAL [end={-1:0}, list={-1:0}] [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; [L1028] EXPR end->inner [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND TRUE 0 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(0) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1036] COND TRUE 0 [L1036] EXPR inner->inner [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1036] COND FALSE !(0) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1037] COND TRUE 0 [L1037] EXPR inner->next [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1037] COND FALSE !(0) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1038] EXPR inner->inner [L1038] inner = inner->inner [L1039] COND TRUE len == 1 [L1040] EXPR inner->inner [L1040] inner = inner->inner VAL [end={-1:0}, inner={55:5}, len=1, list={-1:0}] [L1029] COND TRUE ((void*)0) != inner [L1031] COND FALSE !(len == 0) [L1034] len = 2 VAL [end={-1:0}, inner={55:5}, len=2, list={-1:0}] [L1035] COND TRUE 0 VAL [end={-1:0}, inner={55:5}, len=2, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={55:5}, len=2, list={-1:0}] [L1035] COND FALSE !(0) VAL [end={-1:0}, inner={55:5}, len=2, list={-1:0}] [L1036] COND TRUE 0 [L1036] EXPR inner->inner [L1036] COND TRUE !(((void*)0) == inner->inner) [L1036] reach_error() VAL [end={-1:0}, inner={55:5}, len=2, list={-1:0}] - UnprovableResult [Line: 1056]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 88 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1762 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1762 mSDsluCounter, 3661 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2385 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1235 IncrementalHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 1276 mSDtfsCounter, 1235 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=16, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 615 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 525 NumberOfCodeBlocks, 525 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 532 ConstructedInterpolants, 0 QuantifiedInterpolants, 5430 SizeOfPredicates, 11 NumberOfNonLiveVariables, 422 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 21 InterpolantComputations, 14 PerfectInterpolantSequences, 13/21 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 proved your program to be incorrect! [2025-02-07 20:08:12,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE