./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-551b009-m [2025-01-09 02:43:47,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:43:47,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:43:47,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:43:47,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:43:47,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:43:47,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:43:47,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:43:47,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:43:47,749 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:43:47,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:43:47,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:43:47,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:43:47,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:43:47,750 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:43:47,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:43:47,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:43:47,750 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:43:47,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:43:47,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:43:47,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:43:47,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:43:47,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:43:47,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:43:47,751 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:43:47,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:43:47,751 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:43:47,751 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:43:47,751 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:43:47,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:43:47,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:43:47,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:43:47,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:43:47,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:43:47,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:43:47,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:43:47,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:43:47,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:43:47,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:43:47,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:43:47,753 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:43:47,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:43:47,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:43:47,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:43:47,753 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:43:47,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:43:47,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:43:47,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:43:47,753 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-01-09 02:43:47,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:43:47,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:43:47,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:43:47,982 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:43:47,983 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:43:47,984 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-01-09 02:43:49,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/88260a141/87a23db46b364a4bbdc5afd8d7c130cc/FLAG42e86d63b [2025-01-09 02:43:49,378 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:43:49,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2025-01-09 02:43:49,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/88260a141/87a23db46b364a4bbdc5afd8d7c130cc/FLAG42e86d63b [2025-01-09 02:43:49,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/88260a141/87a23db46b364a4bbdc5afd8d7c130cc [2025-01-09 02:43:49,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:43:49,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:43:49,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:43:49,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:43:49,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:43:49,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:43:49" (1/1) ... [2025-01-09 02:43:49,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c12871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:49, skipping insertion in model container [2025-01-09 02:43:49,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:43:49" (1/1) ... [2025-01-09 02:43:49,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:43:49,912 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-01-09 02:43:49,917 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-01-09 02:43:49,919 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-01-09 02:43:49,920 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-01-09 02:43:49,921 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-01-09 02:43:49,922 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-01-09 02:43:49,923 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-01-09 02:43:49,924 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2025-01-09 02:43:49,924 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2025-01-09 02:43:49,925 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-01-09 02:43:49,929 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-01-09 02:43:49,930 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-01-09 02:43:49,930 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-01-09 02:43:49,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:43:49,944 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:43:49,970 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-01-09 02:43:49,971 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-01-09 02:43:49,972 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-01-09 02:43:49,973 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-01-09 02:43:49,974 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-01-09 02:43:49,975 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-01-09 02:43:49,976 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-01-09 02:43:49,976 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-01-09 02:43:49,977 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-01-09 02:43:49,977 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-01-09 02:43:49,978 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-01-09 02:43:49,978 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-01-09 02:43:49,979 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-01-09 02:43:49,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:43:50,001 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:43:50,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:50 WrapperNode [2025-01-09 02:43:50,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:43:50,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:43:50,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:43:50,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:43:50,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:50" (1/1) ... [2025-01-09 02:43:50,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:50" (1/1) ... [2025-01-09 02:43:50,034 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 204 [2025-01-09 02:43:50,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:43:50,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:43:50,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:43:50,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:43:50,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:50" (1/1) ... [2025-01-09 02:43:50,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:50" (1/1) ... [2025-01-09 02:43:50,043 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:50" (1/1) ... [2025-01-09 02:43:50,063 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-01-09 02:43:50,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:50" (1/1) ... [2025-01-09 02:43:50,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:50" (1/1) ... [2025-01-09 02:43:50,069 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:50" (1/1) ... [2025-01-09 02:43:50,069 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:50" (1/1) ... [2025-01-09 02:43:50,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:50" (1/1) ... [2025-01-09 02:43:50,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:50" (1/1) ... [2025-01-09 02:43:50,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:50" (1/1) ... [2025-01-09 02:43:50,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:43:50,080 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:43:50,080 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:43:50,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:43:50,084 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:50" (1/1) ... [2025-01-09 02:43:50,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:43:50,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:43:50,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:43:50,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:43:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:43:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:43:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:43:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:43:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:43:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:43:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:43:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:43:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:43:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:43:50,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:43:50,211 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:43:50,212 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:43:50,488 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-01-09 02:43:50,489 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:43:50,500 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:43:50,500 INFO L312 CfgBuilder]: Removed 14 assume(true) statements. [2025-01-09 02:43:50,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:43:50 BoogieIcfgContainer [2025-01-09 02:43:50,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:43:50,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:43:50,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:43:50,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:43:50,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:43:49" (1/3) ... [2025-01-09 02:43:50,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117364e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:43:50, skipping insertion in model container [2025-01-09 02:43:50,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:50" (2/3) ... [2025-01-09 02:43:50,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117364e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:43:50, skipping insertion in model container [2025-01-09 02:43:50,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:43:50" (3/3) ... [2025-01-09 02:43:50,508 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2025-01-09 02:43:50,519 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:43:50,520 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-01-2.i that has 1 procedures, 84 locations, 1 initial locations, 17 loop locations, and 13 error locations. [2025-01-09 02:43:50,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:43:50,576 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;@268d9422, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:43:50,577 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-09 02:43:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 70 states have (on average 1.9142857142857144) internal successors, (134), 83 states have internal predecessors, (134), 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-01-09 02:43:50,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 02:43:50,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:43:50,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 02:43:50,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-01-09 02:43:50,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:43:50,589 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2025-01-09 02:43:50,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:43:50,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629035835] [2025-01-09 02:43:50,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:50,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:43:50,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 02:43:50,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 02:43:50,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:50,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:43:50,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:43:50,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629035835] [2025-01-09 02:43:50,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629035835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:43:50,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:43:50,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:43:50,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118428086] [2025-01-09 02:43:50,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:43:50,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:43:50,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:43:50,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:43:50,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:43:50,737 INFO L87 Difference]: Start difference. First operand has 84 states, 70 states have (on average 1.9142857142857144) internal successors, (134), 83 states have internal predecessors, (134), 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), 3 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-01-09 02:43:50,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:43:50,798 INFO L93 Difference]: Finished difference Result 182 states and 293 transitions. [2025-01-09 02:43:50,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:43:50,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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-01-09 02:43:50,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:43:50,806 INFO L225 Difference]: With dead ends: 182 [2025-01-09 02:43:50,806 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 02:43:50,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:43:50,810 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 86 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:43:50,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 102 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:43:50,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 02:43:50,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2025-01-09 02:43:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 67 states have (on average 1.328358208955224) internal successors, (89), 78 states have internal predecessors, (89), 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-01-09 02:43:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2025-01-09 02:43:50,840 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 4 [2025-01-09 02:43:50,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:43:50,840 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2025-01-09 02:43:50,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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-01-09 02:43:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2025-01-09 02:43:50,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 02:43:50,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:43:50,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:43:50,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:43:50,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-01-09 02:43:50,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:43:50,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2095629200, now seen corresponding path program 1 times [2025-01-09 02:43:50,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:43:50,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201597635] [2025-01-09 02:43:50,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:50,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:43:50,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 02:43:50,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 02:43:50,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:50,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:50,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:43:50,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:43:50,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201597635] [2025-01-09 02:43:50,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201597635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:43:50,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:43:50,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:43:50,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557117003] [2025-01-09 02:43:50,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:43:50,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:43:50,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:43:50,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:43:50,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:43:50,914 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-01-09 02:43:50,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:43:50,929 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2025-01-09 02:43:50,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:43:50,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-01-09 02:43:50,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:43:50,930 INFO L225 Difference]: With dead ends: 82 [2025-01-09 02:43:50,931 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 02:43:50,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:43:50,931 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:43:50,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:43:50,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 02:43:50,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-09 02:43:50,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 79 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-01-09 02:43:50,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2025-01-09 02:43:50,937 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 10 [2025-01-09 02:43:50,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:43:50,937 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2025-01-09 02:43:50,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-01-09 02:43:50,938 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2025-01-09 02:43:50,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 02:43:50,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:43:50,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:43:50,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:43:50,938 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-01-09 02:43:50,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:43:50,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2095631122, now seen corresponding path program 1 times [2025-01-09 02:43:50,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:43:50,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24258756] [2025-01-09 02:43:50,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:50,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:43:50,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 02:43:50,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 02:43:50,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:50,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:51,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:43:51,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:43:51,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24258756] [2025-01-09 02:43:51,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24258756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:43:51,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:43:51,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:43:51,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406960763] [2025-01-09 02:43:51,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:43:51,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:43:51,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:43:51,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:43:51,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:43:51,089 INFO L87 Difference]: Start difference. First operand 80 states and 90 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-01-09 02:43:51,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:43:51,163 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2025-01-09 02:43:51,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:43:51,163 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-01-09 02:43:51,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:43:51,164 INFO L225 Difference]: With dead ends: 81 [2025-01-09 02:43:51,165 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 02:43:51,166 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-01-09 02:43:51,166 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:43:51,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:43:51,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 02:43:51,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2025-01-09 02:43:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.3181818181818181) 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-01-09 02:43:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2025-01-09 02:43:51,173 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 10 [2025-01-09 02:43:51,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:43:51,173 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2025-01-09 02:43:51,173 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-01-09 02:43:51,173 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2025-01-09 02:43:51,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 02:43:51,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:43:51,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:43:51,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:43:51,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-01-09 02:43:51,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:43:51,174 INFO L85 PathProgramCache]: Analyzing trace with hash 774192360, now seen corresponding path program 1 times [2025-01-09 02:43:51,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:43:51,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057364441] [2025-01-09 02:43:51,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:51,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:43:51,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 02:43:51,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 02:43:51,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:51,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:43:51,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:43:51,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057364441] [2025-01-09 02:43:51,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057364441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:43:51,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:43:51,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:43:51,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948104780] [2025-01-09 02:43:51,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:43:51,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:43:51,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:43:51,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:43:51,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:43:51,306 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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-01-09 02:43:51,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:43:51,417 INFO L93 Difference]: Finished difference Result 201 states and 226 transitions. [2025-01-09 02:43:51,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:43:51,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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-01-09 02:43:51,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:43:51,420 INFO L225 Difference]: With dead ends: 201 [2025-01-09 02:43:51,420 INFO L226 Difference]: Without dead ends: 132 [2025-01-09 02:43:51,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:43:51,421 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 59 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:43:51,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 205 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:43:51,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-01-09 02:43:51,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 79. [2025-01-09 02:43:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 78 states have internal predecessors, (89), 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-01-09 02:43:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2025-01-09 02:43:51,434 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 16 [2025-01-09 02:43:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:43:51,434 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2025-01-09 02:43:51,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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-01-09 02:43:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2025-01-09 02:43:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 02:43:51,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:43:51,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:43:51,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 02:43:51,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-01-09 02:43:51,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:43:51,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1454250730, now seen corresponding path program 1 times [2025-01-09 02:43:51,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:43:51,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611663376] [2025-01-09 02:43:51,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:51,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:43:51,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 02:43:51,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 02:43:51,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:51,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:43:51,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:43:51,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611663376] [2025-01-09 02:43:51,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611663376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:43:51,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:43:51,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:43:51,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313344437] [2025-01-09 02:43:51,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:43:51,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:43:51,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:43:51,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:43:51,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:43:51,498 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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-01-09 02:43:51,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:43:51,572 INFO L93 Difference]: Finished difference Result 139 states and 155 transitions. [2025-01-09 02:43:51,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:43:51,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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-01-09 02:43:51,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:43:51,573 INFO L225 Difference]: With dead ends: 139 [2025-01-09 02:43:51,576 INFO L226 Difference]: Without dead ends: 115 [2025-01-09 02:43:51,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:43:51,577 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 139 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:43:51,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 121 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:43:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-09 02:43:51,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 74. [2025-01-09 02:43:51,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 73 states have internal predecessors, (84), 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-01-09 02:43:51,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2025-01-09 02:43:51,586 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 16 [2025-01-09 02:43:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:43:51,586 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2025-01-09 02:43:51,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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-01-09 02:43:51,586 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2025-01-09 02:43:51,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 02:43:51,587 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:43:51,587 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] [2025-01-09 02:43:51,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 02:43:51,587 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-01-09 02:43:51,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:43:51,587 INFO L85 PathProgramCache]: Analyzing trace with hash -762055490, now seen corresponding path program 1 times [2025-01-09 02:43:51,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:43:51,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725387449] [2025-01-09 02:43:51,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:51,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:43:51,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 02:43:51,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 02:43:51,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:51,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:43:51,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:43:51,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725387449] [2025-01-09 02:43:51,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725387449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:43:51,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:43:51,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:43:51,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449379927] [2025-01-09 02:43:51,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:43:51,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:43:51,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:43:51,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:43:51,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:43:51,636 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-01-09 02:43:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:43:51,654 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2025-01-09 02:43:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:43:51,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2025-01-09 02:43:51,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:43:51,656 INFO L225 Difference]: With dead ends: 121 [2025-01-09 02:43:51,656 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 02:43:51,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:43:51,656 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 3 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 151 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-01-09 02:43:51,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 151 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:43:51,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 02:43:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2025-01-09 02:43:51,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 69 states have (on average 1.2753623188405796) 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-01-09 02:43:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2025-01-09 02:43:51,671 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 20 [2025-01-09 02:43:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:43:51,671 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2025-01-09 02:43:51,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-01-09 02:43:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2025-01-09 02:43:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 02:43:51,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:43:51,671 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] [2025-01-09 02:43:51,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 02:43:51,671 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-01-09 02:43:51,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:43:51,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2143803067, now seen corresponding path program 1 times [2025-01-09 02:43:51,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:43:51,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492683186] [2025-01-09 02:43:51,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:51,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:43:51,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 02:43:51,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 02:43:51,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:51,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:43:51,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:43:51,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492683186] [2025-01-09 02:43:51,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492683186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:43:51,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:43:51,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:43:51,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894862053] [2025-01-09 02:43:51,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:43:51,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:43:51,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:43:51,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:43:51,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:43:51,711 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-01-09 02:43:51,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:43:51,727 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2025-01-09 02:43:51,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:43:51,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2025-01-09 02:43:51,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:43:51,729 INFO L225 Difference]: With dead ends: 77 [2025-01-09 02:43:51,729 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 02:43:51,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:43:51,732 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 133 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-01-09 02:43:51,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 133 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:43:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 02:43:51,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-01-09 02:43:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 74 states have internal predecessors, (86), 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-01-09 02:43:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2025-01-09 02:43:51,744 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 21 [2025-01-09 02:43:51,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:43:51,744 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2025-01-09 02:43:51,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-01-09 02:43:51,744 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2025-01-09 02:43:51,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 02:43:51,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:43:51,745 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] [2025-01-09 02:43:51,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 02:43:51,745 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-01-09 02:43:51,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:43:51,745 INFO L85 PathProgramCache]: Analyzing trace with hash -122363609, now seen corresponding path program 1 times [2025-01-09 02:43:51,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:43:51,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976069738] [2025-01-09 02:43:51,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:51,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:43:51,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 02:43:51,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 02:43:51,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:51,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:43:51,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:43:51,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976069738] [2025-01-09 02:43:51,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976069738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:43:51,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:43:51,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:43:51,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932029002] [2025-01-09 02:43:51,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:43:51,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:43:51,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:43:51,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:43:51,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:43:51,933 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-01-09 02:43:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:43:52,121 INFO L93 Difference]: Finished difference Result 209 states and 238 transitions. [2025-01-09 02:43:52,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 02:43:52,121 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 24 [2025-01-09 02:43:52,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:43:52,122 INFO L225 Difference]: With dead ends: 209 [2025-01-09 02:43:52,122 INFO L226 Difference]: Without dead ends: 166 [2025-01-09 02:43:52,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-01-09 02:43:52,124 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 184 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:43:52,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 351 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:43:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-09 02:43:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 98. [2025-01-09 02:43:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 97 states have internal predecessors, (114), 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-01-09 02:43:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2025-01-09 02:43:52,139 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 24 [2025-01-09 02:43:52,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:43:52,140 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2025-01-09 02:43:52,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-01-09 02:43:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2025-01-09 02:43:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 02:43:52,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:43:52,141 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] [2025-01-09 02:43:52,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 02:43:52,142 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-01-09 02:43:52,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:43:52,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1103897268, now seen corresponding path program 1 times [2025-01-09 02:43:52,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:43:52,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851627377] [2025-01-09 02:43:52,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:52,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:43:52,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 02:43:52,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 02:43:52,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:52,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:43:52,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:43:52,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851627377] [2025-01-09 02:43:52,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851627377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:43:52,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:43:52,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:43:52,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46453944] [2025-01-09 02:43:52,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:43:52,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:43:52,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:43:52,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:43:52,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:43:52,209 INFO L87 Difference]: Start difference. First operand 98 states and 114 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-01-09 02:43:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:43:52,224 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2025-01-09 02:43:52,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:43:52,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2025-01-09 02:43:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:43:52,225 INFO L225 Difference]: With dead ends: 102 [2025-01-09 02:43:52,225 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 02:43:52,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:43:52,226 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:43:52,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:43:52,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 02:43:52,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-01-09 02:43:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 93 states have (on average 1.2473118279569892) internal successors, (116), 99 states have internal predecessors, (116), 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-01-09 02:43:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2025-01-09 02:43:52,235 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 24 [2025-01-09 02:43:52,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:43:52,236 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2025-01-09 02:43:52,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-01-09 02:43:52,237 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2025-01-09 02:43:52,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 02:43:52,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:43:52,237 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] [2025-01-09 02:43:52,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 02:43:52,237 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-01-09 02:43:52,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:43:52,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1103899190, now seen corresponding path program 1 times [2025-01-09 02:43:52,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:43:52,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867087677] [2025-01-09 02:43:52,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:52,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:43:52,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 02:43:52,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 02:43:52,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:52,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:43:52,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:43:52,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867087677] [2025-01-09 02:43:52,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867087677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:43:52,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:43:52,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:43:52,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771846865] [2025-01-09 02:43:52,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:43:52,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:43:52,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:43:52,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:43:52,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:43:52,359 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-01-09 02:43:52,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:43:52,408 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2025-01-09 02:43:52,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:43:52,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2025-01-09 02:43:52,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:43:52,409 INFO L225 Difference]: With dead ends: 101 [2025-01-09 02:43:52,410 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 02:43:52,410 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-01-09 02:43:52,410 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:43:52,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 119 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:43:52,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 02:43:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2025-01-09 02:43:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 95 states have internal predecessors, (111), 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-01-09 02:43:52,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2025-01-09 02:43:52,422 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 24 [2025-01-09 02:43:52,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:43:52,423 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2025-01-09 02:43:52,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-01-09 02:43:52,423 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2025-01-09 02:43:52,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 02:43:52,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:43:52,423 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] [2025-01-09 02:43:52,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 02:43:52,424 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-01-09 02:43:52,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:43:52,424 INFO L85 PathProgramCache]: Analyzing trace with hash -222959449, now seen corresponding path program 1 times [2025-01-09 02:43:52,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:43:52,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546955124] [2025-01-09 02:43:52,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:52,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:43:52,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 02:43:52,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 02:43:52,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:52,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:52,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:43:52,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:43:52,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546955124] [2025-01-09 02:43:52,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546955124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:43:52,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:43:52,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:43:52,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748638080] [2025-01-09 02:43:52,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:43:52,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:43:52,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:43:52,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:43:52,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:43:52,970 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-01-09 02:43:53,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:43:53,274 INFO L93 Difference]: Finished difference Result 213 states and 241 transitions. [2025-01-09 02:43:53,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 02:43:53,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 24 [2025-01-09 02:43:53,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:43:53,276 INFO L225 Difference]: With dead ends: 213 [2025-01-09 02:43:53,276 INFO L226 Difference]: Without dead ends: 211 [2025-01-09 02:43:53,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-01-09 02:43:53,277 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 206 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:43:53,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 403 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:43:53,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-01-09 02:43:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 108. [2025-01-09 02:43:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 107 states have internal predecessors, (125), 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-01-09 02:43:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2025-01-09 02:43:53,291 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 24 [2025-01-09 02:43:53,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:43:53,291 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2025-01-09 02:43:53,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-01-09 02:43:53,291 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2025-01-09 02:43:53,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 02:43:53,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:43:53,294 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-01-09 02:43:53,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 02:43:53,294 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-01-09 02:43:53,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:43:53,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1521471305, now seen corresponding path program 1 times [2025-01-09 02:43:53,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:43:53,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042274354] [2025-01-09 02:43:53,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:53,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:43:53,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:43:53,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:43:53,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:53,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:53,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:43:53,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:43:53,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042274354] [2025-01-09 02:43:53,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042274354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:43:53,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:43:53,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:43:53,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106096221] [2025-01-09 02:43:53,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:43:53,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:43:53,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:43:53,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:43:53,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:43:53,372 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-01-09 02:43:53,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:43:53,474 INFO L93 Difference]: Finished difference Result 159 states and 183 transitions. [2025-01-09 02:43:53,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:43:53,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-01-09 02:43:53,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:43:53,475 INFO L225 Difference]: With dead ends: 159 [2025-01-09 02:43:53,475 INFO L226 Difference]: Without dead ends: 141 [2025-01-09 02:43:53,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:43:53,476 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 49 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:43:53,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 196 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:43:53,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-09 02:43:53,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 134. [2025-01-09 02:43:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 128 states have (on average 1.2421875) internal successors, (159), 133 states have internal predecessors, (159), 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-01-09 02:43:53,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 159 transitions. [2025-01-09 02:43:53,496 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 159 transitions. Word has length 26 [2025-01-09 02:43:53,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:43:53,496 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 159 transitions. [2025-01-09 02:43:53,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-01-09 02:43:53,496 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 159 transitions. [2025-01-09 02:43:53,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 02:43:53,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:43:53,497 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-01-09 02:43:53,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 02:43:53,497 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-01-09 02:43:53,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:43:53,497 INFO L85 PathProgramCache]: Analyzing trace with hash -661850423, now seen corresponding path program 1 times [2025-01-09 02:43:53,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:43:53,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611311485] [2025-01-09 02:43:53,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:53,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:43:53,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:43:53,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:43:53,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:53,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:53,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:43:53,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:43:53,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611311485] [2025-01-09 02:43:53,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611311485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:43:53,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:43:53,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:43:53,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059137269] [2025-01-09 02:43:53,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:43:53,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:43:53,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:43:53,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:43:53,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:43:53,533 INFO L87 Difference]: Start difference. First operand 134 states and 159 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-01-09 02:43:53,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:43:53,582 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2025-01-09 02:43:53,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:43:53,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-01-09 02:43:53,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:43:53,583 INFO L225 Difference]: With dead ends: 135 [2025-01-09 02:43:53,584 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 02:43:53,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:43:53,584 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 52 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 82 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-01-09 02:43:53,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 82 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:43:53,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 02:43:53,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2025-01-09 02:43:53,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.236220472440945) internal successors, (157), 131 states have internal predecessors, (157), 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-01-09 02:43:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 157 transitions. [2025-01-09 02:43:53,600 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 157 transitions. Word has length 26 [2025-01-09 02:43:53,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:43:53,600 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 157 transitions. [2025-01-09 02:43:53,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-01-09 02:43:53,600 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 157 transitions. [2025-01-09 02:43:53,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 02:43:53,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:43:53,601 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] [2025-01-09 02:43:53,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 02:43:53,601 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-01-09 02:43:53,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:43:53,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2133640527, now seen corresponding path program 1 times [2025-01-09 02:43:53,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:43:53,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914736891] [2025-01-09 02:43:53,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:53,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:43:53,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 02:43:53,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 02:43:53,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:53,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:43:53,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:43:53,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914736891] [2025-01-09 02:43:53,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914736891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:43:53,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:43:53,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:43:53,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309256989] [2025-01-09 02:43:53,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:43:53,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:43:53,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:43:53,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:43:53,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:43:53,999 INFO L87 Difference]: Start difference. First operand 132 states and 157 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-01-09 02:43:54,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:43:54,285 INFO L93 Difference]: Finished difference Result 255 states and 299 transitions. [2025-01-09 02:43:54,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 02:43:54,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 27 [2025-01-09 02:43:54,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:43:54,287 INFO L225 Difference]: With dead ends: 255 [2025-01-09 02:43:54,287 INFO L226 Difference]: Without dead ends: 253 [2025-01-09 02:43:54,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-01-09 02:43:54,287 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 204 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:43:54,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 359 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:43:54,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-09 02:43:54,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 135. [2025-01-09 02:43:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.2307692307692308) internal successors, (160), 134 states have internal predecessors, (160), 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-01-09 02:43:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 160 transitions. [2025-01-09 02:43:54,304 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 160 transitions. Word has length 27 [2025-01-09 02:43:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:43:54,304 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 160 transitions. [2025-01-09 02:43:54,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-01-09 02:43:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 160 transitions. [2025-01-09 02:43:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 02:43:54,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:43:54,305 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] [2025-01-09 02:43:54,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 02:43:54,305 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-01-09 02:43:54,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:43:54,306 INFO L85 PathProgramCache]: Analyzing trace with hash -993733922, now seen corresponding path program 1 times [2025-01-09 02:43:54,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:43:54,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353145995] [2025-01-09 02:43:54,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:54,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:43:54,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 02:43:54,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 02:43:54,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:54,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:43:54,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:43:54,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353145995] [2025-01-09 02:43:54,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353145995] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:43:54,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671499279] [2025-01-09 02:43:54,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:54,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:43:54,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:43:54,420 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:43:54,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 02:43:54,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 02:43:54,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 02:43:54,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:54,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:54,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 02:43:54,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:43:54,535 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-01-09 02:43:54,539 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-01-09 02:43:54,572 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 23 treesize of output 11 [2025-01-09 02:43:54,577 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-01-09 02:43:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:43:54,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:43:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:43:54,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671499279] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:43:54,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:43:54,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 8 [2025-01-09 02:43:54,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852646469] [2025-01-09 02:43:54,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:43:54,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 02:43:54,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:43:54,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 02:43:54,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 02:43:54,847 INFO L87 Difference]: Start difference. First operand 135 states and 160 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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-01-09 02:43:55,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:43:55,066 INFO L93 Difference]: Finished difference Result 240 states and 279 transitions. [2025-01-09 02:43:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 02:43:55,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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-01-09 02:43:55,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:43:55,068 INFO L225 Difference]: With dead ends: 240 [2025-01-09 02:43:55,068 INFO L226 Difference]: Without dead ends: 178 [2025-01-09 02:43:55,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-09 02:43:55,068 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 164 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:43:55,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 258 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:43:55,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-09 02:43:55,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 137. [2025-01-09 02:43:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.2121212121212122) internal successors, (160), 136 states have internal predecessors, (160), 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-01-09 02:43:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2025-01-09 02:43:55,082 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 29 [2025-01-09 02:43:55,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:43:55,082 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2025-01-09 02:43:55,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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-01-09 02:43:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2025-01-09 02:43:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 02:43:55,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:43:55,083 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-01-09 02:43:55,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 02:43:55,287 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,SelfDestructingSolverStorable14 [2025-01-09 02:43:55,287 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-01-09 02:43:55,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:43:55,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1013161564, now seen corresponding path program 1 times [2025-01-09 02:43:55,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:43:55,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784741979] [2025-01-09 02:43:55,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:55,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:43:55,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 02:43:55,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 02:43:55,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:55,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:43:55,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:43:55,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784741979] [2025-01-09 02:43:55,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784741979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:43:55,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:43:55,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 02:43:55,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889632166] [2025-01-09 02:43:55,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:43:55,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 02:43:55,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:43:55,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 02:43:55,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 02:43:55,531 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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-01-09 02:43:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:43:55,780 INFO L93 Difference]: Finished difference Result 228 states and 254 transitions. [2025-01-09 02:43:55,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 02:43:55,780 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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-01-09 02:43:55,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:43:55,781 INFO L225 Difference]: With dead ends: 228 [2025-01-09 02:43:55,781 INFO L226 Difference]: Without dead ends: 197 [2025-01-09 02:43:55,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-01-09 02:43:55,782 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 291 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:43:55,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 352 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:43:55,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-01-09 02:43:55,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 141. [2025-01-09 02:43:55,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.1985294117647058) internal successors, (163), 140 states have internal predecessors, (163), 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-01-09 02:43:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2025-01-09 02:43:55,797 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 29 [2025-01-09 02:43:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:43:55,798 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2025-01-09 02:43:55,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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-01-09 02:43:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2025-01-09 02:43:55,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 02:43:55,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:43:55,799 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-01-09 02:43:55,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 02:43:55,799 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-01-09 02:43:55,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:43:55,800 INFO L85 PathProgramCache]: Analyzing trace with hash -612889099, now seen corresponding path program 1 times [2025-01-09 02:43:55,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:43:55,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306119450] [2025-01-09 02:43:55,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:55,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:43:55,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 02:43:55,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:43:55,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:55,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:43:55,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:43:55,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306119450] [2025-01-09 02:43:55,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306119450] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:43:55,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962824006] [2025-01-09 02:43:55,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:55,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:43:55,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:43:55,910 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:43:55,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 02:43:55,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 02:43:55,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:43:55,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:55,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:55,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 02:43:55,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:43:55,993 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-01-09 02:43:56,014 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-01-09 02:43:56,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 02:43:56,038 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-01-09 02:43:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:43:56,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:43:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:43:56,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962824006] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:43:56,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:43:56,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 7 [2025-01-09 02:43:56,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323471738] [2025-01-09 02:43:56,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:43:56,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:43:56,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:43:56,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:43:56,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:43:56,222 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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-01-09 02:43:56,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:43:56,426 INFO L93 Difference]: Finished difference Result 232 states and 262 transitions. [2025-01-09 02:43:56,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 02:43:56,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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-01-09 02:43:56,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:43:56,428 INFO L225 Difference]: With dead ends: 232 [2025-01-09 02:43:56,428 INFO L226 Difference]: Without dead ends: 200 [2025-01-09 02:43:56,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 02:43:56,428 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 107 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:43:56,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 368 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:43:56,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-01-09 02:43:56,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 153. [2025-01-09 02:43:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.2364864864864864) internal successors, (183), 152 states have internal predecessors, (183), 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-01-09 02:43:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 183 transitions. [2025-01-09 02:43:56,444 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 183 transitions. Word has length 32 [2025-01-09 02:43:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:43:56,444 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 183 transitions. [2025-01-09 02:43:56,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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-01-09 02:43:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 183 transitions. [2025-01-09 02:43:56,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 02:43:56,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:43:56,444 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] [2025-01-09 02:43:56,450 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-01-09 02:43:56,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 02:43:56,645 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-01-09 02:43:56,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:43:56,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1103582660, now seen corresponding path program 1 times [2025-01-09 02:43:56,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:43:56,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79668811] [2025-01-09 02:43:56,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:56,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:43:56,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 02:43:56,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:43:56,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:56,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:43:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:43:56,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:43:56,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79668811] [2025-01-09 02:43:56,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79668811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:43:56,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:43:56,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:43:56,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916309551] [2025-01-09 02:43:56,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:43:56,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:43:56,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:43:56,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:43:56,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:43:56,672 INFO L87 Difference]: Start difference. First operand 153 states and 183 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-01-09 02:43:56,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:43:56,707 INFO L93 Difference]: Finished difference Result 284 states and 350 transitions. [2025-01-09 02:43:56,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:43:56,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-01-09 02:43:56,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:43:56,708 INFO L225 Difference]: With dead ends: 284 [2025-01-09 02:43:56,709 INFO L226 Difference]: Without dead ends: 202 [2025-01-09 02:43:56,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:43:56,709 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 9 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:43:56,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 143 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:43:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-09 02:43:56,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 190. [2025-01-09 02:43:56,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 185 states have (on average 1.2378378378378379) internal successors, (229), 189 states have internal predecessors, (229), 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-01-09 02:43:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 229 transitions. [2025-01-09 02:43:56,743 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 229 transitions. Word has length 32 [2025-01-09 02:43:56,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:43:56,743 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 229 transitions. [2025-01-09 02:43:56,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-01-09 02:43:56,743 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 229 transitions. [2025-01-09 02:43:56,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 02:43:56,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:43:56,744 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 02:43:56,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 02:43:56,744 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-01-09 02:43:56,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:43:56,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1550975195, now seen corresponding path program 1 times [2025-01-09 02:43:56,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:43:56,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325256014] [2025-01-09 02:43:56,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:43:56,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:43:56,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 02:43:56,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:43:56,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:56,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 02:43:56,762 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 02:43:56,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 02:43:56,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:43:56,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:43:56,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 02:43:56,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 02:43:56,783 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 02:43:56,783 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (12 of 13 remaining) [2025-01-09 02:43:56,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 13 remaining) [2025-01-09 02:43:56,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (10 of 13 remaining) [2025-01-09 02:43:56,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (9 of 13 remaining) [2025-01-09 02:43:56,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 13 remaining) [2025-01-09 02:43:56,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (7 of 13 remaining) [2025-01-09 02:43:56,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (6 of 13 remaining) [2025-01-09 02:43:56,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (5 of 13 remaining) [2025-01-09 02:43:56,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (4 of 13 remaining) [2025-01-09 02:43:56,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 13 remaining) [2025-01-09 02:43:56,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (2 of 13 remaining) [2025-01-09 02:43:56,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (1 of 13 remaining) [2025-01-09 02:43:56,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (0 of 13 remaining) [2025-01-09 02:43:56,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 02:43:56,788 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:43:56,811 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 02:43:56,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:43:56 BoogieIcfgContainer [2025-01-09 02:43:56,814 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 02:43:56,814 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 02:43:56,814 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 02:43:56,814 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 02:43:56,816 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:43:50" (3/4) ... [2025-01-09 02:43:56,817 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 02:43:56,857 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 24. [2025-01-09 02:43:56,907 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 02:43:56,907 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 02:43:56,907 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 02:43:56,909 INFO L158 Benchmark]: Toolchain (without parser) took 7182.09ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 131.3MB in the beginning and 221.8MB in the end (delta: -90.6MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2025-01-09 02:43:56,909 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:43:56,909 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.59ms. Allocated memory is still 167.8MB. Free memory was 131.0MB in the beginning and 112.6MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 02:43:56,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.03ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 110.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:43:56,910 INFO L158 Benchmark]: Boogie Preprocessor took 45.01ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 108.0MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:43:56,910 INFO L158 Benchmark]: RCFGBuilder took 420.58ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 86.3MB in the end (delta: 21.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 02:43:56,910 INFO L158 Benchmark]: TraceAbstraction took 6311.11ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 85.7MB in the beginning and 227.8MB in the end (delta: -142.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:43:56,910 INFO L158 Benchmark]: Witness Printer took 93.71ms. Allocated memory is still 276.8MB. Free memory was 227.8MB in the beginning and 221.8MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:43:56,911 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.80ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.59ms. Allocated memory is still 167.8MB. Free memory was 131.0MB in the beginning and 112.6MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.03ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 110.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.01ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 108.0MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 420.58ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 86.3MB in the end (delta: 21.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6311.11ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 85.7MB in the beginning and 227.8MB in the end (delta: -142.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 93.71ms. Allocated memory is still 276.8MB. Free memory was 227.8MB in the beginning and 221.8MB in the end (delta: 6.0MB). 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 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] 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 FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list 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 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] 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] 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={54: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={54:5}, len=2, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={54:5}, len=2, list={-1:0}] [L1035] COND FALSE !(0) VAL [end={-1:0}, inner={54:5}, len=2, list={-1:0}] [L1036] EXPR inner->inner [L1036] COND TRUE !(((void*)0) == inner->inner) [L1036] reach_error() VAL [end={-1:0}, inner={54:5}, len=2, list={-1:0}] - 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. - 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: 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: 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: 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: 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: 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: 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: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1567 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1567 mSDsluCounter, 3892 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2533 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1365 IncrementalHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 1359 mSDtfsCounter, 1365 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=18, InterpolantAutomatonStates: 96, 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, 18 MinimizatonAttempts, 572 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 491 NumberOfCodeBlocks, 491 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 494 ConstructedInterpolants, 0 QuantifiedInterpolants, 4420 SizeOfPredicates, 6 NumberOfNonLiveVariables, 262 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 12/19 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-01-09 02:43:56,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE