./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/list-simple/sll2n_insert_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:41:27,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:41:27,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:41:27,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:41:27,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:41:27,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:41:27,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:41:27,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:41:27,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:41:27,876 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:41:27,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:41:27,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:41:27,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:41:27,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:41:27,876 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:41:27,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:41:27,876 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:41:27,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:41:27,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:41:27,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:41:27,876 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:41:27,876 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:41:27,876 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:41:27,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:41:27,878 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:41:27,878 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:41:27,878 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:41:27,879 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:41:27,879 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:41:27,879 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:41:27,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:41:27,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:41:27,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:41:27,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:41:27,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:41:27,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:41:27,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:41:27,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:41:27,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:41:27,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:41:27,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:41:27,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:41:27,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:41:27,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:41:27,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:41:27,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:41:27,881 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2025-04-30 10:41:28,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:41:28,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:41:28,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:41:28,112 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:41:28,113 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:41:28,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_insert_equal.i [2025-04-30 10:41:29,437 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe5d8e21/2ed6a59f93174cbfad1551939bdfedd1/FLAGb7bc2de34 [2025-04-30 10:41:29,670 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:41:29,671 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_insert_equal.i [2025-04-30 10:41:29,678 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe5d8e21/2ed6a59f93174cbfad1551939bdfedd1/FLAGb7bc2de34 [2025-04-30 10:41:30,487 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe5d8e21/2ed6a59f93174cbfad1551939bdfedd1 [2025-04-30 10:41:30,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:41:30,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:41:30,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:41:30,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:41:30,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:41:30,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:41:30" (1/1) ... [2025-04-30 10:41:30,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55e9ba76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:30, skipping insertion in model container [2025-04-30 10:41:30,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:41:30" (1/1) ... [2025-04-30 10:41:30,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:41:30,790 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:41:30,799 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:41:30,856 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:41:30,871 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:41:30,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:30 WrapperNode [2025-04-30 10:41:30,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:41:30,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:41:30,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:41:30,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:41:30,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:30" (1/1) ... [2025-04-30 10:41:30,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:30" (1/1) ... [2025-04-30 10:41:30,909 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 114 [2025-04-30 10:41:30,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:41:30,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:41:30,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:41:30,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:41:30,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:30" (1/1) ... [2025-04-30 10:41:30,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:30" (1/1) ... [2025-04-30 10:41:30,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:30" (1/1) ... [2025-04-30 10:41:30,943 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 9, 5]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2025-04-30 10:41:30,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:30" (1/1) ... [2025-04-30 10:41:30,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:30" (1/1) ... [2025-04-30 10:41:30,952 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:30" (1/1) ... [2025-04-30 10:41:30,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:30" (1/1) ... [2025-04-30 10:41:30,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:30" (1/1) ... [2025-04-30 10:41:30,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:30" (1/1) ... [2025-04-30 10:41:30,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:30" (1/1) ... [2025-04-30 10:41:30,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:41:30,972 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:41:30,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:41:30,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:41:30,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:30" (1/1) ... [2025-04-30 10:41:30,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:41:30,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:41:31,007 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-30 10:41:31,010 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-30 10:41:31,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:41:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:41:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:41:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:41:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:41:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:41:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-30 10:41:31,029 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-30 10:41:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:41:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:41:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:41:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:41:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:41:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:41:31,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:41:31,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:41:31,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:41:31,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:41:31,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:41:31,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:41:31,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:41:31,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:41:31,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:41:31,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:41:31,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:41:31,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:41:31,141 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:41:31,142 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:41:31,348 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-04-30 10:41:31,348 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:41:31,357 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:41:31,358 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:41:31,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:41:31 BoogieIcfgContainer [2025-04-30 10:41:31,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:41:31,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:41:31,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:41:31,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:41:31,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:41:30" (1/3) ... [2025-04-30 10:41:31,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6215258f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:41:31, skipping insertion in model container [2025-04-30 10:41:31,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:30" (2/3) ... [2025-04-30 10:41:31,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6215258f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:41:31, skipping insertion in model container [2025-04-30 10:41:31,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:41:31" (3/3) ... [2025-04-30 10:41:31,368 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2025-04-30 10:41:31,377 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:41:31,378 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_insert_equal.i that has 2 procedures, 83 locations, 94 edges, 1 initial locations, 4 loop locations, and 31 error locations. [2025-04-30 10:41:31,402 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:41:31,409 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=None, 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;@8e6c778, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:41:31,409 INFO L341 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-04-30 10:41:31,412 INFO L278 IsEmpty]: Start isEmpty. Operand has 83 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 79 states have internal predecessors, (88), 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-30 10:41:31,414 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:41:31,415 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:31,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:31,415 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:31,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:31,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1809625781, now seen corresponding path program 1 times [2025-04-30 10:41:31,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:31,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865117494] [2025-04-30 10:41:31,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:31,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:31,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:41:31,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:41:31,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:31,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:31,572 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-30 10:41:31,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:31,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865117494] [2025-04-30 10:41:31,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865117494] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:31,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:31,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:41:31,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287858775] [2025-04-30 10:41:31,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:31,582 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:41:31,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:31,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:41:31,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:41:31,601 INFO L87 Difference]: Start difference. First operand has 83 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 79 states have internal predecessors, (88), 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, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:31,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:31,697 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2025-04-30 10:41:31,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:41:31,698 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:41:31,699 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:31,703 INFO L225 Difference]: With dead ends: 80 [2025-04-30 10:41:31,703 INFO L226 Difference]: Without dead ends: 77 [2025-04-30 10:41:31,705 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:41:31,708 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:31,711 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 130 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:41:31,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-30 10:41:31,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-04-30 10:41:31,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 73 states have internal predecessors, (79), 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-30 10:41:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2025-04-30 10:41:31,746 INFO L79 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 7 [2025-04-30 10:41:31,746 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:31,746 INFO L485 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2025-04-30 10:41:31,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:31,746 INFO L278 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2025-04-30 10:41:31,747 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:41:31,747 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:31,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:31,748 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:41:31,748 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:31,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:31,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1809625782, now seen corresponding path program 1 times [2025-04-30 10:41:31,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:31,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140104401] [2025-04-30 10:41:31,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:31,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:31,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:41:31,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:41:31,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:31,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:31,877 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-30 10:41:31,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:31,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140104401] [2025-04-30 10:41:31,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140104401] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:31,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:31,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:41:31,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962744976] [2025-04-30 10:41:31,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:31,880 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:41:31,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:31,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:41:31,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:41:31,881 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:31,934 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2025-04-30 10:41:31,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:41:31,934 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:41:31,934 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:31,935 INFO L225 Difference]: With dead ends: 75 [2025-04-30 10:41:31,935 INFO L226 Difference]: Without dead ends: 75 [2025-04-30 10:41:31,935 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:41:31,936 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:31,936 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 129 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:41:31,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-30 10:41:31,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-04-30 10:41:31,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.711111111111111) internal successors, (77), 71 states have internal predecessors, (77), 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-30 10:41:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2025-04-30 10:41:31,940 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 7 [2025-04-30 10:41:31,940 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:31,940 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2025-04-30 10:41:31,940 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:31,940 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2025-04-30 10:41:31,941 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:41:31,941 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:31,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:31,941 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:41:31,941 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:31,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:31,942 INFO L85 PathProgramCache]: Analyzing trace with hash 981923388, now seen corresponding path program 1 times [2025-04-30 10:41:31,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:31,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437309556] [2025-04-30 10:41:31,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:31,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:31,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:41:31,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:41:31,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:31,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:41:32,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:32,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437309556] [2025-04-30 10:41:32,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437309556] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:32,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:32,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:41:32,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736938864] [2025-04-30 10:41:32,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:32,089 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:41:32,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:32,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:41:32,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:41:32,090 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-30 10:41:32,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:32,196 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2025-04-30 10:41:32,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:41:32,196 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2025-04-30 10:41:32,196 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:32,198 INFO L225 Difference]: With dead ends: 74 [2025-04-30 10:41:32,199 INFO L226 Difference]: Without dead ends: 74 [2025-04-30 10:41:32,199 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:41:32,200 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:32,200 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 241 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:41:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-04-30 10:41:32,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-04-30 10:41:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 70 states have internal predecessors, (76), 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-30 10:41:32,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2025-04-30 10:41:32,208 INFO L79 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 13 [2025-04-30 10:41:32,209 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:32,209 INFO L485 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2025-04-30 10:41:32,209 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-30 10:41:32,209 INFO L278 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2025-04-30 10:41:32,209 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:41:32,209 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:32,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:32,209 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:41:32,210 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:32,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:32,210 INFO L85 PathProgramCache]: Analyzing trace with hash 981923389, now seen corresponding path program 1 times [2025-04-30 10:41:32,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:32,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180322187] [2025-04-30 10:41:32,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:32,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:32,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:41:32,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:41:32,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:32,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:32,391 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-30 10:41:32,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:32,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180322187] [2025-04-30 10:41:32,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180322187] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:32,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:32,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:41:32,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549898178] [2025-04-30 10:41:32,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:32,393 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:41:32,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:32,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:41:32,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:41:32,395 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-30 10:41:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:32,488 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2025-04-30 10:41:32,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:41:32,488 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2025-04-30 10:41:32,489 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:32,489 INFO L225 Difference]: With dead ends: 73 [2025-04-30 10:41:32,490 INFO L226 Difference]: Without dead ends: 73 [2025-04-30 10:41:32,490 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:41:32,491 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:32,491 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 257 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:41:32,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-04-30 10:41:32,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-04-30 10:41:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 69 states have internal predecessors, (75), 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-30 10:41:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2025-04-30 10:41:32,499 INFO L79 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 13 [2025-04-30 10:41:32,499 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:32,499 INFO L485 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2025-04-30 10:41:32,500 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-30 10:41:32,500 INFO L278 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2025-04-30 10:41:32,500 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:41:32,500 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:32,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:32,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:41:32,500 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:32,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:32,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1520416034, now seen corresponding path program 1 times [2025-04-30 10:41:32,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:32,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186144919] [2025-04-30 10:41:32,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:32,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:32,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:41:32,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:41:32,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:32,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:32,562 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-30 10:41:32,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:32,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186144919] [2025-04-30 10:41:32,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186144919] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:32,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:32,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:41:32,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132174959] [2025-04-30 10:41:32,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:32,564 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:41:32,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:32,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:41:32,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:41:32,565 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-30 10:41:32,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:32,573 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2025-04-30 10:41:32,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:41:32,574 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2025-04-30 10:41:32,575 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:32,575 INFO L225 Difference]: With dead ends: 78 [2025-04-30 10:41:32,575 INFO L226 Difference]: Without dead ends: 78 [2025-04-30 10:41:32,575 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-30 10:41:32,576 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 3 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:32,576 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:41:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-30 10:41:32,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2025-04-30 10:41:32,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 70 states have internal predecessors, (76), 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-30 10:41:32,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2025-04-30 10:41:32,584 INFO L79 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 14 [2025-04-30 10:41:32,584 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:32,584 INFO L485 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2025-04-30 10:41:32,585 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-30 10:41:32,585 INFO L278 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2025-04-30 10:41:32,585 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:41:32,585 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:32,585 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:32,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:41:32,586 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:32,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:32,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1505321804, now seen corresponding path program 1 times [2025-04-30 10:41:32,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:32,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865525705] [2025-04-30 10:41:32,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:32,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:32,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:41:32,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:41:32,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:32,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:32,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:41:32,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:32,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865525705] [2025-04-30 10:41:32,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865525705] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:41:32,693 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317469804] [2025-04-30 10:41:32,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:32,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:32,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:41:32,696 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-30 10:41:32,697 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-30 10:41:32,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:41:32,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:41:32,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:32,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:32,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:41:32,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:41:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:41:32,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:41:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:41:32,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317469804] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:41:32,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:41:32,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-30 10:41:32,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103550124] [2025-04-30 10:41:32,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:41:32,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:41:32,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:32,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:41:32,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:41:32,868 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-30 10:41:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:32,880 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2025-04-30 10:41:32,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:41:32,881 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 26 [2025-04-30 10:41:32,881 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:32,882 INFO L225 Difference]: With dead ends: 79 [2025-04-30 10:41:32,882 INFO L226 Difference]: Without dead ends: 79 [2025-04-30 10:41:32,882 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 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-30 10:41:32,882 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:32,883 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 152 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:41:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-30 10:41:32,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-04-30 10:41:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.6) internal successors, (80), 74 states have internal predecessors, (80), 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-30 10:41:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2025-04-30 10:41:32,890 INFO L79 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 26 [2025-04-30 10:41:32,890 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:32,890 INFO L485 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2025-04-30 10:41:32,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-30 10:41:32,890 INFO L278 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2025-04-30 10:41:32,891 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-30 10:41:32,891 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:32,891 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:32,898 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-30 10:41:33,095 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-30 10:41:33,095 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:33,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:33,095 INFO L85 PathProgramCache]: Analyzing trace with hash 360400570, now seen corresponding path program 2 times [2025-04-30 10:41:33,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:33,096 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274691087] [2025-04-30 10:41:33,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:41:33,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:33,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-30 10:41:33,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:41:33,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:41:33,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:33,600 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:41:33,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:33,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274691087] [2025-04-30 10:41:33,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274691087] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:41:33,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746815746] [2025-04-30 10:41:33,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:41:33,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:33,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:41:33,603 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-30 10:41:33,604 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-30 10:41:33,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-30 10:41:33,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:41:33,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:41:33,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:33,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:41:33,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:41:33,743 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-30 10:41:33,765 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 5 treesize of output 3 [2025-04-30 10:41:33,819 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:41:33,820 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2025-04-30 10:41:33,909 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 5 treesize of output 3 [2025-04-30 10:41:33,924 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2025-04-30 10:41:33,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:41:33,964 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-30 10:41:33,984 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-04-30 10:41:33,996 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:41:33,997 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2025-04-30 10:41:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 15 not checked. [2025-04-30 10:41:34,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:41:34,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746815746] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:41:34,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:41:34,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2025-04-30 10:41:34,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188627896] [2025-04-30 10:41:34,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:41:34,213 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:41:34,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:34,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:41:34,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=280, Unknown=2, NotChecked=70, Total=420 [2025-04-30 10:41:34,214 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 16 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-04-30 10:41:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:34,524 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2025-04-30 10:41:34,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:41:34,524 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 16 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2025-04-30 10:41:34,525 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:34,525 INFO L225 Difference]: With dead ends: 91 [2025-04-30 10:41:34,525 INFO L226 Difference]: Without dead ends: 91 [2025-04-30 10:41:34,525 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=373, Unknown=2, NotChecked=82, Total=552 [2025-04-30 10:41:34,526 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 247 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:34,526 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 339 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 361 Invalid, 0 Unknown, 175 Unchecked, 0.2s Time] [2025-04-30 10:41:34,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-04-30 10:41:34,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 75. [2025-04-30 10:41:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.52) internal successors, (76), 70 states have internal predecessors, (76), 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-30 10:41:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2025-04-30 10:41:34,531 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 38 [2025-04-30 10:41:34,531 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:34,531 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2025-04-30 10:41:34,531 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 16 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-04-30 10:41:34,531 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2025-04-30 10:41:34,531 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-30 10:41:34,531 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:34,531 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:34,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:41:34,735 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,SelfDestructingSolverStorable6 [2025-04-30 10:41:34,735 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:34,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:34,736 INFO L85 PathProgramCache]: Analyzing trace with hash 360400571, now seen corresponding path program 1 times [2025-04-30 10:41:34,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:34,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103079470] [2025-04-30 10:41:34,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:34,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:34,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:41:34,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:41:34,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:34,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:35,188 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:41:35,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:35,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103079470] [2025-04-30 10:41:35,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103079470] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:41:35,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698777395] [2025-04-30 10:41:35,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:35,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:35,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:41:35,190 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-30 10:41:35,193 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-30 10:41:35,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:41:35,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:41:35,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:35,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:35,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-30 10:41:35,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:41:35,313 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 8 treesize of output 1 [2025-04-30 10:41:35,327 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 5 treesize of output 3 [2025-04-30 10:41:35,342 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-04-30 10:41:35,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:41:35,378 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-30 10:41:35,409 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 5 treesize of output 3 [2025-04-30 10:41:35,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:41:35,451 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-30 10:41:35,490 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 5 treesize of output 3 [2025-04-30 10:41:35,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:41:35,532 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-30 10:41:35,538 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-04-30 10:41:35,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:41:35,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698777395] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:35,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:41:35,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 12 [2025-04-30 10:41:35,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530852951] [2025-04-30 10:41:35,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:35,539 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:41:35,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:35,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:41:35,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2025-04-30 10:41:35,540 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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-30 10:41:35,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:35,624 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2025-04-30 10:41:35,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:41:35,625 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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) Word has length 38 [2025-04-30 10:41:35,625 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:35,625 INFO L225 Difference]: With dead ends: 77 [2025-04-30 10:41:35,625 INFO L226 Difference]: Without dead ends: 77 [2025-04-30 10:41:35,626 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-04-30 10:41:35,626 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 17 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:35,626 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 202 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 101 Unchecked, 0.1s Time] [2025-04-30 10:41:35,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-30 10:41:35,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2025-04-30 10:41:35,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.48) internal successors, (74), 68 states have internal predecessors, (74), 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-30 10:41:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2025-04-30 10:41:35,630 INFO L79 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 38 [2025-04-30 10:41:35,630 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:35,630 INFO L485 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2025-04-30 10:41:35,630 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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-30 10:41:35,630 INFO L278 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2025-04-30 10:41:35,631 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-30 10:41:35,631 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:35,631 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:35,642 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-30 10:41:35,831 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:35,832 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:35,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:35,832 INFO L85 PathProgramCache]: Analyzing trace with hash -724866945, now seen corresponding path program 1 times [2025-04-30 10:41:35,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:35,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867106659] [2025-04-30 10:41:35,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:35,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:35,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:41:35,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:41:35,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:35,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:41:36,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:36,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867106659] [2025-04-30 10:41:36,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867106659] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:41:36,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325492509] [2025-04-30 10:41:36,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:36,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:36,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:41:36,115 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-30 10:41:36,117 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-30 10:41:36,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:41:36,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:41:36,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:36,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:36,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-30 10:41:36,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:41:36,315 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-30 10:41:36,321 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-04-30 10:41:36,350 INFO L325 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-04-30 10:41:36,350 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 23 treesize of output 24 [2025-04-30 10:41:36,360 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 17 treesize of output 9 [2025-04-30 10:41:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:41:36,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:41:36,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325492509] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:36,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:41:36,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2025-04-30 10:41:36,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654675984] [2025-04-30 10:41:36,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:36,364 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:41:36,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:36,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:41:36,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=332, Unknown=1, NotChecked=36, Total=420 [2025-04-30 10:41:36,365 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (2), 2 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-30 10:41:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:36,491 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2025-04-30 10:41:36,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:41:36,491 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (2), 2 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 41 [2025-04-30 10:41:36,492 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:36,492 INFO L225 Difference]: With dead ends: 90 [2025-04-30 10:41:36,492 INFO L226 Difference]: Without dead ends: 90 [2025-04-30 10:41:36,492 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=443, Unknown=1, NotChecked=42, Total=552 [2025-04-30 10:41:36,493 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 41 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:36,493 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 271 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 155 Unchecked, 0.1s Time] [2025-04-30 10:41:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-04-30 10:41:36,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2025-04-30 10:41:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.5) internal successors, (78), 70 states have internal predecessors, (78), 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-30 10:41:36,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2025-04-30 10:41:36,500 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 41 [2025-04-30 10:41:36,500 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:36,500 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2025-04-30 10:41:36,500 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (2), 2 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-30 10:41:36,500 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2025-04-30 10:41:36,501 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-30 10:41:36,501 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:36,502 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:36,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:41:36,702 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:36,702 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:36,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:36,703 INFO L85 PathProgramCache]: Analyzing trace with hash -724866944, now seen corresponding path program 1 times [2025-04-30 10:41:36,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:36,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894387608] [2025-04-30 10:41:36,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:36,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:36,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:41:36,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:41:36,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:36,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:37,090 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:41:37,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:37,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894387608] [2025-04-30 10:41:37,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894387608] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:41:37,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76523836] [2025-04-30 10:41:37,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:37,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:37,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:41:37,093 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-30 10:41:37,094 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-30 10:41:37,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:41:37,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:41:37,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:37,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:37,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-30 10:41:37,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:41:37,306 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 8 treesize of output 1 [2025-04-30 10:41:37,503 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-30 10:41:37,505 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-30 10:41:37,535 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_5|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-04-30 10:41:37,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:41:37,569 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:41:37,576 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-30 10:41:37,577 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-30 10:41:37,615 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 17 treesize of output 9 [2025-04-30 10:41:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2025-04-30 10:41:37,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:41:37,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76523836] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:41:37,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:41:37,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2025-04-30 10:41:37,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768549294] [2025-04-30 10:41:37,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:41:37,766 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-30 10:41:37,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:37,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-30 10:41:37,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=842, Unknown=1, NotChecked=58, Total=992 [2025-04-30 10:41:37,767 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 28 states, 25 states have (on average 2.32) internal successors, (58), 24 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-30 10:41:38,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:38,357 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2025-04-30 10:41:38,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:41:38,358 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.32) internal successors, (58), 24 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2025-04-30 10:41:38,358 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:38,358 INFO L225 Difference]: With dead ends: 97 [2025-04-30 10:41:38,358 INFO L226 Difference]: Without dead ends: 97 [2025-04-30 10:41:38,359 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=1481, Unknown=1, NotChecked=78, Total=1722 [2025-04-30 10:41:38,359 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 98 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:38,359 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 607 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 716 Invalid, 0 Unknown, 95 Unchecked, 0.4s Time] [2025-04-30 10:41:38,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-04-30 10:41:38,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2025-04-30 10:41:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 76 states have internal predecessors, (83), 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-30 10:41:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2025-04-30 10:41:38,367 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 41 [2025-04-30 10:41:38,367 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:38,367 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2025-04-30 10:41:38,367 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.32) internal successors, (58), 24 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-30 10:41:38,367 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2025-04-30 10:41:38,368 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-30 10:41:38,368 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:38,369 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:38,377 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-30 10:41:38,570 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-30 10:41:38,570 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:38,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:38,570 INFO L85 PathProgramCache]: Analyzing trace with hash -996032795, now seen corresponding path program 1 times [2025-04-30 10:41:38,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:38,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770254889] [2025-04-30 10:41:38,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:38,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:38,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:41:38,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:41:38,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:38,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-04-30 10:41:38,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:38,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770254889] [2025-04-30 10:41:38,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770254889] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:38,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:38,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:41:38,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729847261] [2025-04-30 10:41:38,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:38,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:41:38,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:38,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:41:38,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:41:38,609 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:41:38,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:38,619 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2025-04-30 10:41:38,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:41:38,620 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-04-30 10:41:38,620 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:38,620 INFO L225 Difference]: With dead ends: 83 [2025-04-30 10:41:38,620 INFO L226 Difference]: Without dead ends: 83 [2025-04-30 10:41:38,621 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-30 10:41:38,621 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:38,621 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:41:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-04-30 10:41:38,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-04-30 10:41:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.423728813559322) internal successors, (84), 77 states have internal predecessors, (84), 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-30 10:41:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2025-04-30 10:41:38,624 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 42 [2025-04-30 10:41:38,624 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:38,624 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2025-04-30 10:41:38,624 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:41:38,624 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2025-04-30 10:41:38,625 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:41:38,625 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:38,625 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:38,625 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:41:38,625 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:38,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:38,625 INFO L85 PathProgramCache]: Analyzing trace with hash -812240598, now seen corresponding path program 1 times [2025-04-30 10:41:38,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:38,625 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084126249] [2025-04-30 10:41:38,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:38,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:38,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:41:38,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:41:38,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:38,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:38,688 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-30 10:41:38,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:38,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084126249] [2025-04-30 10:41:38,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084126249] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:38,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:38,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:41:38,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085607784] [2025-04-30 10:41:38,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:38,689 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:41:38,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:38,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:41:38,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:41:38,689 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:41:38,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:38,756 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2025-04-30 10:41:38,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:41:38,756 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2025-04-30 10:41:38,757 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:38,757 INFO L225 Difference]: With dead ends: 82 [2025-04-30 10:41:38,757 INFO L226 Difference]: Without dead ends: 82 [2025-04-30 10:41:38,757 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:41:38,758 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 10 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:38,758 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 210 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:41:38,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-04-30 10:41:38,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-04-30 10:41:38,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 76 states have internal predecessors, (83), 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-30 10:41:38,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2025-04-30 10:41:38,760 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 43 [2025-04-30 10:41:38,761 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:38,761 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2025-04-30 10:41:38,761 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:41:38,761 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2025-04-30 10:41:38,761 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:41:38,761 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:38,761 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:38,761 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:41:38,761 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:38,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:38,762 INFO L85 PathProgramCache]: Analyzing trace with hash -812240597, now seen corresponding path program 1 times [2025-04-30 10:41:38,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:38,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462607664] [2025-04-30 10:41:38,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:38,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:38,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:41:38,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:41:38,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:38,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:38,860 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-30 10:41:38,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:38,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462607664] [2025-04-30 10:41:38,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462607664] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:41:38,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834949185] [2025-04-30 10:41:38,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:38,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:38,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:41:38,864 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-30 10:41:38,865 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-30 10:41:38,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:41:38,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:41:38,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:38,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:38,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:41:38,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:41:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-04-30 10:41:39,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:41:39,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834949185] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:39,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:41:39,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-04-30 10:41:39,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666565600] [2025-04-30 10:41:39,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:39,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:41:39,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:39,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:41:39,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:41:39,008 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-30 10:41:39,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:39,023 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2025-04-30 10:41:39,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:41:39,023 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) Word has length 43 [2025-04-30 10:41:39,024 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:39,024 INFO L225 Difference]: With dead ends: 85 [2025-04-30 10:41:39,024 INFO L226 Difference]: Without dead ends: 85 [2025-04-30 10:41:39,024 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:41:39,024 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 41 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:39,025 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 160 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:41:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-04-30 10:41:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2025-04-30 10:41:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.396551724137931) internal successors, (81), 75 states have internal predecessors, (81), 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-30 10:41:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2025-04-30 10:41:39,028 INFO L79 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 43 [2025-04-30 10:41:39,028 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:39,029 INFO L485 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2025-04-30 10:41:39,029 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-30 10:41:39,029 INFO L278 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2025-04-30 10:41:39,030 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-30 10:41:39,030 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:39,030 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:39,045 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-30 10:41:39,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:39,234 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:39,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:39,235 INFO L85 PathProgramCache]: Analyzing trace with hash 584405666, now seen corresponding path program 1 times [2025-04-30 10:41:39,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:39,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584160676] [2025-04-30 10:41:39,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:39,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:39,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:41:39,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:41:39,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:39,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-04-30 10:41:39,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:39,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584160676] [2025-04-30 10:41:39,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584160676] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:39,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:39,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:41:39,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803728609] [2025-04-30 10:41:39,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:39,313 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:41:39,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:39,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:41:39,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:41:39,313 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-30 10:41:39,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:39,334 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2025-04-30 10:41:39,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:41:39,335 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) Word has length 44 [2025-04-30 10:41:39,335 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:39,335 INFO L225 Difference]: With dead ends: 82 [2025-04-30 10:41:39,335 INFO L226 Difference]: Without dead ends: 82 [2025-04-30 10:41:39,335 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:41:39,336 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 34 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:39,336 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 161 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:41:39,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-04-30 10:41:39,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2025-04-30 10:41:39,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 72 states have internal predecessors, (77), 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-30 10:41:39,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2025-04-30 10:41:39,337 INFO L79 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 44 [2025-04-30 10:41:39,338 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:39,338 INFO L485 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2025-04-30 10:41:39,338 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-30 10:41:39,338 INFO L278 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2025-04-30 10:41:39,338 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-30 10:41:39,338 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:39,338 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:39,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:41:39,338 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:39,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:39,341 INFO L85 PathProgramCache]: Analyzing trace with hash 936712482, now seen corresponding path program 1 times [2025-04-30 10:41:39,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:39,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144772786] [2025-04-30 10:41:39,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:39,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:39,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:41:39,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:41:39,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:39,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-04-30 10:41:39,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:39,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144772786] [2025-04-30 10:41:39,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144772786] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:39,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:39,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:41:39,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477476996] [2025-04-30 10:41:39,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:39,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:41:39,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:39,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:41:39,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:41:39,392 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:41:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:39,433 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2025-04-30 10:41:39,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:41:39,433 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-04-30 10:41:39,433 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:39,434 INFO L225 Difference]: With dead ends: 77 [2025-04-30 10:41:39,434 INFO L226 Difference]: Without dead ends: 77 [2025-04-30 10:41:39,435 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:41:39,435 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:39,435 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:41:39,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-30 10:41:39,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-04-30 10:41:39,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 71 states have internal predecessors, (76), 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-30 10:41:39,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2025-04-30 10:41:39,437 INFO L79 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 45 [2025-04-30 10:41:39,437 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:39,437 INFO L485 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2025-04-30 10:41:39,437 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:41:39,437 INFO L278 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2025-04-30 10:41:39,437 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-30 10:41:39,437 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:39,437 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:39,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:41:39,439 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:39,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:39,439 INFO L85 PathProgramCache]: Analyzing trace with hash 936712483, now seen corresponding path program 1 times [2025-04-30 10:41:39,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:39,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127062641] [2025-04-30 10:41:39,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:39,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:39,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:41:39,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:41:39,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:39,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:41:39,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:39,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127062641] [2025-04-30 10:41:39,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127062641] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:41:39,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822623425] [2025-04-30 10:41:39,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:39,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:39,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:41:39,641 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-30 10:41:39,643 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-30 10:41:39,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:41:39,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:41:39,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:39,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:39,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:41:39,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:41:39,787 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 7 treesize of output 3 [2025-04-30 10:41:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-04-30 10:41:39,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:41:39,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822623425] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:39,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:41:39,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2025-04-30 10:41:39,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000909438] [2025-04-30 10:41:39,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:39,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:41:39,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:39,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:41:39,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:41:39,830 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:41:39,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:39,863 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2025-04-30 10:41:39,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:41:39,863 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-04-30 10:41:39,863 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:39,864 INFO L225 Difference]: With dead ends: 76 [2025-04-30 10:41:39,864 INFO L226 Difference]: Without dead ends: 76 [2025-04-30 10:41:39,864 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:41:39,864 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:39,864 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:41:39,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-04-30 10:41:39,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-04-30 10:41:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 70 states have internal predecessors, (75), 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-30 10:41:39,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2025-04-30 10:41:39,866 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 45 [2025-04-30 10:41:39,866 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:39,866 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2025-04-30 10:41:39,866 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:41:39,866 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2025-04-30 10:41:39,868 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-30 10:41:39,868 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:39,868 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:39,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-30 10:41:40,069 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:40,069 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:40,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:40,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1026684114, now seen corresponding path program 1 times [2025-04-30 10:41:40,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:40,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140803602] [2025-04-30 10:41:40,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:40,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:40,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:41:40,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:41:40,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:40,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:40,185 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-30 10:41:40,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:40,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140803602] [2025-04-30 10:41:40,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140803602] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:40,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:40,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:41:40,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895646625] [2025-04-30 10:41:40,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:40,186 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:41:40,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:40,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:41:40,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:41:40,188 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:41:40,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:40,251 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2025-04-30 10:41:40,251 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:41:40,251 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2025-04-30 10:41:40,252 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:40,252 INFO L225 Difference]: With dead ends: 75 [2025-04-30 10:41:40,252 INFO L226 Difference]: Without dead ends: 75 [2025-04-30 10:41:40,252 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:41:40,252 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:40,252 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 210 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:41:40,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-30 10:41:40,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-04-30 10:41:40,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 69 states have internal predecessors, (74), 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-30 10:41:40,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2025-04-30 10:41:40,254 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 46 [2025-04-30 10:41:40,254 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:40,254 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2025-04-30 10:41:40,256 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:41:40,256 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2025-04-30 10:41:40,257 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-30 10:41:40,257 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:40,257 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:40,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:41:40,257 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:40,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:40,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1199044175, now seen corresponding path program 1 times [2025-04-30 10:41:40,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:40,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554564244] [2025-04-30 10:41:40,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:40,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:40,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-30 10:41:40,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:41:40,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:40,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-04-30 10:41:40,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:40,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554564244] [2025-04-30 10:41:40,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554564244] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:40,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:40,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:41:40,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497365380] [2025-04-30 10:41:40,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:40,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:41:40,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:40,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:41:40,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:41:40,376 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 6 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-30 10:41:40,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:40,416 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2025-04-30 10:41:40,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:41:40,416 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 6 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) Word has length 48 [2025-04-30 10:41:40,416 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:40,417 INFO L225 Difference]: With dead ends: 75 [2025-04-30 10:41:40,417 INFO L226 Difference]: Without dead ends: 75 [2025-04-30 10:41:40,417 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:41:40,417 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 61 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:40,418 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 114 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:41:40,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-30 10:41:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-04-30 10:41:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.263157894736842) internal successors, (72), 67 states have internal predecessors, (72), 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-30 10:41:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2025-04-30 10:41:40,420 INFO L79 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 48 [2025-04-30 10:41:40,420 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:40,420 INFO L485 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2025-04-30 10:41:40,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 6 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-30 10:41:40,420 INFO L278 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2025-04-30 10:41:40,420 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-30 10:41:40,420 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:40,420 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:40,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:41:40,421 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:40,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:40,421 INFO L85 PathProgramCache]: Analyzing trace with hash -517990230, now seen corresponding path program 1 times [2025-04-30 10:41:40,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:40,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349369697] [2025-04-30 10:41:40,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:40,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:40,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:41:40,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:41:40,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:40,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-04-30 10:41:40,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:40,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349369697] [2025-04-30 10:41:40,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349369697] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:41:40,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308824203] [2025-04-30 10:41:40,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:40,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:40,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:41:40,557 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:41:40,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:41:40,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:41:40,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:41:40,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:40,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:40,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-30 10:41:40,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:41:40,728 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-30 10:41:40,739 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-04-30 10:41:40,753 INFO L325 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-04-30 10:41:40,753 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2025-04-30 10:41:40,782 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 17 treesize of output 9 [2025-04-30 10:41:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:41:40,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:41:40,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308824203] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:40,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:41:40,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 12 [2025-04-30 10:41:40,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953678973] [2025-04-30 10:41:40,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:40,787 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:41:40,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:40,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:41:40,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=112, Unknown=1, NotChecked=20, Total=156 [2025-04-30 10:41:40,788 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 2 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-30 10:41:40,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:40,895 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2025-04-30 10:41:40,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:41:40,896 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 2 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 51 [2025-04-30 10:41:40,896 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:40,896 INFO L225 Difference]: With dead ends: 92 [2025-04-30 10:41:40,896 INFO L226 Difference]: Without dead ends: 92 [2025-04-30 10:41:40,896 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=154, Unknown=1, NotChecked=24, Total=210 [2025-04-30 10:41:40,897 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 26 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:40,897 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 240 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 224 Invalid, 0 Unknown, 144 Unchecked, 0.1s Time] [2025-04-30 10:41:40,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-30 10:41:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2025-04-30 10:41:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.253968253968254) internal successors, (79), 72 states have internal predecessors, (79), 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-30 10:41:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2025-04-30 10:41:40,899 INFO L79 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 51 [2025-04-30 10:41:40,899 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:40,899 INFO L485 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2025-04-30 10:41:40,899 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 2 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-30 10:41:40,900 INFO L278 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2025-04-30 10:41:40,900 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-30 10:41:40,900 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:40,900 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:40,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-30 10:41:41,104 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:41,104 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:41,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:41,104 INFO L85 PathProgramCache]: Analyzing trace with hash -517990229, now seen corresponding path program 1 times [2025-04-30 10:41:41,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:41,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246895055] [2025-04-30 10:41:41,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:41,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:41,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:41:41,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:41:41,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:41,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:41:41,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:41,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246895055] [2025-04-30 10:41:41,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246895055] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:41:41,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342039643] [2025-04-30 10:41:41,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:41,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:41,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:41:41,438 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:41:41,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:41:41,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:41:41,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:41:41,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:41,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:41,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-30 10:41:41,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:41:41,589 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 8 treesize of output 1 [2025-04-30 10:41:41,782 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-30 10:41:41,785 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-30 10:41:41,827 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|))) (and (<= 0 (+ .cse0 4)) (<= .cse0 0)))) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-04-30 10:41:41,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:41:41,868 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:41:41,875 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-30 10:41:41,875 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-30 10:41:42,023 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:41:42,023 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 40 treesize of output 32 [2025-04-30 10:41:42,028 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 17 treesize of output 9 [2025-04-30 10:41:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2025-04-30 10:41:42,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:41:42,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342039643] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:41:42,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:41:42,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2025-04-30 10:41:42,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218187979] [2025-04-30 10:41:42,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:41:42,292 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-30 10:41:42,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:42,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-30 10:41:42,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=918, Unknown=1, NotChecked=60, Total=1056 [2025-04-30 10:41:42,293 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:41:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:43,070 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2025-04-30 10:41:43,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:41:43,071 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 51 [2025-04-30 10:41:43,071 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:43,071 INFO L225 Difference]: With dead ends: 94 [2025-04-30 10:41:43,072 INFO L226 Difference]: Without dead ends: 94 [2025-04-30 10:41:43,072 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=202, Invalid=2251, Unknown=1, NotChecked=96, Total=2550 [2025-04-30 10:41:43,072 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 99 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:43,073 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 780 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 900 Invalid, 0 Unknown, 92 Unchecked, 0.4s Time] [2025-04-30 10:41:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-04-30 10:41:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2025-04-30 10:41:43,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 74 states have internal predecessors, (80), 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-30 10:41:43,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2025-04-30 10:41:43,075 INFO L79 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 51 [2025-04-30 10:41:43,076 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:43,076 INFO L485 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2025-04-30 10:41:43,076 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:41:43,076 INFO L278 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2025-04-30 10:41:43,076 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-30 10:41:43,076 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:43,076 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:43,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-30 10:41:43,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:43,277 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:41:43,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:43,277 INFO L85 PathProgramCache]: Analyzing trace with hash -251322038, now seen corresponding path program 1 times [2025-04-30 10:41:43,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:43,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504323609] [2025-04-30 10:41:43,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:43,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:43,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:41:43,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:41:43,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:43,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:41:43,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:43,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504323609] [2025-04-30 10:41:43,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504323609] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:41:43,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160365617] [2025-04-30 10:41:43,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:43,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:43,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:41:43,455 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:41:43,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:41:43,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:41:43,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:41:43,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:43,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:43,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:41:43,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:41:43,797 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:41:43,799 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:41:43,799 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 16 treesize of output 11 [2025-04-30 10:41:43,840 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:41:43,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:41:43,881 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:41:43,881 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 17 treesize of output 17 [2025-04-30 10:41:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:41:44,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160365617] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:41:44,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:41:44,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 27 [2025-04-30 10:41:44,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53756090] [2025-04-30 10:41:44,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:41:44,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-30 10:41:44,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:44,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-30 10:41:44,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2025-04-30 10:41:44,004 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 27 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 24 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-04-30 10:41:48,028 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-30 10:41:52,042 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-30 10:41:56,067 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-30 10:42:00,118 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-30 10:42:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:00,342 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2025-04-30 10:42:00,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:42:00,343 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 24 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 51 [2025-04-30 10:42:00,343 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:00,343 INFO L225 Difference]: With dead ends: 75 [2025-04-30 10:42:00,343 INFO L226 Difference]: Without dead ends: 75 [2025-04-30 10:42:00,344 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=1173, Unknown=0, NotChecked=0, Total=1332 [2025-04-30 10:42:00,344 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 89 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:00,344 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 829 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 422 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2025-04-30 10:42:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-30 10:42:00,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-04-30 10:42:00,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 69 states have internal predecessors, (74), 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-30 10:42:00,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2025-04-30 10:42:00,346 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 51 [2025-04-30 10:42:00,346 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:00,346 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2025-04-30 10:42:00,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 24 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-04-30 10:42:00,346 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2025-04-30 10:42:00,346 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-30 10:42:00,346 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:00,346 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:00,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-30 10:42:00,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-30 10:42:00,547 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:42:00,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:00,548 INFO L85 PathProgramCache]: Analyzing trace with hash 384028218, now seen corresponding path program 1 times [2025-04-30 10:42:00,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:00,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816512923] [2025-04-30 10:42:00,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:00,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:42:00,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:42:00,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:00,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:42:00,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:00,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816512923] [2025-04-30 10:42:00,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816512923] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:00,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904795901] [2025-04-30 10:42:00,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:00,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:00,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:00,646 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:42:00,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:42:00,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:42:00,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:42:00,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:00,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:00,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-30 10:42:00,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:00,845 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-30 10:42:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:42:00,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:00,884 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:42:00,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904795901] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:00,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:00,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 12 [2025-04-30 10:42:00,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689038123] [2025-04-30 10:42:00,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:00,884 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:42:00,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:00,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:42:00,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:42:00,885 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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-30 10:42:04,898 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-30 10:42:08,906 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-30 10:42:12,918 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-30 10:42:16,943 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-30 10:42:17,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:17,021 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2025-04-30 10:42:17,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:42:17,024 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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 54 [2025-04-30 10:42:17,024 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:17,024 INFO L225 Difference]: With dead ends: 75 [2025-04-30 10:42:17,024 INFO L226 Difference]: Without dead ends: 75 [2025-04-30 10:42:17,024 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:42:17,025 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 42 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:17,025 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 466 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-04-30 10:42:17,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-30 10:42:17,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-04-30 10:42:17,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 69 states have internal predecessors, (73), 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-30 10:42:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2025-04-30 10:42:17,030 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 54 [2025-04-30 10:42:17,030 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:17,030 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2025-04-30 10:42:17,030 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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-30 10:42:17,030 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2025-04-30 10:42:17,030 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-30 10:42:17,030 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:17,030 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:17,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-30 10:42:17,235 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-30 10:42:17,235 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:42:17,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:17,235 INFO L85 PathProgramCache]: Analyzing trace with hash -351618083, now seen corresponding path program 1 times [2025-04-30 10:42:17,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:17,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224857245] [2025-04-30 10:42:17,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:17,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:17,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-30 10:42:17,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:42:17,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:17,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:42:18,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:18,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224857245] [2025-04-30 10:42:18,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224857245] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:18,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259222833] [2025-04-30 10:42:18,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:18,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:18,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:18,032 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:42:18,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-30 10:42:18,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-30 10:42:18,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:42:18,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:18,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:18,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-04-30 10:42:18,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:18,285 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:42:18,286 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2025-04-30 10:42:18,341 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 19 treesize of output 1 [2025-04-30 10:42:18,452 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 19 treesize of output 5 [2025-04-30 10:42:18,455 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-30 10:42:18,455 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 7 [2025-04-30 10:42:18,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:42:18,602 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 28 treesize of output 23 [2025-04-30 10:42:18,621 INFO L325 Elim1Store]: treesize reduction 116, result has 32.2 percent of original size [2025-04-30 10:42:18,621 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40 treesize of output 69 [2025-04-30 10:42:18,783 INFO L325 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2025-04-30 10:42:18,783 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 51 treesize of output 52 [2025-04-30 10:42:18,882 INFO L325 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-04-30 10:42:18,882 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 84 treesize of output 74 [2025-04-30 10:42:18,899 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 7 treesize of output 3 [2025-04-30 10:42:19,011 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 134 treesize of output 98 [2025-04-30 10:42:19,014 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 97 treesize of output 73 [2025-04-30 10:42:19,204 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 79 treesize of output 43 [2025-04-30 10:42:19,474 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:42:19,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:19,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259222833] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:19,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:42:19,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2025-04-30 10:42:19,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600921082] [2025-04-30 10:42:19,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:19,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-04-30 10:42:19,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:19,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-04-30 10:42:19,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3124, Unknown=6, NotChecked=0, Total=3306 [2025-04-30 10:42:19,921 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 50 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 44 states have internal predecessors, (89), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-04-30 10:42:21,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:21,714 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2025-04-30 10:42:21,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-30 10:42:21,715 INFO L79 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 44 states have internal predecessors, (89), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 56 [2025-04-30 10:42:21,715 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:21,715 INFO L225 Difference]: With dead ends: 85 [2025-04-30 10:42:21,715 INFO L226 Difference]: Without dead ends: 85 [2025-04-30 10:42:21,717 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=479, Invalid=6487, Unknown=6, NotChecked=0, Total=6972 [2025-04-30 10:42:21,717 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 109 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:21,717 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 803 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1638 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-30 10:42:21,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-04-30 10:42:21,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2025-04-30 10:42:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.253968253968254) internal successors, (79), 72 states have internal predecessors, (79), 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-30 10:42:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2025-04-30 10:42:21,719 INFO L79 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 56 [2025-04-30 10:42:21,719 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:21,719 INFO L485 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2025-04-30 10:42:21,720 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 44 states have internal predecessors, (89), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-04-30 10:42:21,720 INFO L278 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2025-04-30 10:42:21,720 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-30 10:42:21,720 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:21,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:21,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-30 10:42:21,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-30 10:42:21,921 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-04-30 10:42:21,921 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:21,921 INFO L85 PathProgramCache]: Analyzing trace with hash -351618082, now seen corresponding path program 1 times [2025-04-30 10:42:21,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:21,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438409155] [2025-04-30 10:42:21,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:21,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:21,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-30 10:42:21,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:42:21,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:21,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:23,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:23,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438409155] [2025-04-30 10:42:23,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438409155] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:23,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551997538] [2025-04-30 10:42:23,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:23,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:23,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:23,800 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:42:23,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-30 10:42:23,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-30 10:42:23,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:42:23,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:23,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:23,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 123 conjuncts are in the unsatisfiable core [2025-04-30 10:42:23,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:23,964 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 8 treesize of output 1 [2025-04-30 10:42:24,260 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:42:24,260 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 19 treesize of output 16 [2025-04-30 10:42:24,272 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-30 10:42:24,361 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-30 10:42:24,365 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-30 10:42:24,582 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 43 treesize of output 19 [2025-04-30 10:42:24,586 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-30 10:42:24,590 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-30 10:42:24,593 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-30 10:42:24,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:42:24,901 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 51 treesize of output 34 [2025-04-30 10:42:24,922 INFO L325 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2025-04-30 10:42:24,923 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 31 treesize of output 49 [2025-04-30 10:42:24,944 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-30 10:42:24,944 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-30 10:42:24,956 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-30 10:42:25,230 INFO L325 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2025-04-30 10:42:25,230 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 55 treesize of output 50 [2025-04-30 10:42:25,247 INFO L325 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2025-04-30 10:42:25,248 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 1 case distinctions, treesize of input 25 treesize of output 24 [2025-04-30 10:42:25,434 INFO L325 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-04-30 10:42:25,434 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 115 treesize of output 99 [2025-04-30 10:42:25,447 INFO L325 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-04-30 10:42:25,447 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 124 treesize of output 126 [2025-04-30 10:42:25,495 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 7 treesize of output 3 [2025-04-30 10:42:25,523 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 7 treesize of output 3 [2025-04-30 10:42:25,699 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 148 treesize of output 92 [2025-04-30 10:42:25,936 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 84 treesize of output 56 [2025-04-30 10:42:25,940 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 7 treesize of output 3 [2025-04-30 10:42:26,310 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:42:26,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:26,636 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_2042 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2042) .cse0) .cse1) 4))) (forall ((v_ArrVal_2042 (Array Int Int)) (v_ArrVal_2041 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2042) .cse0) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2041) .cse0) .cse1)))))) is different from false Killed by 15