./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.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-rb-cnstr_1-2.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 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:38:56,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:38:56,908 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:56,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:38:56,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:38:56,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:38:56,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:38:56,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:38:56,936 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:38:56,936 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:38:56,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:38:56,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:38:56,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:38:56,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:38:56,937 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:38:56,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:38:56,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:38:56,937 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:38:56,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:38:56,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:38:56,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:38:56,937 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:38:56,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:38:56,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:38:56,938 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:38:56,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:38:56,938 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:38:56,938 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:38:56,938 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:38:56,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:38:56,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:38:56,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:38:56,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:38:56,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:38:56,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:38:56,939 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:38:56,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:38:56,939 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:38:56,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:38:56,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:38:56,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:38:56,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:38:56,939 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:38:56,939 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 -> 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 [2025-03-16 17:38:57,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:38:57,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:38:57,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:38:57,175 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:38:57,175 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:38:57,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2025-03-16 17:38:58,261 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3daeaac63/b94e991d09df404ab1d3426b3d5930c4/FLAGf8fad87d7 [2025-03-16 17:38:58,519 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:38:58,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2025-03-16 17:38:58,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3daeaac63/b94e991d09df404ab1d3426b3d5930c4/FLAGf8fad87d7 [2025-03-16 17:38:58,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3daeaac63/b94e991d09df404ab1d3426b3d5930c4 [2025-03-16 17:38:58,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:38:58,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:38:58,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:38:58,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:38:58,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:38:58,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:38:58" (1/1) ... [2025-03-16 17:38:58,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c714cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:58, skipping insertion in model container [2025-03-16 17:38:58,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:38:58" (1/1) ... [2025-03-16 17:38:58,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:38:58,739 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-rb-cnstr_1-2.i[22480,22493] [2025-03-16 17:38:58,744 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-rb-cnstr_1-2.i[22552,22565] [2025-03-16 17:38:58,746 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-rb-cnstr_1-2.i[22720,22733] [2025-03-16 17:38:58,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:38:58,754 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:38:58,779 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-rb-cnstr_1-2.i[22480,22493] [2025-03-16 17:38:58,782 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-rb-cnstr_1-2.i[22552,22565] [2025-03-16 17:38:58,783 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-rb-cnstr_1-2.i[22720,22733] [2025-03-16 17:38:58,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:38:58,805 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:38:58,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:58 WrapperNode [2025-03-16 17:38:58,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:38:58,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:38:58,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:38:58,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:38:58,811 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:58" (1/1) ... [2025-03-16 17:38:58,824 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:58" (1/1) ... [2025-03-16 17:38:58,836 INFO L138 Inliner]: procedures = 119, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 103 [2025-03-16 17:38:58,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:38:58,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:38:58,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:38:58,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:38:58,842 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:58" (1/1) ... [2025-03-16 17:38:58,842 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:58" (1/1) ... [2025-03-16 17:38:58,844 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:58" (1/1) ... [2025-03-16 17:38:58,855 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2025-03-16 17:38:58,856 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:58" (1/1) ... [2025-03-16 17:38:58,856 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:58" (1/1) ... [2025-03-16 17:38:58,860 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:58" (1/1) ... [2025-03-16 17:38:58,861 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:58" (1/1) ... [2025-03-16 17:38:58,862 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:58" (1/1) ... [2025-03-16 17:38:58,862 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:58" (1/1) ... [2025-03-16 17:38:58,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:38:58,864 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:38:58,864 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:38:58,864 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:38:58,865 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:58" (1/1) ... [2025-03-16 17:38:58,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:38:58,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:38:58,890 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:58,892 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:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 17:38:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 17:38:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 17:38:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 17:38:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 17:38:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:38:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 17:38:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 17:38:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 17:38:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 17:38:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 17:38:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:38:58,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 17:38:58,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:38:58,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:38:58,983 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:38:58,985 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:38:59,127 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-16 17:38:59,128 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:38:59,134 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:38:59,136 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:38:59,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:38:59 BoogieIcfgContainer [2025-03-16 17:38:59,137 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:38:59,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:38:59,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:38:59,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:38:59,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:38:58" (1/3) ... [2025-03-16 17:38:59,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f9a6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:38:59, skipping insertion in model container [2025-03-16 17:38:59,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:58" (2/3) ... [2025-03-16 17:38:59,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f9a6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:38:59, skipping insertion in model container [2025-03-16 17:38:59,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:38:59" (3/3) ... [2025-03-16 17:38:59,145 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2025-03-16 17:38:59,156 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:38:59,158 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-rb-cnstr_1-2.i that has 1 procedures, 26 locations, 1 initial locations, 6 loop locations, and 3 error locations. [2025-03-16 17:38:59,190 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:38:59,201 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;@618ec548, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:38:59,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-16 17:38:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 25 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:59,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-16 17:38:59,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:38:59,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-16 17:38:59,211 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:38:59,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:38:59,216 INFO L85 PathProgramCache]: Analyzing trace with hash 67716831, now seen corresponding path program 1 times [2025-03-16 17:38:59,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:38:59,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130048240] [2025-03-16 17:38:59,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:38:59,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:38:59,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-16 17:38:59,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-16 17:38:59,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:38:59,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:38:59,350 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:59,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:38:59,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130048240] [2025-03-16 17:38:59,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130048240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:38:59,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:38:59,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:38:59,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253767158] [2025-03-16 17:38:59,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:38:59,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 17:38:59,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:38:59,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 17:38:59,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 17:38:59,377 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 25 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) Second operand has 2 states, 2 states have (on average 2.5) 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:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:38:59,386 INFO L93 Difference]: Finished difference Result 48 states and 75 transitions. [2025-03-16 17:38:59,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 17:38:59,388 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) 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:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:38:59,396 INFO L225 Difference]: With dead ends: 48 [2025-03-16 17:38:59,397 INFO L226 Difference]: Without dead ends: 22 [2025-03-16 17:38:59,400 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:59,403 INFO L435 NwaCegarLoop]: 31 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, 31 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:59,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 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:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-16 17:38:59,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-16 17:38:59,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:38:59,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-16 17:38:59,429 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 5 [2025-03-16 17:38:59,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:38:59,429 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-16 17:38:59,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) 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:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-16 17:38:59,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-16 17:38:59,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:38:59,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-16 17:38:59,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:38:59,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:38:59,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:38:59,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2098450137, now seen corresponding path program 1 times [2025-03-16 17:38:59,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:38:59,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695737345] [2025-03-16 17:38:59,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:38:59,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:38:59,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 17:38:59,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 17:38:59,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:38:59,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:38:59,553 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:59,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:38:59,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695737345] [2025-03-16 17:38:59,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695737345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:38:59,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:38:59,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:38:59,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498490992] [2025-03-16 17:38:59,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:38:59,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:38:59,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:38:59,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:38:59,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:38:59,558 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:38:59,611 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-03-16 17:38:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:38:59,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-03-16 17:38:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:38:59,612 INFO L225 Difference]: With dead ends: 30 [2025-03-16 17:38:59,613 INFO L226 Difference]: Without dead ends: 28 [2025-03-16 17:38:59,613 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:59,614 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:38:59,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 24 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:38:59,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-16 17:38:59,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2025-03-16 17:38:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:38:59,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-16 17:38:59,618 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 6 [2025-03-16 17:38:59,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:38:59,618 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-16 17:38:59,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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,618 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-16 17:38:59,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 17:38:59,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:38:59,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:38:59,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:38:59,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:38:59,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:38:59,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1679924800, now seen corresponding path program 1 times [2025-03-16 17:38:59,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:38:59,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148995346] [2025-03-16 17:38:59,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:38:59,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:38:59,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 17:38:59,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 17:38:59,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:38:59,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:38:59,792 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:59,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:38:59,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148995346] [2025-03-16 17:38:59,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148995346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:38:59,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:38:59,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:38:59,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23624267] [2025-03-16 17:38:59,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:38:59,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:38:59,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:38:59,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:38:59,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:38:59,794 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:38:59,871 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2025-03-16 17:38:59,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:38:59,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-03-16 17:38:59,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:38:59,872 INFO L225 Difference]: With dead ends: 46 [2025-03-16 17:38:59,872 INFO L226 Difference]: Without dead ends: 44 [2025-03-16 17:38:59,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:38:59,873 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:38:59,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 65 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:38:59,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-16 17:38:59,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 27. [2025-03-16 17:38:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 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,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-16 17:38:59,878 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 9 [2025-03-16 17:38:59,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:38:59,879 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-16 17:38:59,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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,879 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-16 17:38:59,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 17:38:59,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:38:59,879 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:38:59,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 17:38:59,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:38:59,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:38:59,880 INFO L85 PathProgramCache]: Analyzing trace with hash -378978862, now seen corresponding path program 1 times [2025-03-16 17:38:59,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:38:59,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274927039] [2025-03-16 17:38:59,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:38:59,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:38:59,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 17:38:59,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 17:38:59,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:38:59,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:39:00,144 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:39:00,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:39:00,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274927039] [2025-03-16 17:39:00,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274927039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:39:00,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821648833] [2025-03-16 17:39:00,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:39:00,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:39:00,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:39:00,146 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:39:00,148 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:39:00,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 17:39:00,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 17:39:00,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:39:00,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:39:00,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 17:39:00,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:39:00,275 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,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:39:00,350 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-16 17:39:00,350 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:00,361 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 35 treesize of output 18 [2025-03-16 17:39:00,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:39:00,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 11 [2025-03-16 17:39:00,396 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,451 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:39:00,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:39:00,524 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_105 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.base_28| Int) (v_ArrVal_103 (Array Int Int))) (or (not (= v_ArrVal_103 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_103 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_28|) 0)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_103) |v_ULTIMATE.start_main_~end~0#1.base_28| v_ArrVal_105) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1))) is different from false [2025-03-16 17:39:00,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-16 17:39:00,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821648833] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:39:00,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:39:00,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-16 17:39:00,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26735497] [2025-03-16 17:39:00,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:39:00,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 17:39:00,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:39:00,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 17:39:00,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=96, Unknown=5, NotChecked=20, Total=156 [2025-03-16 17:39:00,544 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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:00,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:39:00,786 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2025-03-16 17:39:00,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 17:39:00,788 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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 12 [2025-03-16 17:39:00,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:39:00,792 INFO L225 Difference]: With dead ends: 73 [2025-03-16 17:39:00,792 INFO L226 Difference]: Without dead ends: 71 [2025-03-16 17:39:00,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=217, Unknown=5, NotChecked=32, Total=342 [2025-03-16 17:39:00,793 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 104 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:39:00,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 154 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 115 Invalid, 0 Unknown, 72 Unchecked, 0.1s Time] [2025-03-16 17:39:00,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-16 17:39:00,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 33. [2025-03-16 17:39:00,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 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:39:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2025-03-16 17:39:00,802 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 12 [2025-03-16 17:39:00,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:39:00,802 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-03-16 17:39:00,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2025-03-16 17:39:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 17:39:00,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:39:00,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:39:00,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 17:39:01,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:39:01,005 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:39:01,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:39:01,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1170032527, now seen corresponding path program 1 times [2025-03-16 17:39:01,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:39:01,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094174108] [2025-03-16 17:39:01,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:39:01,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:39:01,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 17:39:01,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 17:39:01,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:39:01,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:39:01,051 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:39:01,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:39:01,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094174108] [2025-03-16 17:39:01,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094174108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:39:01,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:39:01,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:39:01,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001413505] [2025-03-16 17:39:01,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:39:01,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:39:01,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:39:01,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:39:01,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:39:01,052 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:01,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:39:01,101 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2025-03-16 17:39:01,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:39:01,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2025-03-16 17:39:01,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:39:01,101 INFO L225 Difference]: With dead ends: 49 [2025-03-16 17:39:01,101 INFO L226 Difference]: Without dead ends: 41 [2025-03-16 17:39:01,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:39:01,102 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:39:01,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 46 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:39:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-16 17:39:01,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2025-03-16 17:39:01,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 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:01,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2025-03-16 17:39:01,127 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 14 [2025-03-16 17:39:01,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:39:01,128 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-03-16 17:39:01,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:01,128 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2025-03-16 17:39:01,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 17:39:01,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:39:01,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:39:01,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 17:39:01,129 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:39:01,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:39:01,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1170062318, now seen corresponding path program 1 times [2025-03-16 17:39:01,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:39:01,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015718351] [2025-03-16 17:39:01,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:39:01,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:39:01,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 17:39:01,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 17:39:01,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:39:01,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 17:39:01,140 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 17:39:01,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 17:39:01,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 17:39:01,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:39:01,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 17:39:01,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 17:39:01,168 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 17:39:01,169 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-16 17:39:01,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-16 17:39:01,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-16 17:39:01,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 17:39:01,175 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-16 17:39:01,191 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 17:39:01,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 05:39:01 BoogieIcfgContainer [2025-03-16 17:39:01,194 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 17:39:01,194 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 17:39:01,194 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 17:39:01,195 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 17:39:01,195 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:38:59" (3/4) ... [2025-03-16 17:39:01,196 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-16 17:39:01,228 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-03-16 17:39:01,272 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 17:39:01,272 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 17:39:01,272 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 17:39:01,273 INFO L158 Benchmark]: Toolchain (without parser) took 2731.51ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 95.6MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2025-03-16 17:39:01,274 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory was 125.2MB in the beginning and 124.9MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:39:01,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.10ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 87.6MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 17:39:01,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.52ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 86.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:39:01,274 INFO L158 Benchmark]: Boogie Preprocessor took 26.68ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 84.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:39:01,275 INFO L158 Benchmark]: IcfgBuilder took 272.97ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 69.9MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:39:01,275 INFO L158 Benchmark]: TraceAbstraction took 2055.41ms. Allocated memory is still 142.6MB. Free memory was 68.7MB in the beginning and 101.3MB in the end (delta: -32.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:39:01,275 INFO L158 Benchmark]: Witness Printer took 78.07ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 95.6MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:39:01,277 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory was 125.2MB in the beginning and 124.9MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.10ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 87.6MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.52ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 86.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.68ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 84.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 272.97ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 69.9MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2055.41ms. Allocated memory is still 142.6MB. Free memory was 68.7MB in the beginning and 101.3MB in the end (delta: -32.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 78.07ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 95.6MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1049]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1006] SLL* list = malloc(sizeof(SLL)); [L1007] list->next = ((void*)0) [L1008] list->colour = BLACK [L1010] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1013] COND TRUE __VERIFIER_nondet_int() [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1034] end = ((void*)0) [L1035] end = list VAL [end={-1:0}, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1038] COND FALSE !(0) VAL [end={-1:0}, list={-1:0}] [L1039] COND TRUE 0 [L1039] EXPR end->colour [L1039] COND FALSE !(!(BLACK == end->colour)) [L1039] COND FALSE !(0) VAL [end={-1:0}, list={-1:0}] [L1041] COND TRUE ((void*)0) != end [L1043] EXPR end->colour [L1043] COND FALSE !(RED == end->colour) [L1049] COND TRUE 0 [L1049] EXPR end->next [L1049] COND TRUE !(end->next) [L1049] reach_error() VAL [end={-1:0}, list={-1:0}] - UnprovableResult [Line: 1039]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 41 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 320 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 72 IncrementalHoareTripleChecker+Unchecked, 214 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 204 IncrementalHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 106 mSDtfsCounter, 204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=5, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 69 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 63 ConstructedInterpolants, 3 QuantifiedInterpolants, 506 SizeOfPredicates, 6 NumberOfNonLiveVariables, 119 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-16 17:39:01,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE