./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-queue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/sll-queue-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9a441ad5f70efa202eb02609b90cbc83f5bf4487618c2a09bffcfe320d65f90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:38:52,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:38:52,900 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:38:52,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:38:52,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:38:52,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:38:52,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:38:52,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:38:52,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:38:52,928 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:38:52,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:38:52,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:38:52,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:38:52,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:38:52,929 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:38:52,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:38:52,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:38:52,930 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:38:52,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:38:52,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:38:52,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:38:52,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:38:52,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:38:52,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:38:52,930 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:38:52,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:38:52,930 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:38:52,930 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:38:52,931 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:38:52,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:38:52,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:38:52,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:38:52,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:38:52,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:38:52,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:38:52,931 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:38:52,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:38:52,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:38:52,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:38:52,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:38:52,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:38:52,932 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:38:52,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:38:52,932 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9a441ad5f70efa202eb02609b90cbc83f5bf4487618c2a09bffcfe320d65f90 [2025-03-16 17:38:53,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:38:53,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:38:53,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:38:53,171 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:38:53,172 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:38:53,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-1.i [2025-03-16 17:38:54,316 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c84a3c8/981a398ccb3741afbb58031b34039b85/FLAG221dc1670 [2025-03-16 17:38:54,556 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:38:54,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i [2025-03-16 17:38:54,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c84a3c8/981a398ccb3741afbb58031b34039b85/FLAG221dc1670 [2025-03-16 17:38:54,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c84a3c8/981a398ccb3741afbb58031b34039b85 [2025-03-16 17:38:54,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:38:54,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:38:54,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:38:54,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:38:54,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:38:54,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:38:54" (1/1) ... [2025-03-16 17:38:54,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7011d131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:54, skipping insertion in model container [2025-03-16 17:38:54,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:38:54" (1/1) ... [2025-03-16 17:38:54,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:38:54,751 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[22387,22400] [2025-03-16 17:38:54,755 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[22458,22471] [2025-03-16 17:38:54,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[22532,22545] [2025-03-16 17:38:54,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[22624,22637] [2025-03-16 17:38:54,757 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[22701,22714] [2025-03-16 17:38:54,758 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[22796,22809] [2025-03-16 17:38:54,758 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[22873,22886] [2025-03-16 17:38:54,759 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[22956,22969] [2025-03-16 17:38:54,760 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[23051,23064] [2025-03-16 17:38:54,761 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[23128,23141] [2025-03-16 17:38:54,762 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[23211,23224] [2025-03-16 17:38:54,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[23300,23313] [2025-03-16 17:38:54,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[23386,23399] [2025-03-16 17:38:54,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[23532,23545] [2025-03-16 17:38:54,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:38:54,772 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:38:54,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[22387,22400] [2025-03-16 17:38:54,807 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[22458,22471] [2025-03-16 17:38:54,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[22532,22545] [2025-03-16 17:38:54,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[22624,22637] [2025-03-16 17:38:54,810 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[22701,22714] [2025-03-16 17:38:54,810 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[22796,22809] [2025-03-16 17:38:54,810 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[22873,22886] [2025-03-16 17:38:54,811 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[22956,22969] [2025-03-16 17:38:54,811 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[23051,23064] [2025-03-16 17:38:54,812 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[23128,23141] [2025-03-16 17:38:54,812 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[23211,23224] [2025-03-16 17:38:54,812 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[23300,23313] [2025-03-16 17:38:54,815 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[23386,23399] [2025-03-16 17:38:54,816 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[23532,23545] [2025-03-16 17:38:54,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:38:54,837 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:38:54,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:54 WrapperNode [2025-03-16 17:38:54,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:38:54,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:38:54,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:38:54,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:38:54,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:54" (1/1) ... [2025-03-16 17:38:54,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:54" (1/1) ... [2025-03-16 17:38:54,859 INFO L138 Inliner]: procedures = 119, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 201 [2025-03-16 17:38:54,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:38:54,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:38:54,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:38:54,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:38:54,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:54" (1/1) ... [2025-03-16 17:38:54,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:54" (1/1) ... [2025-03-16 17:38:54,868 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:54" (1/1) ... [2025-03-16 17:38:54,882 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2025-03-16 17:38:54,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:54" (1/1) ... [2025-03-16 17:38:54,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:54" (1/1) ... [2025-03-16 17:38:54,888 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:54" (1/1) ... [2025-03-16 17:38:54,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:54" (1/1) ... [2025-03-16 17:38:54,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:54" (1/1) ... [2025-03-16 17:38:54,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:54" (1/1) ... [2025-03-16 17:38:54,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:38:54,891 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:38:54,892 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:38:54,892 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:38:54,892 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:54" (1/1) ... [2025-03-16 17:38:54,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:38:54,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:38:54,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 17:38:54,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 17:38:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 17:38:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 17:38:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 17:38:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 17:38:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 17:38:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:38:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 17:38:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 17:38:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 17:38:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 17:38:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 17:38:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:38:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 17:38:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:38:54,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:38:55,010 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:38:55,011 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:38:55,181 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-16 17:38:55,181 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:38:55,190 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:38:55,192 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:38:55,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:38:55 BoogieIcfgContainer [2025-03-16 17:38:55,192 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:38:55,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:38:55,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:38:55,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:38:55,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:38:54" (1/3) ... [2025-03-16 17:38:55,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321e9fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:38:55, skipping insertion in model container [2025-03-16 17:38:55,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:54" (2/3) ... [2025-03-16 17:38:55,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321e9fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:38:55, skipping insertion in model container [2025-03-16 17:38:55,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:38:55" (3/3) ... [2025-03-16 17:38:55,198 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-queue-1.i [2025-03-16 17:38:55,209 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:38:55,210 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-queue-1.i that has 1 procedures, 82 locations, 1 initial locations, 17 loop locations, and 14 error locations. [2025-03-16 17:38:55,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:38:55,251 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;@4fc2d83d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:38:55,251 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-16 17:38:55,254 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 67 states have (on average 2.029850746268657) internal successors, (136), 81 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:38:55,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 17:38:55,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:38:55,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 17:38:55,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2025-03-16 17:38:55,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:38:55,260 INFO L85 PathProgramCache]: Analyzing trace with hash 5108255, now seen corresponding path program 1 times [2025-03-16 17:38:55,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:38:55,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372480141] [2025-03-16 17:38:55,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:38:55,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:38:55,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 17:38:55,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 17:38:55,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:38:55,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:38:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:38:55,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:38:55,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372480141] [2025-03-16 17:38:55,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372480141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:38:55,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:38:55,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:38:55,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690479609] [2025-03-16 17:38:55,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:38:55,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 17:38:55,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:38:55,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 17:38:55,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 17:38:55,385 INFO L87 Difference]: Start difference. First operand has 82 states, 67 states have (on average 2.029850746268657) internal successors, (136), 81 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:38:55,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:38:55,397 INFO L93 Difference]: Finished difference Result 163 states and 271 transitions. [2025-03-16 17:38:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 17:38:55,398 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-16 17:38:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:38:55,403 INFO L225 Difference]: With dead ends: 163 [2025-03-16 17:38:55,403 INFO L226 Difference]: Without dead ends: 79 [2025-03-16 17:38:55,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 17:38:55,406 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:38:55,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:38:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-16 17:38:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-16 17:38:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.353846153846154) internal successors, (88), 78 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-03-16 17:38:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2025-03-16 17:38:55,427 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 4 [2025-03-16 17:38:55,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:38:55,427 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2025-03-16 17:38:55,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:38:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2025-03-16 17:38:55,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-16 17:38:55,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:38:55,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-16 17:38:55,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:38:55,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2025-03-16 17:38:55,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:38:55,429 INFO L85 PathProgramCache]: Analyzing trace with hash 158350276, now seen corresponding path program 1 times [2025-03-16 17:38:55,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:38:55,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652064270] [2025-03-16 17:38:55,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:38:55,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:38:55,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-16 17:38:55,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-16 17:38:55,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:38:55,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:38:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:38:55,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:38:55,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652064270] [2025-03-16 17:38:55,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652064270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:38:55,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:38:55,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:38:55,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881258600] [2025-03-16 17:38:55,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:38:55,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:38:55,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:38:55,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:38:55,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:38:55,491 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-03-16 17:38:55,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:38:55,526 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2025-03-16 17:38:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:38:55,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-03-16 17:38:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:38:55,527 INFO L225 Difference]: With dead ends: 79 [2025-03-16 17:38:55,528 INFO L226 Difference]: Without dead ends: 69 [2025-03-16 17:38:55,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:38:55,528 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:38:55,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 65 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:38:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-16 17:38:55,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-16 17:38:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 60 states have (on average 1.3) internal successors, (78), 68 states have internal predecessors, (78), 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-03-16 17:38:55,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2025-03-16 17:38:55,534 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 5 [2025-03-16 17:38:55,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:38:55,534 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2025-03-16 17:38:55,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-03-16 17:38:55,534 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2025-03-16 17:38:55,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-16 17:38:55,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:38:55,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:38:55,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:38:55,535 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2025-03-16 17:38:55,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:38:55,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1583904017, now seen corresponding path program 1 times [2025-03-16 17:38:55,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:38:55,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204564913] [2025-03-16 17:38:55,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:38:55,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:38:55,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-16 17:38:55,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-16 17:38:55,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:38:55,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:38:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:38:55,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:38:55,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204564913] [2025-03-16 17:38:55,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204564913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:38:55,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:38:55,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:38:55,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291736371] [2025-03-16 17:38:55,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:38:55,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:38:55,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:38:55,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:38:55,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:38:55,619 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-03-16 17:38:55,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:38:55,647 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2025-03-16 17:38:55,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:38:55,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-16 17:38:55,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:38:55,649 INFO L225 Difference]: With dead ends: 69 [2025-03-16 17:38:55,649 INFO L226 Difference]: Without dead ends: 67 [2025-03-16 17:38:55,649 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-03-16 17:38:55,649 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 58 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:38:55,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 80 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:38:55,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-16 17:38:55,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-16 17:38:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 66 states have internal predecessors, (76), 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-03-16 17:38:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2025-03-16 17:38:55,655 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 8 [2025-03-16 17:38:55,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:38:55,655 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2025-03-16 17:38:55,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-03-16 17:38:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2025-03-16 17:38:55,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-16 17:38:55,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:38:55,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:38:55,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 17:38:55,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2025-03-16 17:38:55,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:38:55,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1969959067, now seen corresponding path program 1 times [2025-03-16 17:38:55,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:38:55,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448605488] [2025-03-16 17:38:55,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:38:55,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:38:55,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-16 17:38:55,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-16 17:38:55,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:38:55,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:38:55,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:38:55,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:38:55,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448605488] [2025-03-16 17:38:55,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448605488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:38:55,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:38:55,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:38:55,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362004107] [2025-03-16 17:38:55,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:38:55,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:38:55,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:38:55,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:38:55,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:38:55,723 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-03-16 17:38:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:38:55,765 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2025-03-16 17:38:55,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:38:55,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2025-03-16 17:38:55,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:38:55,766 INFO L225 Difference]: With dead ends: 152 [2025-03-16 17:38:55,766 INFO L226 Difference]: Without dead ends: 86 [2025-03-16 17:38:55,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:38:55,781 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:38:55,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 133 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:38:55,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-16 17:38:55,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2025-03-16 17:38:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 74 states have internal predecessors, (85), 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-03-16 17:38:55,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2025-03-16 17:38:55,792 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 11 [2025-03-16 17:38:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:38:55,792 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2025-03-16 17:38:55,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-03-16 17:38:55,792 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2025-03-16 17:38:55,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 17:38:55,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:38:55,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:38:55,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 17:38:55,792 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2025-03-16 17:38:55,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:38:55,793 INFO L85 PathProgramCache]: Analyzing trace with hash -379245564, now seen corresponding path program 1 times [2025-03-16 17:38:55,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:38:55,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289537214] [2025-03-16 17:38:55,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:38:55,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:38:55,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-16 17:38:55,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 17:38:55,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:38:55,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:38:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:38:55,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:38:55,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289537214] [2025-03-16 17:38:55,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289537214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:38:55,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:38:55,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:38:55,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003691030] [2025-03-16 17:38:55,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:38:55,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:38:55,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:38:55,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:38:55,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:38:55,827 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:38:55,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:38:55,839 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2025-03-16 17:38:55,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:38:55,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-16 17:38:55,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:38:55,842 INFO L225 Difference]: With dead ends: 86 [2025-03-16 17:38:55,842 INFO L226 Difference]: Without dead ends: 75 [2025-03-16 17:38:55,842 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-03-16 17:38:55,842 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:38:55,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:38:55,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-16 17:38:55,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-16 17:38:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 74 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-03-16 17:38:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2025-03-16 17:38:55,851 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 16 [2025-03-16 17:38:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:38:55,851 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2025-03-16 17:38:55,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:38:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2025-03-16 17:38:55,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 17:38:55,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:38:55,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:38:55,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 17:38:55,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2025-03-16 17:38:55,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:38:55,854 INFO L85 PathProgramCache]: Analyzing trace with hash -407874715, now seen corresponding path program 1 times [2025-03-16 17:38:55,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:38:55,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777230180] [2025-03-16 17:38:55,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:38:55,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:38:55,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-16 17:38:55,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 17:38:55,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:38:55,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:38:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:38:55,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:38:55,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777230180] [2025-03-16 17:38:55,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777230180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:38:55,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:38:55,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:38:55,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593896729] [2025-03-16 17:38:55,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:38:55,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:38:55,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:38:55,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:38:55,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:38:55,906 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:38:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:38:55,957 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2025-03-16 17:38:55,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:38:55,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-16 17:38:55,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:38:55,958 INFO L225 Difference]: With dead ends: 95 [2025-03-16 17:38:55,958 INFO L226 Difference]: Without dead ends: 71 [2025-03-16 17:38:55,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:38:55,959 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 7 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:38:55,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 194 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:38:55,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-16 17:38:55,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-16 17:38:55,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 63 states have (on average 1.253968253968254) internal successors, (79), 70 states have internal predecessors, (79), 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-03-16 17:38:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2025-03-16 17:38:55,963 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 16 [2025-03-16 17:38:55,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:38:55,963 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2025-03-16 17:38:55,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:38:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2025-03-16 17:38:55,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 17:38:55,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:38:55,963 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:38:55,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 17:38:55,963 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2025-03-16 17:38:55,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:38:55,964 INFO L85 PathProgramCache]: Analyzing trace with hash 393013346, now seen corresponding path program 1 times [2025-03-16 17:38:55,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:38:55,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219071975] [2025-03-16 17:38:55,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:38:55,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:38:55,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 17:38:55,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 17:38:55,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:38:55,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:38:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:38:56,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:38:56,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219071975] [2025-03-16 17:38:56,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219071975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:38:56,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660415019] [2025-03-16 17:38:56,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:38:56,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:38:56,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:38:56,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:38:56,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 17:38:56,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 17:38:56,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 17:38:56,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:38:56,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:38:56,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-16 17:38:56,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:38:56,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:38:56,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-16 17:38:56,321 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-16 17:38:56,321 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-16 17:38:56,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-16 17:38:56,349 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-16 17:38:56,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-16 17:38:56,371 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-16 17:38:56,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-03-16 17:38:56,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-16 17:38:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:38:56,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:38:56,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:56,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2025-03-16 17:38:56,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:56,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2025-03-16 17:38:56,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-16 17:38:56,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:38:56,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660415019] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:38:56,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:38:56,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-03-16 17:38:56,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289218907] [2025-03-16 17:38:56,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:38:56,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 17:38:56,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:38:56,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 17:38:56,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=80, Unknown=2, NotChecked=0, Total=110 [2025-03-16 17:38:56,614 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 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-03-16 17:38:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:38:56,780 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2025-03-16 17:38:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:38:56,781 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 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 18 [2025-03-16 17:38:56,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:38:56,782 INFO L225 Difference]: With dead ends: 146 [2025-03-16 17:38:56,784 INFO L226 Difference]: Without dead ends: 144 [2025-03-16 17:38:56,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=94, Unknown=2, NotChecked=0, Total=132 [2025-03-16 17:38:56,785 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 75 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:38:56,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 509 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:38:56,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-16 17:38:56,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 84. [2025-03-16 17:38:56,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.236842105263158) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:38:56,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2025-03-16 17:38:56,791 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 18 [2025-03-16 17:38:56,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:38:56,791 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2025-03-16 17:38:56,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 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-03-16 17:38:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2025-03-16 17:38:56,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 17:38:56,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:38:56,793 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:38:56,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 17:38:56,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:38:56,994 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2025-03-16 17:38:56,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:38:56,995 INFO L85 PathProgramCache]: Analyzing trace with hash -255859432, now seen corresponding path program 1 times [2025-03-16 17:38:56,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:38:56,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693895062] [2025-03-16 17:38:56,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:38:56,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:38:57,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 17:38:57,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 17:38:57,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:38:57,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:38:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:38:57,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:38:57,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693895062] [2025-03-16 17:38:57,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693895062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:38:57,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:38:57,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:38:57,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826662365] [2025-03-16 17:38:57,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:38:57,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:38:57,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:38:57,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:38:57,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:38:57,027 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-03-16 17:38:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:38:57,053 INFO L93 Difference]: Finished difference Result 176 states and 201 transitions. [2025-03-16 17:38:57,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:38:57,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2025-03-16 17:38:57,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:38:57,055 INFO L225 Difference]: With dead ends: 176 [2025-03-16 17:38:57,055 INFO L226 Difference]: Without dead ends: 109 [2025-03-16 17:38:57,056 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-03-16 17:38:57,057 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 24 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:38:57,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 125 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:38:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-16 17:38:57,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2025-03-16 17:38:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 89 states have (on average 1.202247191011236) internal successors, (107), 96 states have internal predecessors, (107), 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-03-16 17:38:57,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2025-03-16 17:38:57,067 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 19 [2025-03-16 17:38:57,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:38:57,067 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2025-03-16 17:38:57,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-03-16 17:38:57,067 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2025-03-16 17:38:57,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 17:38:57,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:38:57,069 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:38:57,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 17:38:57,069 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2025-03-16 17:38:57,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:38:57,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1422156587, now seen corresponding path program 1 times [2025-03-16 17:38:57,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:38:57,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373176672] [2025-03-16 17:38:57,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:38:57,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:38:57,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 17:38:57,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 17:38:57,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:38:57,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:38:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 17:38:57,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:38:57,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373176672] [2025-03-16 17:38:57,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373176672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:38:57,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:38:57,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:38:57,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843947345] [2025-03-16 17:38:57,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:38:57,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:38:57,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:38:57,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:38:57,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:38:57,119 INFO L87 Difference]: Start difference. First operand 97 states and 107 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-03-16 17:38:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:38:57,150 INFO L93 Difference]: Finished difference Result 203 states and 230 transitions. [2025-03-16 17:38:57,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:38:57,150 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 26 [2025-03-16 17:38:57,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:38:57,151 INFO L225 Difference]: With dead ends: 203 [2025-03-16 17:38:57,152 INFO L226 Difference]: Without dead ends: 123 [2025-03-16 17:38:57,152 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-03-16 17:38:57,152 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 30 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:38:57,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 140 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:38:57,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-16 17:38:57,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 110. [2025-03-16 17:38:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 109 states have internal predecessors, (121), 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-03-16 17:38:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2025-03-16 17:38:57,165 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 26 [2025-03-16 17:38:57,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:38:57,165 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2025-03-16 17:38:57,165 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-03-16 17:38:57,165 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2025-03-16 17:38:57,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 17:38:57,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:38:57,166 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:38:57,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 17:38:57,166 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2025-03-16 17:38:57,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:38:57,166 INFO L85 PathProgramCache]: Analyzing trace with hash -691552507, now seen corresponding path program 1 times [2025-03-16 17:38:57,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:38:57,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489727909] [2025-03-16 17:38:57,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:38:57,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:38:57,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 17:38:57,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 17:38:57,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:38:57,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:38:57,470 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:38:57,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:38:57,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489727909] [2025-03-16 17:38:57,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489727909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:38:57,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770632453] [2025-03-16 17:38:57,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:38:57,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:38:57,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:38:57,474 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:38:57,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 17:38:57,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 17:38:57,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 17:38:57,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:38:57,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:38:57,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-16 17:38:57,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:38:57,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:38:57,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-16 17:38:57,610 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-16 17:38:57,611 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-16 17:38:57,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-16 17:38:57,648 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:38:57,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-16 17:38:57,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-16 17:38:57,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:38:57,750 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 41 treesize of output 30 [2025-03-16 17:38:57,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2025-03-16 17:38:57,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:38:57,768 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2025-03-16 17:38:57,768 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 36 [2025-03-16 17:38:57,781 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-16 17:38:57,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2025-03-16 17:38:57,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2025-03-16 17:38:57,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-16 17:38:57,874 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:38:57,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:38:57,895 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_358 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2025-03-16 17:38:57,907 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_358 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_22| Int) (v_ArrVal_356 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_356) |v_ULTIMATE.start_main_~item~0#1.base_22| v_ArrVal_358) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_22|) 0)))) is different from false [2025-03-16 17:38:57,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:57,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-16 17:38:57,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:57,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 82 [2025-03-16 17:38:57,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-16 17:38:57,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2025-03-16 17:38:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2025-03-16 17:38:58,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770632453] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:38:58,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:38:58,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2025-03-16 17:38:58,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025062566] [2025-03-16 17:38:58,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:38:58,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 17:38:58,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:38:58,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 17:38:58,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=117, Unknown=2, NotChecked=46, Total=210 [2025-03-16 17:38:58,118 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 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-03-16 17:38:58,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:38:58,410 INFO L93 Difference]: Finished difference Result 173 states and 188 transitions. [2025-03-16 17:38:58,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 17:38:58,410 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 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-03-16 17:38:58,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:38:58,411 INFO L225 Difference]: With dead ends: 173 [2025-03-16 17:38:58,411 INFO L226 Difference]: Without dead ends: 171 [2025-03-16 17:38:58,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=199, Unknown=2, NotChecked=62, Total=342 [2025-03-16 17:38:58,412 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 137 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:38:58,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 654 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 285 Invalid, 0 Unknown, 193 Unchecked, 0.2s Time] [2025-03-16 17:38:58,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-16 17:38:58,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 126. [2025-03-16 17:38:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:38:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2025-03-16 17:38:58,420 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 27 [2025-03-16 17:38:58,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:38:58,420 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2025-03-16 17:38:58,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 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-03-16 17:38:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2025-03-16 17:38:58,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-16 17:38:58,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:38:58,421 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] [2025-03-16 17:38:58,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 17:38:58,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 17:38:58,626 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2025-03-16 17:38:58,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:38:58,626 INFO L85 PathProgramCache]: Analyzing trace with hash 262238911, now seen corresponding path program 1 times [2025-03-16 17:38:58,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:38:58,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063733309] [2025-03-16 17:38:58,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:38:58,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:38:58,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-16 17:38:58,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 17:38:58,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:38:58,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:38:58,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:38:58,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:38:58,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063733309] [2025-03-16 17:38:58,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063733309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:38:58,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444792960] [2025-03-16 17:38:58,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:38:58,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:38:58,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:38:58,975 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:38:58,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 17:38:59,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-16 17:38:59,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 17:38:59,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:38:59,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:38:59,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 17:38:59,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:38:59,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:38:59,077 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-16 17:38:59,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-16 17:38:59,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-16 17:38:59,084 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 16 treesize of output 11 [2025-03-16 17:38:59,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-16 17:38:59,089 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 16 treesize of output 11 [2025-03-16 17:38:59,116 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-16 17:38:59,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 68 [2025-03-16 17:38:59,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2025-03-16 17:38:59,125 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 24 treesize of output 11 [2025-03-16 17:38:59,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-16 17:38:59,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-03-16 17:38:59,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 17:38:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:38:59,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:38:59,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 52 [2025-03-16 17:38:59,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:59,381 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2025-03-16 17:38:59,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:59,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-03-16 17:38:59,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:59,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 47 [2025-03-16 17:38:59,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:59,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 53 [2025-03-16 17:38:59,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2025-03-16 17:38:59,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2025-03-16 17:38:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:38:59,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444792960] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:38:59,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:38:59,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2025-03-16 17:38:59,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154989088] [2025-03-16 17:38:59,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:38:59,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 17:38:59,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:38:59,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 17:38:59,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=195, Unknown=2, NotChecked=0, Total=240 [2025-03-16 17:38:59,488 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 16 states, 16 states have (on average 5.0) internal successors, (80), 15 states have internal predecessors, (80), 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-03-16 17:38:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:38:59,724 INFO L93 Difference]: Finished difference Result 217 states and 235 transitions. [2025-03-16 17:38:59,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 17:38:59,724 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0) internal successors, (80), 15 states have internal predecessors, (80), 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 28 [2025-03-16 17:38:59,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:38:59,725 INFO L225 Difference]: With dead ends: 217 [2025-03-16 17:38:59,725 INFO L226 Difference]: Without dead ends: 215 [2025-03-16 17:38:59,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=329, Unknown=2, NotChecked=0, Total=420 [2025-03-16 17:38:59,725 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 227 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:38:59,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 746 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:38:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-16 17:38:59,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 135. [2025-03-16 17:38:59,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 127 states have (on average 1.1653543307086613) internal successors, (148), 134 states have internal predecessors, (148), 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-03-16 17:38:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 148 transitions. [2025-03-16 17:38:59,732 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 148 transitions. Word has length 28 [2025-03-16 17:38:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:38:59,732 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 148 transitions. [2025-03-16 17:38:59,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0) internal successors, (80), 15 states have internal predecessors, (80), 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-03-16 17:38:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 148 transitions. [2025-03-16 17:38:59,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 17:38:59,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:38:59,734 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:38:59,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 17:38:59,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:38:59,935 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2025-03-16 17:38:59,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:38:59,936 INFO L85 PathProgramCache]: Analyzing trace with hash 918313280, now seen corresponding path program 1 times [2025-03-16 17:38:59,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:38:59,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086808783] [2025-03-16 17:38:59,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:38:59,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:38:59,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 17:38:59,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 17:38:59,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:38:59,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:39:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:39:00,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:39:00,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086808783] [2025-03-16 17:39:00,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086808783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:39:00,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867920583] [2025-03-16 17:39:00,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:39:00,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:39:00,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:39:00,376 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:39:00,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 17:39:00,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 17:39:00,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 17:39:00,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:39:00,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:39:00,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-16 17:39:00,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:39:00,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:39:00,488 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:39:00,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-16 17:39:00,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-16 17:39:00,499 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 16 treesize of output 11 [2025-03-16 17:39:00,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-16 17:39:00,504 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 16 treesize of output 11 [2025-03-16 17:39:00,530 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 16 treesize of output 11 [2025-03-16 17:39:00,535 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 16 treesize of output 11 [2025-03-16 17:39:00,616 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2025-03-16 17:39:00,616 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 31 [2025-03-16 17:39:00,633 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-16 17:39:00,634 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 52 [2025-03-16 17:39:00,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:39:00,645 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-03-16 17:39:00,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 57 [2025-03-16 17:39:00,658 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-16 17:39:00,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 15 [2025-03-16 17:39:00,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-16 17:39:00,672 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-16 17:39:00,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2025-03-16 17:39:00,716 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-16 17:39:00,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 68 [2025-03-16 17:39:00,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-16 17:39:00,859 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-16 17:39:00,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 23 [2025-03-16 17:39:00,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-03-16 17:39:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:39:00,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:39:00,889 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_554))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))) is different from false [2025-03-16 17:39:00,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:39:00,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2025-03-16 17:39:01,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:39:01,022 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 65 [2025-03-16 17:39:01,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:39:01,027 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 49 [2025-03-16 17:39:01,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:39:01,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 1524 treesize of output 1125 [2025-03-16 17:39:01,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:39:01,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1053 treesize of output 1024 [2025-03-16 17:39:01,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1009 treesize of output 973 [2025-03-16 17:39:01,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:39:01,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1011 treesize of output 933 [2025-03-16 17:39:01,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 855 treesize of output 831 [2025-03-16 17:39:01,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:39:01,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 619 treesize of output 619 [2025-03-16 17:39:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-16 17:39:22,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867920583] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:39:22,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:39:22,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 17 [2025-03-16 17:39:22,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228801140] [2025-03-16 17:39:22,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:39:22,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 17:39:22,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:39:22,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 17:39:22,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=222, Unknown=3, NotChecked=30, Total=306 [2025-03-16 17:39:22,120 INFO L87 Difference]: Start difference. First operand 135 states and 148 transitions. Second operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 17 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-03-16 17:39:22,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:39:22,487 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2025-03-16 17:39:22,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 17:39:22,487 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 17 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 30 [2025-03-16 17:39:22,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:39:22,488 INFO L225 Difference]: With dead ends: 157 [2025-03-16 17:39:22,488 INFO L226 Difference]: Without dead ends: 155 [2025-03-16 17:39:22,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=4, NotChecked=38, Total=462 [2025-03-16 17:39:22,488 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 148 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 17:39:22,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 721 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 357 Invalid, 2 Unknown, 84 Unchecked, 0.3s Time] [2025-03-16 17:39:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-16 17:39:22,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 138. [2025-03-16 17:39:22,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 130 states have (on average 1.1615384615384616) internal successors, (151), 137 states have internal predecessors, (151), 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-03-16 17:39:22,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 151 transitions. [2025-03-16 17:39:22,498 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 151 transitions. Word has length 30 [2025-03-16 17:39:22,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:39:22,498 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 151 transitions. [2025-03-16 17:39:22,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 17 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-03-16 17:39:22,498 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 151 transitions. [2025-03-16 17:39:22,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 17:39:22,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:39:22,507 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:39:22,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 17:39:22,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:39:22,711 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2025-03-16 17:39:22,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:39:22,712 INFO L85 PathProgramCache]: Analyzing trace with hash 518504811, now seen corresponding path program 1 times [2025-03-16 17:39:22,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:39:22,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194393501] [2025-03-16 17:39:22,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:39:22,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:39:22,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 17:39:22,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 17:39:22,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:39:22,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:39:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 17:39:22,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:39:22,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194393501] [2025-03-16 17:39:22,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194393501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:39:22,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:39:22,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:39:22,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371634288] [2025-03-16 17:39:22,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:39:22,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:39:22,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:39:22,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:39:22,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:39:22,814 INFO L87 Difference]: Start difference. First operand 138 states and 151 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-03-16 17:39:22,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:39:22,847 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2025-03-16 17:39:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:39:22,847 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 35 [2025-03-16 17:39:22,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:39:22,849 INFO L225 Difference]: With dead ends: 203 [2025-03-16 17:39:22,849 INFO L226 Difference]: Without dead ends: 110 [2025-03-16 17:39:22,850 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-03-16 17:39:22,850 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 40 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:39:22,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 120 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:39:22,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-16 17:39:22,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 95. [2025-03-16 17:39:22,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.1111111111111112) internal successors, (100), 94 states have internal predecessors, (100), 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-03-16 17:39:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2025-03-16 17:39:22,857 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 35 [2025-03-16 17:39:22,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:39:22,858 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2025-03-16 17:39:22,858 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-03-16 17:39:22,858 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2025-03-16 17:39:22,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 17:39:22,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:39:22,859 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:39:22,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 17:39:22,859 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2025-03-16 17:39:22,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:39:22,859 INFO L85 PathProgramCache]: Analyzing trace with hash 809510278, now seen corresponding path program 1 times [2025-03-16 17:39:22,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:39:22,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958582719] [2025-03-16 17:39:22,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:39:22,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:39:22,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 17:39:22,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 17:39:22,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:39:22,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:39:23,161 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:39:23,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:39:23,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958582719] [2025-03-16 17:39:23,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958582719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:39:23,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639771483] [2025-03-16 17:39:23,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:39:23,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:39:23,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:39:23,164 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:39:23,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 17:39:23,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 17:39:23,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 17:39:23,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:39:23,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:39:23,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-16 17:39:23,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:39:23,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:39:23,297 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2025-03-16 17:39:23,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2025-03-16 17:39:23,309 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-16 17:39:23,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-16 17:39:23,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-16 17:39:23,355 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2025-03-16 17:39:23,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 58 [2025-03-16 17:39:23,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2025-03-16 17:39:23,591 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:39:23,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:39:23,684 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (forall ((v_ArrVal_700 (Array Int Int))) (or (forall ((v_ArrVal_701 Int)) (= (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse1 .cse2 v_ArrVal_701)))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_700) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0)) (not (= v_ArrVal_700 (store .cse3 .cse2 (select v_ArrVal_700 .cse2)))))) (forall ((v_ArrVal_700 (Array Int Int))) (or (forall ((v_ArrVal_701 Int)) (= (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_700))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse1 .cse2 v_ArrVal_701)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (not (= v_ArrVal_700 (store .cse3 .cse2 (select v_ArrVal_700 .cse2)))))))) is different from false [2025-03-16 17:39:23,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:39:23,703 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 160 [2025-03-16 17:39:23,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:39:23,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 13551 treesize of output 12918 [2025-03-16 17:39:24,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:39:24,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 5762 treesize of output 5304 [2025-03-16 17:39:32,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:39:32,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2025-03-16 17:39:32,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:39:32,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6