./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/sll2n_append_equal.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/list-simple/sll2n_append_equal.c -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 2b896c6b554b5c339be469ecfc15ca876d8bd9187b7562287b3d26e3a845c9eb --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:56:35,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:56:36,007 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:56:36,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:56:36,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:56:36,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:56:36,033 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:56:36,033 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:56:36,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:56:36,034 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:56:36,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:56:36,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:56:36,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:56:36,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:56:36,035 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:56:36,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:56:36,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:56:36,036 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:56:36,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:56:36,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:56:36,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:56:36,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:56:36,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:56:36,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:56:36,036 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:56:36,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:56:36,036 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:56:36,036 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:56:36,037 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:56:36,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:56:36,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:56:36,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:56:36,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:36,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:56:36,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:56:36,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:56:36,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:56:36,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:36,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:56:36,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:56:36,038 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:56:36,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:56:36,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:56:36,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:56:36,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:56:36,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:56:36,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:56:36,038 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 -> 2b896c6b554b5c339be469ecfc15ca876d8bd9187b7562287b3d26e3a845c9eb [2025-04-29 10:56:36,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:56:36,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:56:36,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:56:36,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:56:36,248 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:56:36,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_append_equal.c [2025-04-29 10:56:37,589 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/061e83add/ef14a9b73d7a4237a250cd05d5b27fb7/FLAGd64f3aab8 [2025-04-29 10:56:37,835 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:56:37,836 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_append_equal.c [2025-04-29 10:56:37,837 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:56:37,837 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:56:37,841 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/061e83add/ef14a9b73d7a4237a250cd05d5b27fb7/FLAGd64f3aab8 [2025-04-29 10:56:38,590 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/061e83add/ef14a9b73d7a4237a250cd05d5b27fb7 [2025-04-29 10:56:38,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:56:38,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:56:38,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:56:38,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:56:38,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:56:38,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:56:38" (1/1) ... [2025-04-29 10:56:38,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9c6a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:38, skipping insertion in model container [2025-04-29 10:56:38,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:56:38" (1/1) ... [2025-04-29 10:56:38,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:56:38,770 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_append_equal.c[1382,1395] [2025-04-29 10:56:38,773 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:56:38,781 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:56:38,814 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_append_equal.c[1382,1395] [2025-04-29 10:56:38,817 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:56:38,827 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:56:38,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:38 WrapperNode [2025-04-29 10:56:38,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:56:38,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:56:38,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:56:38,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:56:38,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:38" (1/1) ... [2025-04-29 10:56:38,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:38" (1/1) ... [2025-04-29 10:56:38,855 INFO L138 Inliner]: procedures = 18, calls = 29, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 107 [2025-04-29 10:56:38,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:56:38,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:56:38,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:56:38,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:56:38,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:38" (1/1) ... [2025-04-29 10:56:38,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:38" (1/1) ... [2025-04-29 10:56:38,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:38" (1/1) ... [2025-04-29 10:56:38,878 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [9, 6]. 60 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 5 writes are split as follows [4, 1]. [2025-04-29 10:56:38,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:38" (1/1) ... [2025-04-29 10:56:38,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:38" (1/1) ... [2025-04-29 10:56:38,886 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:38" (1/1) ... [2025-04-29 10:56:38,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:38" (1/1) ... [2025-04-29 10:56:38,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:38" (1/1) ... [2025-04-29 10:56:38,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:38" (1/1) ... [2025-04-29 10:56:38,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:38" (1/1) ... [2025-04-29 10:56:38,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:56:38,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:56:38,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:56:38,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:56:38,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:38" (1/1) ... [2025-04-29 10:56:38,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:38,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:38,922 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-04-29 10:56:38,924 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-04-29 10:56:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 10:56:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 10:56:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 10:56:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 10:56:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 10:56:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 10:56:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 10:56:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 10:56:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 10:56:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 10:56:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:56:38,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:56:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 10:56:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 10:56:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 10:56:38,940 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 10:56:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 10:56:39,004 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:56:39,005 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:56:39,135 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-04-29 10:56:39,135 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:56:39,142 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:56:39,142 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 10:56:39,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:56:39 BoogieIcfgContainer [2025-04-29 10:56:39,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:56:39,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:56:39,145 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:56:39,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:56:39,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:56:38" (1/3) ... [2025-04-29 10:56:39,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76511b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:56:39, skipping insertion in model container [2025-04-29 10:56:39,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:38" (2/3) ... [2025-04-29 10:56:39,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76511b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:56:39, skipping insertion in model container [2025-04-29 10:56:39,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:56:39" (3/3) ... [2025-04-29 10:56:39,149 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.c [2025-04-29 10:56:39,157 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:56:39,158 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_append_equal.c that has 2 procedures, 30 locations, 41 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-29 10:56:39,194 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:56:39,201 INFO L340 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;@2851902f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:56:39,201 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:56:39,203 INFO L278 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:39,207 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 10:56:39,207 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:39,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:39,208 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:39,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:39,211 INFO L85 PathProgramCache]: Analyzing trace with hash 706842905, now seen corresponding path program 1 times [2025-04-29 10:56:39,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:39,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241721830] [2025-04-29 10:56:39,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:39,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:39,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 10:56:39,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 10:56:39,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:39,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:39,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:39,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:39,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241721830] [2025-04-29 10:56:39,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241721830] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:39,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:39,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:56:39,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403631959] [2025-04-29 10:56:39,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:39,459 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:56:39,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:39,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:56:39,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:56:39,475 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 10:56:39,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:39,502 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2025-04-29 10:56:39,504 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:56:39,505 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-04-29 10:56:39,505 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:39,509 INFO L225 Difference]: With dead ends: 58 [2025-04-29 10:56:39,509 INFO L226 Difference]: Without dead ends: 27 [2025-04-29 10:56:39,511 INFO L436 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-04-29 10:56:39,514 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:39,516 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 67 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:39,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-04-29 10:56:39,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-04-29 10:56:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-04-29 10:56:39,538 INFO L79 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 16 [2025-04-29 10:56:39,538 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:39,538 INFO L485 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-04-29 10:56:39,539 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 10:56:39,539 INFO L278 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-04-29 10:56:39,540 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 10:56:39,540 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:39,540 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:39,540 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:56:39,540 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:39,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:39,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1963751233, now seen corresponding path program 1 times [2025-04-29 10:56:39,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:39,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384614425] [2025-04-29 10:56:39,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:39,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:39,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 10:56:39,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 10:56:39,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:39,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:56:39,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:39,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384614425] [2025-04-29 10:56:39,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384614425] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:39,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473529927] [2025-04-29 10:56:39,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:39,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:39,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:39,680 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-04-29 10:56:39,682 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-04-29 10:56:39,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 10:56:39,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 10:56:39,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:39,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:39,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 10:56:39,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:39,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:56:39,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473529927] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:56:39,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:56:39,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-29 10:56:39,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277549602] [2025-04-29 10:56:39,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:39,869 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:56:39,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:39,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:56:39,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:56:39,871 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 10:56:39,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:39,897 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2025-04-29 10:56:39,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:56:39,897 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2025-04-29 10:56:39,897 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:39,898 INFO L225 Difference]: With dead ends: 47 [2025-04-29 10:56:39,898 INFO L226 Difference]: Without dead ends: 28 [2025-04-29 10:56:39,898 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:56:39,899 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:39,899 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:39,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-29 10:56:39,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-04-29 10:56:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:39,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-04-29 10:56:39,902 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2025-04-29 10:56:39,902 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:39,902 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-04-29 10:56:39,902 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 10:56:39,902 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-04-29 10:56:39,903 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-29 10:56:39,903 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:39,903 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:39,909 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-04-29 10:56:40,107 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:40,107 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:40,107 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:40,107 INFO L85 PathProgramCache]: Analyzing trace with hash -597510807, now seen corresponding path program 2 times [2025-04-29 10:56:40,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:40,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668897273] [2025-04-29 10:56:40,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:40,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:40,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-29 10:56:40,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 32 statements. [2025-04-29 10:56:40,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 10:56:40,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:40,426 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 10:56:40,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:40,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668897273] [2025-04-29 10:56:40,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668897273] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:40,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:40,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 10:56:40,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992607552] [2025-04-29 10:56:40,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:40,427 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 10:56:40,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:40,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 10:56:40,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:56:40,428 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:40,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:40,544 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2025-04-29 10:56:40,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 10:56:40,545 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2025-04-29 10:56:40,545 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:40,545 INFO L225 Difference]: With dead ends: 38 [2025-04-29 10:56:40,546 INFO L226 Difference]: Without dead ends: 36 [2025-04-29 10:56:40,546 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-29 10:56:40,546 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:40,547 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 133 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:56:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-29 10:56:40,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2025-04-29 10:56:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:40,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-04-29 10:56:40,550 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 32 [2025-04-29 10:56:40,550 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:40,550 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-04-29 10:56:40,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:40,551 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-04-29 10:56:40,551 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-29 10:56:40,551 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:40,551 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:40,551 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:56:40,551 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:40,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:40,552 INFO L85 PathProgramCache]: Analyzing trace with hash -597503863, now seen corresponding path program 1 times [2025-04-29 10:56:40,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:40,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755058235] [2025-04-29 10:56:40,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:40,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:40,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 10:56:40,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 10:56:40,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:40,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 10:56:41,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:41,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755058235] [2025-04-29 10:56:41,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755058235] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:41,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832206384] [2025-04-29 10:56:41,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:41,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:41,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:41,044 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-04-29 10:56:41,046 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-04-29 10:56:41,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 10:56:41,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 10:56:41,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:41,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:41,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-29 10:56:41,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:41,270 INFO L354 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 15 treesize of output 1 [2025-04-29 10:56:41,275 INFO L354 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 16 treesize of output 8 [2025-04-29 10:56:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 10:56:41,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:56:41,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832206384] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:41,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:56:41,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 20 [2025-04-29 10:56:41,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328331201] [2025-04-29 10:56:41,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:41,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 10:56:41,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:41,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 10:56:41,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2025-04-29 10:56:41,278 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:41,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:41,321 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2025-04-29 10:56:41,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 10:56:41,321 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2025-04-29 10:56:41,321 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:41,322 INFO L225 Difference]: With dead ends: 39 [2025-04-29 10:56:41,322 INFO L226 Difference]: Without dead ends: 36 [2025-04-29 10:56:41,322 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2025-04-29 10:56:41,322 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:41,323 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 122 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:41,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-29 10:56:41,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2025-04-29 10:56:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:41,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-04-29 10:56:41,328 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 32 [2025-04-29 10:56:41,328 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:41,328 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-04-29 10:56:41,328 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:41,328 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-04-29 10:56:41,329 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 10:56:41,329 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:41,329 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:41,335 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-04-29 10:56:41,529 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 10:56:41,529 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:41,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:41,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1317771972, now seen corresponding path program 1 times [2025-04-29 10:56:41,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:41,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497128719] [2025-04-29 10:56:41,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:41,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:41,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 10:56:41,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:56:41,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:41,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:41,740 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-29 10:56:41,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:41,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497128719] [2025-04-29 10:56:41,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497128719] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:41,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465298714] [2025-04-29 10:56:41,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:41,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:41,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:41,742 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-04-29 10:56:41,743 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-04-29 10:56:41,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 10:56:41,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:56:41,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:41,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:41,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-04-29 10:56:41,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:41,894 INFO L354 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-04-29 10:56:41,919 INFO L354 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-04-29 10:56:41,978 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 10:56:42,159 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:42,160 INFO L354 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-04-29 10:56:42,170 INFO L354 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-04-29 10:56:42,234 INFO L354 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 11 treesize of output 7 [2025-04-29 10:56:42,244 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 10:56:42,249 INFO L354 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 20 treesize of output 15 [2025-04-29 10:56:42,433 INFO L354 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 45 treesize of output 21 [2025-04-29 10:56:42,440 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 15 treesize of output 7 [2025-04-29 10:56:42,448 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2025-04-29 10:56:42,453 INFO L354 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-04-29 10:56:47,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:47,207 INFO L354 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 53 treesize of output 36 [2025-04-29 10:56:47,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:47,230 INFO L354 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 24 treesize of output 19 [2025-04-29 10:56:47,330 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 10:56:47,330 INFO L354 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-04-29 10:56:47,343 INFO L354 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 20 treesize of output 15 [2025-04-29 10:56:48,206 INFO L325 Elim1Store]: treesize reduction 67, result has 29.5 percent of original size [2025-04-29 10:56:48,206 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 81 treesize of output 65 [2025-04-29 10:56:48,283 INFO L325 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2025-04-29 10:56:48,283 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 21 [2025-04-29 10:56:53,403 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:53,403 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 125 [2025-04-29 10:56:53,657 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:53,657 INFO L354 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 151 [2025-04-29 10:56:57,099 INFO L354 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 27 treesize of output 15 [2025-04-29 10:56:57,106 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-04-29 10:56:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:57,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:59,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465298714] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:59,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:59,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 24] total 31 [2025-04-29 10:56:59,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639471213] [2025-04-29 10:56:59,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:59,002 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 10:56:59,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:59,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 10:56:59,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1383, Unknown=2, NotChecked=0, Total=1482 [2025-04-29 10:56:59,003 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 31 states, 30 states have (on average 1.6) internal successors, (48), 25 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 10:57:13,103 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:57:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:57:13,864 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2025-04-29 10:57:13,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 10:57:13,867 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6) internal successors, (48), 25 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 34 [2025-04-29 10:57:13,867 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:57:13,869 INFO L225 Difference]: With dead ends: 42 [2025-04-29 10:57:13,869 INFO L226 Difference]: Without dead ends: 34 [2025-04-29 10:57:13,870 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=180, Invalid=2366, Unknown=4, NotChecked=0, Total=2550 [2025-04-29 10:57:13,870 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:57:13,870 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 404 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 513 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2025-04-29 10:57:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-04-29 10:57:13,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2025-04-29 10:57:13,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:57:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2025-04-29 10:57:13,874 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 34 [2025-04-29 10:57:13,874 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:57:13,874 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2025-04-29 10:57:13,874 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6) internal successors, (48), 25 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 10:57:13,874 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2025-04-29 10:57:13,875 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 10:57:13,875 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:57:13,875 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:57:13,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 10:57:14,076 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:57:14,077 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:57:14,077 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:57:14,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1914565536, now seen corresponding path program 1 times [2025-04-29 10:57:14,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:57:14,077 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337927972] [2025-04-29 10:57:14,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:57:14,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:57:14,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:57:14,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:57:14,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:57:14,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:57:15,419 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 10:57:15,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:57:15,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337927972] [2025-04-29 10:57:15,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337927972] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:57:15,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087895033] [2025-04-29 10:57:15,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:57:15,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:57:15,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:57:15,422 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-04-29 10:57:15,422 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-04-29 10:57:15,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:57:15,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:57:15,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:57:15,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:57:15,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-04-29 10:57:15,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:57:15,690 INFO L354 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-04-29 10:57:15,721 INFO L354 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-04-29 10:57:15,849 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 10:57:16,143 INFO L354 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 9 treesize of output 3 [2025-04-29 10:57:16,149 INFO L354 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 11 treesize of output 3 [2025-04-29 10:57:16,375 INFO L354 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-04-29 10:57:16,393 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_22| Int)) (let ((.cse0 (select |c_#memory_int#0| |v_node_create_~temp~0#1.base_22|))) (and (= |c_node_create_#in~data#1| (select .cse0 0)) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_22|) 0) (= (store |c_old(#memory_int#0)| |v_node_create_~temp~0#1.base_22| .cse0) |c_#memory_int#0|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3|) 0) 0))) is different from true [2025-04-29 10:57:16,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:57:16,446 INFO L354 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 20 treesize of output 15 [2025-04-29 10:57:16,465 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-29 10:57:16,465 INFO L354 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 15 treesize of output 15 [2025-04-29 10:57:16,922 INFO L354 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-04-29 10:57:17,067 INFO L354 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-04-29 10:57:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2025-04-29 10:57:17,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:57:17,666 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:57:17,666 INFO L354 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 62 [2025-04-29 10:57:17,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087895033] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:57:17,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:57:17,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2025-04-29 10:57:17,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928334487] [2025-04-29 10:57:17,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:57:17,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-29 10:57:17,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:57:17,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-29 10:57:17,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=878, Unknown=19, NotChecked=60, Total=1056 [2025-04-29 10:57:17,796 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 26 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-29 10:57:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:57:19,326 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2025-04-29 10:57:19,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 10:57:19,327 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 26 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2025-04-29 10:57:19,327 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:57:19,327 INFO L225 Difference]: With dead ends: 47 [2025-04-29 10:57:19,328 INFO L226 Difference]: Without dead ends: 45 [2025-04-29 10:57:19,328 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=150, Invalid=1475, Unknown=19, NotChecked=78, Total=1722 [2025-04-29 10:57:19,329 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-29 10:57:19,329 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 183 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 461 Invalid, 0 Unknown, 48 Unchecked, 0.9s Time] [2025-04-29 10:57:19,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-29 10:57:19,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2025-04-29 10:57:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:57:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2025-04-29 10:57:19,334 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 35 [2025-04-29 10:57:19,335 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:57:19,335 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-04-29 10:57:19,335 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 26 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-29 10:57:19,335 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2025-04-29 10:57:19,335 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 10:57:19,335 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:57:19,335 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:57:19,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 10:57:19,535 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:57:19,536 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:57:19,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:57:19,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1914558592, now seen corresponding path program 1 times [2025-04-29 10:57:19,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:57:19,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064230238] [2025-04-29 10:57:19,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:57:19,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:57:19,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:57:19,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:57:19,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:57:19,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:57:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 10:57:19,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:57:19,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064230238] [2025-04-29 10:57:19,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064230238] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:57:19,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089361082] [2025-04-29 10:57:19,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:57:19,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:57:19,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:57:19,831 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-04-29 10:57:19,833 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-04-29 10:57:19,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:57:19,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:57:19,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:57:19,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:57:19,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 10:57:19,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:57:20,183 INFO L354 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 16 treesize of output 8 [2025-04-29 10:57:20,186 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 10:57:20,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:57:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 10:57:20,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089361082] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:57:20,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:57:20,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 10 [2025-04-29 10:57:20,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174874528] [2025-04-29 10:57:20,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:57:20,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 10:57:20,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:57:20,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 10:57:20,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:57:20,284 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:57:24,320 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:57:28,340 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:57:32,382 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:57:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:57:32,565 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2025-04-29 10:57:32,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 10:57:32,565 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2025-04-29 10:57:32,565 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:57:32,566 INFO L225 Difference]: With dead ends: 43 [2025-04-29 10:57:32,566 INFO L226 Difference]: Without dead ends: 40 [2025-04-29 10:57:32,566 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-29 10:57:32,566 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2025-04-29 10:57:32,566 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 159 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 12.2s Time] [2025-04-29 10:57:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-29 10:57:32,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-04-29 10:57:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:57:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2025-04-29 10:57:32,571 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 35 [2025-04-29 10:57:32,571 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:57:32,571 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-04-29 10:57:32,571 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:57:32,571 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2025-04-29 10:57:32,571 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 10:57:32,571 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:57:32,571 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:57:32,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 10:57:32,774 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:57:32,774 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:57:32,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:57:32,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1651437573, now seen corresponding path program 1 times [2025-04-29 10:57:32,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:57:32,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177953220] [2025-04-29 10:57:32,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:57:32,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:57:32,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:57:32,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:57:32,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:57:32,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:57:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 10:57:33,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:57:33,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177953220] [2025-04-29 10:57:33,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177953220] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:57:33,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200507877] [2025-04-29 10:57:33,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:57:33,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:57:33,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:57:33,814 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:57:33,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 10:57:33,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:57:33,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:57:33,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:57:33,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:57:33,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 159 conjuncts are in the unsatisfiable core [2025-04-29 10:57:33,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:57:34,044 INFO L354 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-04-29 10:57:34,154 INFO L354 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-04-29 10:57:34,385 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 10:57:34,859 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:57:34,859 INFO L354 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-04-29 10:57:34,876 INFO L354 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-04-29 10:57:35,008 INFO L354 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 15 treesize of output 1 [2025-04-29 10:57:35,028 INFO L354 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 20 treesize of output 15 [2025-04-29 10:57:35,053 INFO L354 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-04-29 10:57:35,468 INFO L354 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 45 treesize of output 21 [2025-04-29 10:57:35,474 INFO L354 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 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:57:35,482 INFO L354 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-04-29 10:57:35,493 INFO L354 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 11 treesize of output 3 [2025-04-29 10:57:35,829 INFO L354 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-04-29 10:57:36,065 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 10:57:36,066 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-04-29 10:57:36,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:57:36,096 INFO L354 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 53 treesize of output 36 [2025-04-29 10:57:36,139 INFO L325 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-04-29 10:57:36,139 INFO L354 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 24 treesize of output 31 [2025-04-29 10:57:36,195 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 10:57:36,195 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-04-29 10:57:36,921 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-04-29 10:57:36,950 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 37 [2025-04-29 10:57:36,961 INFO L354 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 79 treesize of output 28 [2025-04-29 10:57:37,139 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 42 [2025-04-29 10:57:37,300 INFO L354 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 35 treesize of output 19 [2025-04-29 10:57:37,308 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-04-29 10:57:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:57:37,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:57:39,280 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:57:39,280 INFO L354 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 164 [2025-04-29 10:57:39,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200507877] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:57:39,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:57:39,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25] total 41 [2025-04-29 10:57:39,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504593516] [2025-04-29 10:57:39,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:57:39,579 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-29 10:57:39,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:57:39,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-29 10:57:39,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=2314, Unknown=8, NotChecked=0, Total=2450 [2025-04-29 10:57:39,581 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 41 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 33 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:57:43,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:57:43,309 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2025-04-29 10:57:43,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 10:57:43,310 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 33 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2025-04-29 10:57:43,310 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:57:43,310 INFO L225 Difference]: With dead ends: 48 [2025-04-29 10:57:43,310 INFO L226 Difference]: Without dead ends: 39 [2025-04-29 10:57:43,311 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=260, Invalid=4022, Unknown=8, NotChecked=0, Total=4290 [2025-04-29 10:57:43,312 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-29 10:57:43,312 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 403 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-29 10:57:43,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-04-29 10:57:43,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2025-04-29 10:57:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:57:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-04-29 10:57:43,317 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 37 [2025-04-29 10:57:43,317 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:57:43,317 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-04-29 10:57:43,317 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 33 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:57:43,317 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-04-29 10:57:43,317 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 10:57:43,317 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:57:43,317 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:57:43,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 10:57:43,518 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:57:43,518 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:57:43,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:57:43,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2017766707, now seen corresponding path program 1 times [2025-04-29 10:57:43,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:57:43,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887897039] [2025-04-29 10:57:43,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:57:43,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:57:43,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 10:57:43,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 10:57:43,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:57:43,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:57:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:57:45,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:57:45,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887897039] [2025-04-29 10:57:45,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887897039] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:57:45,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521840391] [2025-04-29 10:57:45,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:57:45,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:57:45,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:57:45,273 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:57:45,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 10:57:45,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 10:57:45,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 10:57:45,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:57:45,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:57:45,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-04-29 10:57:45,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:57:45,676 INFO L354 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-04-29 10:57:45,702 INFO L354 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-04-29 10:57:45,857 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 10:57:45,872 INFO L354 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-04-29 10:57:45,883 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 10:57:46,304 INFO L354 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 11 treesize of output 3 [2025-04-29 10:57:46,310 INFO L354 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 11 treesize of output 3 [2025-04-29 10:57:46,316 INFO L354 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 9 treesize of output 3 [2025-04-29 10:57:46,567 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_49| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_49|) 0) (= (store |c_old(#memory_int#0)| |v_node_create_~temp~0#1.base_49| (select |c_#memory_int#0| |v_node_create_~temp~0#1.base_49|)) |c_#memory_int#0|) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| |v_node_create_~temp~0#1.base_49| (select |c_#memory_$Pointer$#0.base| |v_node_create_~temp~0#1.base_49|))) (= (store |c_old(#memory_$Pointer$#0.offset)| |v_node_create_~temp~0#1.base_49| (select |c_#memory_$Pointer$#0.offset| |v_node_create_~temp~0#1.base_49|)) |c_#memory_$Pointer$#0.offset|))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2025-04-29 10:57:46,624 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 10:57:46,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:57:46,639 INFO L354 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 20 treesize of output 15 [2025-04-29 10:57:46,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:57:46,653 INFO L354 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 20 treesize of output 15 [2025-04-29 10:57:46,673 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-29 10:57:46,673 INFO L354 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 15 treesize of output 15 [2025-04-29 10:57:47,093 INFO L354 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 11 treesize of output 3 [2025-04-29 10:57:47,241 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:57:47,241 INFO L354 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 19 treesize of output 19 [2025-04-29 10:57:47,557 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 10:57:47,557 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-04-29 10:57:47,708 INFO L354 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-04-29 10:57:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-04-29 10:57:47,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:57:49,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521840391] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:57:49,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:57:49,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 41 [2025-04-29 10:57:49,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869339439] [2025-04-29 10:57:49,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:57:49,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-29 10:57:49,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:57:49,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-29 10:57:49,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2085, Unknown=2, NotChecked=92, Total=2352 [2025-04-29 10:57:49,375 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 41 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 35 states have internal predecessors, (54), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Killed by 15