./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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 ../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.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 a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:55:59,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:55:59,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:55:59,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:55:59,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:55:59,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:55:59,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:55:59,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:55:59,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:55:59,706 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:55:59,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:55:59,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:55:59,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:55:59,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:55:59,707 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:55:59,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:55:59,707 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:55:59,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:55:59,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:55:59,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:55:59,707 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:55:59,707 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:55:59,707 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:55:59,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:55:59,707 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:55:59,707 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:55:59,707 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:55:59,707 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:55:59,708 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:55:59,708 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:55:59,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:55:59,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:55:59,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:55:59,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:55:59,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:55:59,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:55:59,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:55:59,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:55:59,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:55:59,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:55:59,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:55:59,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:55:59,708 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 -> a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 [2025-03-04 07:55:59,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:55:59,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:55:59,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:55:59,934 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:55:59,934 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:55:59,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2025-03-04 07:56:01,061 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c6f4ff6f/db442ac422c6498788646cbffeb0af22/FLAGfb14a83ce [2025-03-04 07:56:01,372 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:56:01,373 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2025-03-04 07:56:01,385 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c6f4ff6f/db442ac422c6498788646cbffeb0af22/FLAGfb14a83ce [2025-03-04 07:56:01,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c6f4ff6f/db442ac422c6498788646cbffeb0af22 [2025-03-04 07:56:01,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:56:01,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:56:01,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:56:01,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:56:01,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:56:01,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:56:01" (1/1) ... [2025-03-04 07:56:01,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc7c8f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:56:01, skipping insertion in model container [2025-03-04 07:56:01,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:56:01" (1/1) ... [2025-03-04 07:56:01,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:56:01,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:56:01,658 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:56:01,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:56:01,722 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:56:01,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:56:01 WrapperNode [2025-03-04 07:56:01,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:56:01,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:56:01,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:56:01,723 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:56:01,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:56:01" (1/1) ... [2025-03-04 07:56:01,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:56:01" (1/1) ... [2025-03-04 07:56:01,750 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 108 [2025-03-04 07:56:01,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:56:01,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:56:01,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:56:01,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:56:01,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:56:01" (1/1) ... [2025-03-04 07:56:01,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:56:01" (1/1) ... [2025-03-04 07:56:01,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:56:01" (1/1) ... [2025-03-04 07:56:01,780 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 11, 8]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2025-03-04 07:56:01,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:56:01" (1/1) ... [2025-03-04 07:56:01,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:56:01" (1/1) ... [2025-03-04 07:56:01,785 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:56:01" (1/1) ... [2025-03-04 07:56:01,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:56:01" (1/1) ... [2025-03-04 07:56:01,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:56:01" (1/1) ... [2025-03-04 07:56:01,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:56:01" (1/1) ... [2025-03-04 07:56:01,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:56:01,792 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:56:01,792 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:56:01,792 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:56:01,793 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:56:01" (1/1) ... [2025-03-04 07:56:01,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:56:01,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:01,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:56:01,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:56:01,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-04 07:56:01,843 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:56:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:56:01,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:56:01,928 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:56:01,930 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:56:02,133 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L616: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-04 07:56:02,164 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-04 07:56:02,188 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-04 07:56:02,188 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:56:02,199 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:56:02,199 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:56:02,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:56:02 BoogieIcfgContainer [2025-03-04 07:56:02,199 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:56:02,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:56:02,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:56:02,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:56:02,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:56:01" (1/3) ... [2025-03-04 07:56:02,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a956713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:56:02, skipping insertion in model container [2025-03-04 07:56:02,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:56:01" (2/3) ... [2025-03-04 07:56:02,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a956713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:56:02, skipping insertion in model container [2025-03-04 07:56:02,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:56:02" (3/3) ... [2025-03-04 07:56:02,206 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2025-03-04 07:56:02,216 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:56:02,217 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_remove_all_reverse.i that has 2 procedures, 100 locations, 1 initial locations, 2 loop locations, and 44 error locations. [2025-03-04 07:56:02,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:56:02,258 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@13807277, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:56:02,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-03-04 07:56:02,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 96 states have internal predecessors, (103), 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-03-04 07:56:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:56:02,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:02,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:56:02,266 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:02,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:02,271 INFO L85 PathProgramCache]: Analyzing trace with hash -597317354, now seen corresponding path program 1 times [2025-03-04 07:56:02,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:02,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660171879] [2025-03-04 07:56:02,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:02,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:02,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:56:02,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:56:02,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:02,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:56:02,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:02,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660171879] [2025-03-04 07:56:02,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660171879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:02,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:02,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:56:02,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241703662] [2025-03-04 07:56:02,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:02,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:56:02,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:02,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:56:02,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:56:02,472 INFO L87 Difference]: Start difference. First operand has 100 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 96 states have internal predecessors, (103), 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 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03-04 07:56:02,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:02,572 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2025-03-04 07:56:02,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:56:02,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2025-03-04 07:56:02,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:02,578 INFO L225 Difference]: With dead ends: 96 [2025-03-04 07:56:02,578 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 07:56:02,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:56:02,581 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:02,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 144 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:56:02,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 07:56:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-04 07:56:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 89 states have internal predecessors, (93), 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-03-04 07:56:02,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2025-03-04 07:56:02,612 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 6 [2025-03-04 07:56:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:02,613 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2025-03-04 07:56:02,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03-04 07:56:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2025-03-04 07:56:02,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:56:02,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:02,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:56:02,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:56:02,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:02,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:02,614 INFO L85 PathProgramCache]: Analyzing trace with hash -597317353, now seen corresponding path program 1 times [2025-03-04 07:56:02,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:02,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801878175] [2025-03-04 07:56:02,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:02,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:02,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:56:02,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:56:02,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:02,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:56:02,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:02,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801878175] [2025-03-04 07:56:02,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801878175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:02,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:02,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:56:02,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028815250] [2025-03-04 07:56:02,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:02,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:56:02,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:02,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:56:02,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:56:02,744 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03-04 07:56:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:02,803 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2025-03-04 07:56:02,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:56:02,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2025-03-04 07:56:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:02,804 INFO L225 Difference]: With dead ends: 90 [2025-03-04 07:56:02,804 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 07:56:02,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:56:02,805 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 145 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:02,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 145 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:56:02,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 07:56:02,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-04 07:56:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 49 states have (on average 1.836734693877551) internal successors, (90), 86 states have internal predecessors, (90), 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-03-04 07:56:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2025-03-04 07:56:02,809 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 6 [2025-03-04 07:56:02,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:02,809 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2025-03-04 07:56:02,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03-04 07:56:02,809 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2025-03-04 07:56:02,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:56:02,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:02,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:02,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:56:02,810 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:02,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:02,810 INFO L85 PathProgramCache]: Analyzing trace with hash -433449030, now seen corresponding path program 1 times [2025-03-04 07:56:02,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:02,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548041846] [2025-03-04 07:56:02,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:02,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:02,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:56:02,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:56:02,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:02,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:56:02,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:02,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548041846] [2025-03-04 07:56:02,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548041846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:02,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:02,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:56:02,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000204274] [2025-03-04 07:56:02,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:02,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:56:02,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:02,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:56:02,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:56:02,906 INFO L87 Difference]: Start difference. First operand 90 states and 94 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-03-04 07:56:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:02,919 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2025-03-04 07:56:02,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:56:02,919 INFO L78 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-03-04 07:56:02,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:02,920 INFO L225 Difference]: With dead ends: 101 [2025-03-04 07:56:02,920 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 07:56:02,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:56:02,920 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 179 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-03-04 07:56:02,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:56:02,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 07:56:02,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2025-03-04 07:56:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 50 states have (on average 1.82) internal successors, (91), 87 states have internal predecessors, (91), 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-03-04 07:56:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2025-03-04 07:56:02,927 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 14 [2025-03-04 07:56:02,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:02,927 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2025-03-04 07:56:02,927 INFO L472 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-03-04 07:56:02,927 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2025-03-04 07:56:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:56:02,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:02,927 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:02,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:56:02,928 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:02,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1368734428, now seen corresponding path program 1 times [2025-03-04 07:56:02,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:02,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596321044] [2025-03-04 07:56:02,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:02,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:02,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:56:02,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:56:02,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:02,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:56:03,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:03,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596321044] [2025-03-04 07:56:03,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596321044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:03,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:03,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:56:03,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907959438] [2025-03-04 07:56:03,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:03,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:56:03,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:03,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:56:03,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:56:03,063 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-03-04 07:56:03,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:03,207 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2025-03-04 07:56:03,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:56:03,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 24 [2025-03-04 07:56:03,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:03,208 INFO L225 Difference]: With dead ends: 90 [2025-03-04 07:56:03,208 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 07:56:03,208 INFO L434 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-03-04 07:56:03,209 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 7 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:03,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 256 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:56:03,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 07:56:03,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-04 07:56:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 50 states have (on average 1.8) internal successors, (90), 86 states have internal predecessors, (90), 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-03-04 07:56:03,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2025-03-04 07:56:03,212 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 24 [2025-03-04 07:56:03,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:03,213 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2025-03-04 07:56:03,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-03-04 07:56:03,213 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2025-03-04 07:56:03,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:56:03,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:03,213 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:03,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:56:03,214 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:03,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:03,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1368734429, now seen corresponding path program 1 times [2025-03-04 07:56:03,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:03,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929348154] [2025-03-04 07:56:03,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:03,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:03,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:56:03,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:56:03,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:03,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:56:03,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:03,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929348154] [2025-03-04 07:56:03,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929348154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:03,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:03,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:56:03,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086179396] [2025-03-04 07:56:03,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:03,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:56:03,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:03,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:56:03,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:56:03,434 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-03-04 07:56:03,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:03,553 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2025-03-04 07:56:03,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:56:03,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 24 [2025-03-04 07:56:03,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:03,555 INFO L225 Difference]: With dead ends: 89 [2025-03-04 07:56:03,555 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 07:56:03,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:56:03,557 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:03,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 361 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:56:03,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 07:56:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-04 07:56:03,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 50 states have (on average 1.78) internal successors, (89), 85 states have internal predecessors, (89), 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-03-04 07:56:03,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2025-03-04 07:56:03,565 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 24 [2025-03-04 07:56:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:03,565 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2025-03-04 07:56:03,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-03-04 07:56:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2025-03-04 07:56:03,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:56:03,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:03,566 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:03,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:56:03,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:03,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:03,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1093794425, now seen corresponding path program 1 times [2025-03-04 07:56:03,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:03,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380100316] [2025-03-04 07:56:03,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:03,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:03,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:56:03,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:56:03,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:03,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:03,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:56:03,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:03,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380100316] [2025-03-04 07:56:03,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380100316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:03,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600388560] [2025-03-04 07:56:03,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:03,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:03,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:03,794 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:56:03,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:56:03,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:56:03,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:56:03,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:03,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:03,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 07:56:03,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:03,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:56:03,980 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:56:03,981 INFO L378 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-03-04 07:56:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:56:04,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:56:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:56:04,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600388560] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:56:04,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:56:04,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2025-03-04 07:56:04,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286658703] [2025-03-04 07:56:04,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:56:04,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 07:56:04,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:04,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 07:56:04,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:56:04,326 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:56:04,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:04,652 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2025-03-04 07:56:04,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:56:04,652 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2025-03-04 07:56:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:04,653 INFO L225 Difference]: With dead ends: 94 [2025-03-04 07:56:04,653 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 07:56:04,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:56:04,654 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:04,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 507 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:56:04,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 07:56:04,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-04 07:56:04,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 89 states have internal predecessors, (95), 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-03-04 07:56:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2025-03-04 07:56:04,658 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 26 [2025-03-04 07:56:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:04,658 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2025-03-04 07:56:04,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:56:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2025-03-04 07:56:04,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:56:04,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:04,659 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:04,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 07:56:04,859 WARN L453 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-03-04 07:56:04,860 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:04,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:04,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1093794426, now seen corresponding path program 1 times [2025-03-04 07:56:04,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:04,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96715826] [2025-03-04 07:56:04,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:04,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:04,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:56:04,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:56:04,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:04,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:56:05,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:05,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96715826] [2025-03-04 07:56:05,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96715826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:05,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729081152] [2025-03-04 07:56:05,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:05,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:05,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:05,240 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:56:05,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:56:05,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:56:05,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:56:05,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:05,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:05,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 07:56:05,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:05,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:56:05,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:56:05,416 WARN L873 $PredicateComparison]: unable to prove that (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-03-04 07:56:05,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:56:05,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:56:05,453 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:56:05,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:56:05,464 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-03-04 07:56:05,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:56:05,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729081152] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:05,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:56:05,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2025-03-04 07:56:05,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511628271] [2025-03-04 07:56:05,571 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:56:05,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:56:05,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:05,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:56:05,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2025-03-04 07:56:05,572 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:56:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:05,857 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2025-03-04 07:56:05,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:56:05,857 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-03-04 07:56:05,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:05,858 INFO L225 Difference]: With dead ends: 94 [2025-03-04 07:56:05,858 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 07:56:05,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2025-03-04 07:56:05,859 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:05,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 332 Invalid, 0 Unknown, 93 Unchecked, 0.2s Time] [2025-03-04 07:56:05,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 07:56:05,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-04 07:56:05,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 89 states have internal predecessors, (94), 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-03-04 07:56:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2025-03-04 07:56:05,867 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 26 [2025-03-04 07:56:05,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:05,867 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2025-03-04 07:56:05,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:56:05,867 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2025-03-04 07:56:05,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:56:05,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:05,873 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:05,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:56:06,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 07:56:06,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:06,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:06,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1130514328, now seen corresponding path program 1 times [2025-03-04 07:56:06,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:06,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105836282] [2025-03-04 07:56:06,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:06,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:06,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:56:06,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:56:06,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:06,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:56:06,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:06,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105836282] [2025-03-04 07:56:06,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105836282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:06,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065951220] [2025-03-04 07:56:06,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:06,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:06,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:06,152 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:56:06,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:56:06,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:56:06,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:56:06,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:06,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:06,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:56:06,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:56:06,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:56:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:56:06,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065951220] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:56:06,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:56:06,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-04 07:56:06,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526079533] [2025-03-04 07:56:06,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:56:06,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:56:06,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:06,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:56:06,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:56:06,292 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:56:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:06,337 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2025-03-04 07:56:06,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:56:06,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-03-04 07:56:06,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:06,339 INFO L225 Difference]: With dead ends: 94 [2025-03-04 07:56:06,339 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 07:56:06,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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-03-04 07:56:06,340 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:06,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 399 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:56:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 07:56:06,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-04 07:56:06,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 89 states have internal predecessors, (93), 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-03-04 07:56:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2025-03-04 07:56:06,349 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 28 [2025-03-04 07:56:06,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:06,349 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2025-03-04 07:56:06,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:56:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2025-03-04 07:56:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:56:06,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:06,350 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:06,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:56:06,550 WARN L453 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-03-04 07:56:06,550 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:06,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:06,551 INFO L85 PathProgramCache]: Analyzing trace with hash -687110551, now seen corresponding path program 1 times [2025-03-04 07:56:06,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:06,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896837040] [2025-03-04 07:56:06,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:06,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:06,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:56:06,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:56:06,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:06,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:56:06,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:06,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896837040] [2025-03-04 07:56:06,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896837040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:06,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411243460] [2025-03-04 07:56:06,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:06,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:06,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:06,608 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:56:06,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:56:06,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:56:06,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:56:06,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:06,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:06,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:56:06,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:06,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:56:06,743 WARN L873 $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-03-04 07:56:06,773 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:56:06,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 07:56:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-03-04 07:56:06,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:56:06,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411243460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:06,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:56:06,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2025-03-04 07:56:06,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406395030] [2025-03-04 07:56:06,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:56:06,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:56:06,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:06,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:56:06,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-03-04 07:56:06,818 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:56:06,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:06,990 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2025-03-04 07:56:06,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:56:06,990 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2025-03-04 07:56:06,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:06,991 INFO L225 Difference]: With dead ends: 93 [2025-03-04 07:56:06,991 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 07:56:06,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-03-04 07:56:06,992 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 9 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:06,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 384 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 317 Invalid, 0 Unknown, 91 Unchecked, 0.1s Time] [2025-03-04 07:56:06,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 07:56:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-04 07:56:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.7037037037037037) internal successors, (92), 88 states have internal predecessors, (92), 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-03-04 07:56:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2025-03-04 07:56:06,995 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 29 [2025-03-04 07:56:06,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:06,995 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2025-03-04 07:56:06,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:56:06,995 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2025-03-04 07:56:06,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:56:06,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:06,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:07,002 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-03-04 07:56:07,198 WARN L453 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-03-04 07:56:07,199 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:07,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:07,200 INFO L85 PathProgramCache]: Analyzing trace with hash -687110550, now seen corresponding path program 1 times [2025-03-04 07:56:07,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:07,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057611210] [2025-03-04 07:56:07,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:07,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:07,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:56:07,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:56:07,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:07,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:56:07,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:07,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057611210] [2025-03-04 07:56:07,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057611210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:07,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801754301] [2025-03-04 07:56:07,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:07,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:07,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:07,378 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:56:07,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:56:07,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:56:07,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:56:07,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:07,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:07,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 07:56:07,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:56:07,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:56:07,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:56:07,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2025-03-04 07:56:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:56:07,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801754301] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:56:07,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:56:07,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-03-04 07:56:07,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142931398] [2025-03-04 07:56:07,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:56:07,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:56:07,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:07,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:56:07,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:56:07,743 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:56:07,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:07,882 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2025-03-04 07:56:07,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:56:07,883 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2025-03-04 07:56:07,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:07,885 INFO L225 Difference]: With dead ends: 100 [2025-03-04 07:56:07,885 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 07:56:07,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:56:07,885 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:07,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 686 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:56:07,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 07:56:07,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2025-03-04 07:56:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 91 states have internal predecessors, (96), 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-03-04 07:56:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2025-03-04 07:56:07,893 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 29 [2025-03-04 07:56:07,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:07,893 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2025-03-04 07:56:07,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:56:07,893 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2025-03-04 07:56:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:56:07,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:07,894 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:07,900 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-03-04 07:56:08,094 WARN L453 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-03-04 07:56:08,094 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:08,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:08,095 INFO L85 PathProgramCache]: Analyzing trace with hash 174409442, now seen corresponding path program 1 times [2025-03-04 07:56:08,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:08,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6450812] [2025-03-04 07:56:08,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:08,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:08,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:56:08,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:56:08,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:08,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:56:08,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:08,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6450812] [2025-03-04 07:56:08,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6450812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:08,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:08,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:56:08,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758724876] [2025-03-04 07:56:08,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:08,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:56:08,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:08,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:56:08,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:56:08,178 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-03-04 07:56:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:08,317 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2025-03-04 07:56:08,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:56:08,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 30 [2025-03-04 07:56:08,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:08,318 INFO L225 Difference]: With dead ends: 95 [2025-03-04 07:56:08,318 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 07:56:08,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:56:08,318 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 7 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:08,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 285 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:56:08,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 07:56:08,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-04 07:56:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 90 states have internal predecessors, (95), 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-03-04 07:56:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2025-03-04 07:56:08,321 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 30 [2025-03-04 07:56:08,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:08,321 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2025-03-04 07:56:08,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-03-04 07:56:08,321 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2025-03-04 07:56:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:56:08,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:08,321 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:08,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:56:08,322 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:08,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:08,322 INFO L85 PathProgramCache]: Analyzing trace with hash 174409443, now seen corresponding path program 1 times [2025-03-04 07:56:08,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:08,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653051877] [2025-03-04 07:56:08,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:08,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:08,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:56:08,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:56:08,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:08,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:56:08,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:08,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653051877] [2025-03-04 07:56:08,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653051877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:08,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:08,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:56:08,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950010024] [2025-03-04 07:56:08,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:08,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:56:08,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:08,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:56:08,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:56:08,474 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-03-04 07:56:08,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:08,591 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2025-03-04 07:56:08,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:56:08,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 30 [2025-03-04 07:56:08,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:08,591 INFO L225 Difference]: With dead ends: 94 [2025-03-04 07:56:08,591 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 07:56:08,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:56:08,592 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 6 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:08,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 310 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:56:08,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 07:56:08,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-04 07:56:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 89 states have internal predecessors, (94), 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-03-04 07:56:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2025-03-04 07:56:08,594 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 30 [2025-03-04 07:56:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:08,594 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2025-03-04 07:56:08,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-03-04 07:56:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2025-03-04 07:56:08,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 07:56:08,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:08,595 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 07:56:08,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:56:08,595 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:08,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:08,595 INFO L85 PathProgramCache]: Analyzing trace with hash 920041565, now seen corresponding path program 1 times [2025-03-04 07:56:08,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:08,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063131456] [2025-03-04 07:56:08,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:08,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:08,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:56:08,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:56:08,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:08,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:08,798 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:56:08,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:08,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063131456] [2025-03-04 07:56:08,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063131456] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:08,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582332242] [2025-03-04 07:56:08,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:08,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:08,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:08,801 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-03-04 07:56:08,803 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-03-04 07:56:08,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:56:08,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:56:08,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:08,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:08,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:56:08,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:08,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:56:08,927 WARN L873 $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-03-04 07:56:08,968 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:56:08,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 07:56:09,009 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:56:09,010 INFO L378 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-03-04 07:56:09,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2025-03-04 07:56:09,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:56:09,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582332242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:09,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:56:09,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-03-04 07:56:09,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917792550] [2025-03-04 07:56:09,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:56:09,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:56:09,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:09,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:56:09,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=274, Unknown=1, NotChecked=34, Total=380 [2025-03-04 07:56:09,274 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:56:09,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:09,544 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2025-03-04 07:56:09,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:56:09,545 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2025-03-04 07:56:09,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:09,545 INFO L225 Difference]: With dead ends: 120 [2025-03-04 07:56:09,545 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 07:56:09,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=367, Unknown=1, NotChecked=40, Total=506 [2025-03-04 07:56:09,546 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 162 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:09,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 263 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 333 Invalid, 0 Unknown, 111 Unchecked, 0.2s Time] [2025-03-04 07:56:09,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 07:56:09,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2025-03-04 07:56:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 60 states have (on average 1.6166666666666667) internal successors, (97), 89 states have internal predecessors, (97), 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-03-04 07:56:09,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2025-03-04 07:56:09,551 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 34 [2025-03-04 07:56:09,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:09,552 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2025-03-04 07:56:09,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:56:09,552 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2025-03-04 07:56:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 07:56:09,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:09,554 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 07:56:09,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:56:09,755 WARN L453 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-03-04 07:56:09,755 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:09,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:09,758 INFO L85 PathProgramCache]: Analyzing trace with hash 920041566, now seen corresponding path program 1 times [2025-03-04 07:56:09,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:09,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752537808] [2025-03-04 07:56:09,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:09,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:09,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:56:09,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:56:09,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:09,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:56:10,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:10,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752537808] [2025-03-04 07:56:10,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752537808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:10,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369726453] [2025-03-04 07:56:10,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:10,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:10,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:10,048 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-03-04 07:56:10,050 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-03-04 07:56:10,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:56:10,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:56:10,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:10,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:10,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 07:56:10,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:10,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:56:10,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-04 07:56:10,196 WARN L873 $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-03-04 07:56:10,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:56:10,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:56:10,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-04 07:56:10,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:56:10,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:56:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:56:10,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:56:10,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369726453] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:10,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:56:10,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2025-03-04 07:56:10,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545992981] [2025-03-04 07:56:10,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:56:10,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 07:56:10,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:10,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 07:56:10,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=246, Unknown=1, NotChecked=32, Total=342 [2025-03-04 07:56:10,443 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 16 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:56:10,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:10,690 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2025-03-04 07:56:10,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:56:10,691 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2025-03-04 07:56:10,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:10,691 INFO L225 Difference]: With dead ends: 87 [2025-03-04 07:56:10,691 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 07:56:10,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=336, Unknown=1, NotChecked=38, Total=462 [2025-03-04 07:56:10,692 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 86 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:10,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 230 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 302 Invalid, 0 Unknown, 72 Unchecked, 0.2s Time] [2025-03-04 07:56:10,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 07:56:10,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-04 07:56:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 82 states have internal predecessors, (88), 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-03-04 07:56:10,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2025-03-04 07:56:10,694 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 34 [2025-03-04 07:56:10,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:10,695 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2025-03-04 07:56:10,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:56:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2025-03-04 07:56:10,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 07:56:10,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:10,695 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 07:56:10,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:56:10,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:10,896 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:10,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:10,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1543482524, now seen corresponding path program 1 times [2025-03-04 07:56:10,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:10,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319624216] [2025-03-04 07:56:10,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:10,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:10,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:56:10,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:56:10,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:10,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:56:11,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:11,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319624216] [2025-03-04 07:56:11,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319624216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:11,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:11,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:56:11,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641056074] [2025-03-04 07:56:11,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:11,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:56:11,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:11,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:56:11,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:56:11,136 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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-03-04 07:56:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:11,368 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2025-03-04 07:56:11,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:56:11,368 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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 35 [2025-03-04 07:56:11,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:11,369 INFO L225 Difference]: With dead ends: 127 [2025-03-04 07:56:11,369 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 07:56:11,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:56:11,369 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 74 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:11,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 413 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:56:11,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 07:56:11,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2025-03-04 07:56:11,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.5384615384615385) internal successors, (120), 100 states have internal predecessors, (120), 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-03-04 07:56:11,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2025-03-04 07:56:11,372 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 35 [2025-03-04 07:56:11,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:11,372 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2025-03-04 07:56:11,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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-03-04 07:56:11,372 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2025-03-04 07:56:11,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 07:56:11,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:11,372 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 07:56:11,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:56:11,372 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:11,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:11,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1543482525, now seen corresponding path program 1 times [2025-03-04 07:56:11,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:11,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935289871] [2025-03-04 07:56:11,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:11,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:11,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:56:11,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:56:11,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:11,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:56:11,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:11,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935289871] [2025-03-04 07:56:11,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935289871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:11,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:11,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:56:11,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739846557] [2025-03-04 07:56:11,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:11,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:56:11,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:11,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:56:11,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:56:11,525 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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-03-04 07:56:11,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:11,757 INFO L93 Difference]: Finished difference Result 126 states and 148 transitions. [2025-03-04 07:56:11,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:56:11,757 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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 35 [2025-03-04 07:56:11,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:11,758 INFO L225 Difference]: With dead ends: 126 [2025-03-04 07:56:11,758 INFO L226 Difference]: Without dead ends: 126 [2025-03-04 07:56:11,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:56:11,759 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 50 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:11,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 356 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:56:11,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-04 07:56:11,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 106. [2025-03-04 07:56:11,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 101 states have internal predecessors, (121), 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-03-04 07:56:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2025-03-04 07:56:11,763 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 35 [2025-03-04 07:56:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:11,763 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2025-03-04 07:56:11,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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-03-04 07:56:11,763 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2025-03-04 07:56:11,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 07:56:11,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:11,764 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 07:56:11,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:56:11,764 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:11,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:11,764 INFO L85 PathProgramCache]: Analyzing trace with hash -603336804, now seen corresponding path program 1 times [2025-03-04 07:56:11,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:11,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689019434] [2025-03-04 07:56:11,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:11,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:11,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 07:56:11,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 07:56:11,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:11,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:56:11,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:11,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689019434] [2025-03-04 07:56:11,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689019434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:11,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:11,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:56:11,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709133754] [2025-03-04 07:56:11,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:11,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:56:11,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:11,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:56:11,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:56:11,823 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-03-04 07:56:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:11,835 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2025-03-04 07:56:11,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:56:11,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 36 [2025-03-04 07:56:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:11,836 INFO L225 Difference]: With dead ends: 140 [2025-03-04 07:56:11,836 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 07:56:11,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:56:11,837 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 83 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:11,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 166 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:56:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 07:56:11,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 105. [2025-03-04 07:56:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 100 states have internal predecessors, (119), 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-03-04 07:56:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2025-03-04 07:56:11,839 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 36 [2025-03-04 07:56:11,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:11,839 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2025-03-04 07:56:11,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-03-04 07:56:11,839 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2025-03-04 07:56:11,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 07:56:11,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:11,842 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-04 07:56:11,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:56:11,843 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:11,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:11,843 INFO L85 PathProgramCache]: Analyzing trace with hash 991981021, now seen corresponding path program 1 times [2025-03-04 07:56:11,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:11,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821688695] [2025-03-04 07:56:11,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:11,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:11,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:56:11,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:56:11,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:11,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:12,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:56:12,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:12,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821688695] [2025-03-04 07:56:12,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821688695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:12,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:12,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 07:56:12,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891771129] [2025-03-04 07:56:12,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:12,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:56:12,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:12,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:56:12,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:56:12,222 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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-03-04 07:56:12,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:12,570 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2025-03-04 07:56:12,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 07:56:12,571 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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 39 [2025-03-04 07:56:12,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:12,571 INFO L225 Difference]: With dead ends: 122 [2025-03-04 07:56:12,571 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 07:56:12,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:56:12,572 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 57 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:12,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 531 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:56:12,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 07:56:12,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2025-03-04 07:56:12,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 82 states have (on average 1.5) internal successors, (123), 103 states have internal predecessors, (123), 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-03-04 07:56:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2025-03-04 07:56:12,575 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 39 [2025-03-04 07:56:12,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:12,575 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2025-03-04 07:56:12,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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-03-04 07:56:12,575 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2025-03-04 07:56:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 07:56:12,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:12,575 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-04 07:56:12,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:56:12,576 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:12,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:12,576 INFO L85 PathProgramCache]: Analyzing trace with hash 991981022, now seen corresponding path program 1 times [2025-03-04 07:56:12,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:12,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038122040] [2025-03-04 07:56:12,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:12,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:12,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:56:12,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:56:12,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:12,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:56:13,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:13,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038122040] [2025-03-04 07:56:13,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038122040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:13,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179166043] [2025-03-04 07:56:13,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:13,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:13,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:13,194 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-03-04 07:56:13,202 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-03-04 07:56:13,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:56:13,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:56:13,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:13,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:13,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-03-04 07:56:13,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:13,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:56:13,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:56:13,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:56:13,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 07:56:13,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 07:56:13,869 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:56:13,869 INFO L378 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-03-04 07:56:13,883 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:56:13,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:56:13,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-03-04 07:56:14,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-03-04 07:56:14,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-03-04 07:56:14,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:56:14,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-03-04 07:56:14,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-03-04 07:56:14,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:56:14,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 07:56:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:56:14,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:56:14,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 48 [2025-03-04 07:56:14,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2025-03-04 07:56:14,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:56:14,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 17 [2025-03-04 07:56:14,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9 [2025-03-04 07:56:14,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179166043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:14,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:56:14,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 38 [2025-03-04 07:56:14,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172813969] [2025-03-04 07:56:14,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:56:14,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-04 07:56:14,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:14,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-04 07:56:14,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2100, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 07:56:14,877 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 39 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 34 states have internal predecessors, (62), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:56:15,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:15,778 INFO L93 Difference]: Finished difference Result 143 states and 168 transitions. [2025-03-04 07:56:15,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:56:15,778 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 34 states have internal predecessors, (62), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 39 [2025-03-04 07:56:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:15,779 INFO L225 Difference]: With dead ends: 143 [2025-03-04 07:56:15,779 INFO L226 Difference]: Without dead ends: 143 [2025-03-04 07:56:15,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=239, Invalid=2953, Unknown=0, NotChecked=0, Total=3192 [2025-03-04 07:56:15,780 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 146 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:15,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 864 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:56:15,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-04 07:56:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 120. [2025-03-04 07:56:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.446808510638298) internal successors, (136), 115 states have internal predecessors, (136), 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-03-04 07:56:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2025-03-04 07:56:15,782 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 39 [2025-03-04 07:56:15,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:15,782 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2025-03-04 07:56:15,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 34 states have internal predecessors, (62), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:56:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2025-03-04 07:56:15,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:56:15,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:15,783 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:15,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:56:15,987 WARN L453 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-03-04 07:56:15,987 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:15,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:15,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1089460904, now seen corresponding path program 1 times [2025-03-04 07:56:15,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:15,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24422526] [2025-03-04 07:56:15,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:15,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:15,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:56:16,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:56:16,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:16,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:16,046 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:56:16,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:16,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24422526] [2025-03-04 07:56:16,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24422526] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:16,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841439307] [2025-03-04 07:56:16,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:16,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:16,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:16,048 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-03-04 07:56:16,050 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-03-04 07:56:16,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:56:16,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:56:16,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:16,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:16,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:56:16,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:16,199 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:56:16,200 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:56:16,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841439307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:16,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:56:16,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-04 07:56:16,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349528562] [2025-03-04 07:56:16,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:16,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:56:16,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:16,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:56:16,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:56:16,201 INFO L87 Difference]: Start difference. First operand 120 states and 142 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:56:16,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:16,210 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2025-03-04 07:56:16,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:56:16,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2025-03-04 07:56:16,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:16,212 INFO L225 Difference]: With dead ends: 99 [2025-03-04 07:56:16,212 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 07:56:16,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:56:16,213 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 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-03-04 07:56:16,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:56:16,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 07:56:16,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-04 07:56:16,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 95 states have internal predecessors, (111), 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-03-04 07:56:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2025-03-04 07:56:16,215 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 41 [2025-03-04 07:56:16,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:16,215 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2025-03-04 07:56:16,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:56:16,215 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2025-03-04 07:56:16,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:56:16,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:16,217 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1] [2025-03-04 07:56:16,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 07:56:16,420 WARN L453 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-03-04 07:56:16,420 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:16,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:16,420 INFO L85 PathProgramCache]: Analyzing trace with hash 686615776, now seen corresponding path program 1 times [2025-03-04 07:56:16,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:16,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966063954] [2025-03-04 07:56:16,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:16,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:16,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:56:16,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:56:16,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:16,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:56:16,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:16,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966063954] [2025-03-04 07:56:16,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966063954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:16,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:16,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:56:16,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608706504] [2025-03-04 07:56:16,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:16,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:56:16,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:16,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:56:16,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:56:16,547 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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-03-04 07:56:16,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:16,645 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2025-03-04 07:56:16,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:56:16,645 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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 40 [2025-03-04 07:56:16,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:16,646 INFO L225 Difference]: With dead ends: 98 [2025-03-04 07:56:16,646 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 07:56:16,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:56:16,646 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 62 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:16,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 402 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:56:16,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 07:56:16,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 07:56:16,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 94 states have internal predecessors, (110), 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-03-04 07:56:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2025-03-04 07:56:16,648 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 40 [2025-03-04 07:56:16,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:16,649 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2025-03-04 07:56:16,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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-03-04 07:56:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2025-03-04 07:56:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:56:16,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:16,649 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-03-04 07:56:16,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 07:56:16,649 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:16,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:16,649 INFO L85 PathProgramCache]: Analyzing trace with hash -189747429, now seen corresponding path program 1 times [2025-03-04 07:56:16,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:16,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735321675] [2025-03-04 07:56:16,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:16,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:16,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:56:16,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:56:16,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:16,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:56:16,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:16,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735321675] [2025-03-04 07:56:16,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735321675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:16,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:16,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:56:16,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750221427] [2025-03-04 07:56:16,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:16,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:56:16,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:16,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:56:16,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:56:16,782 INFO L87 Difference]: Start difference. First operand 98 states and 114 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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-03-04 07:56:16,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:16,939 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2025-03-04 07:56:16,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:56:16,941 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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 41 [2025-03-04 07:56:16,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:16,941 INFO L225 Difference]: With dead ends: 117 [2025-03-04 07:56:16,941 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 07:56:16,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:56:16,943 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 59 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:16,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 444 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:56:16,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 07:56:16,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 101. [2025-03-04 07:56:16,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.4125) internal successors, (113), 97 states have internal predecessors, (113), 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-03-04 07:56:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2025-03-04 07:56:16,945 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 41 [2025-03-04 07:56:16,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:16,945 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2025-03-04 07:56:16,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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-03-04 07:56:16,945 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2025-03-04 07:56:16,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:56:16,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:16,946 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2025-03-04 07:56:16,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 07:56:16,946 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:16,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:16,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1587203010, now seen corresponding path program 1 times [2025-03-04 07:56:16,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:16,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680336896] [2025-03-04 07:56:16,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:16,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:16,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:56:16,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:56:16,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:16,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:56:17,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:17,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680336896] [2025-03-04 07:56:17,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680336896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:17,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:17,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:56:17,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291019294] [2025-03-04 07:56:17,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:17,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:56:17,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:17,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:56:17,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:56:17,001 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-03-04 07:56:17,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:17,072 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2025-03-04 07:56:17,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:56:17,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-03-04 07:56:17,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:17,073 INFO L225 Difference]: With dead ends: 100 [2025-03-04 07:56:17,073 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 07:56:17,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:56:17,073 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 13 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:17,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 166 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:56:17,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 07:56:17,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-04 07:56:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 80 states have (on average 1.4) internal successors, (112), 96 states have internal predecessors, (112), 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-03-04 07:56:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2025-03-04 07:56:17,075 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 42 [2025-03-04 07:56:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:17,075 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2025-03-04 07:56:17,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-03-04 07:56:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2025-03-04 07:56:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:56:17,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:17,076 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2025-03-04 07:56:17,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 07:56:17,076 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:17,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:17,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1563344392, now seen corresponding path program 1 times [2025-03-04 07:56:17,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:17,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670773580] [2025-03-04 07:56:17,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:17,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:17,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:56:17,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:56:17,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:17,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:56:17,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:17,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670773580] [2025-03-04 07:56:17,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670773580] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:17,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838208041] [2025-03-04 07:56:17,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:17,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:17,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:17,494 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-03-04 07:56:17,494 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-03-04 07:56:17,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:56:17,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:56:17,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:17,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:17,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-04 07:56:17,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:17,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:56:17,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-04 07:56:17,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 07:56:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:56:17,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:56:18,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2025-03-04 07:56:18,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2025-03-04 07:56:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:56:18,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838208041] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:56:18,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:56:18,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 12] total 35 [2025-03-04 07:56:18,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088108978] [2025-03-04 07:56:18,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:56:18,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 07:56:18,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:18,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 07:56:18,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1152, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 07:56:18,147 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand has 36 states, 34 states have (on average 2.235294117647059) internal successors, (76), 32 states have internal predecessors, (76), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:56:18,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:18,566 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2025-03-04 07:56:18,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 07:56:18,567 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 2.235294117647059) internal successors, (76), 32 states have internal predecessors, (76), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2025-03-04 07:56:18,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:18,567 INFO L225 Difference]: With dead ends: 113 [2025-03-04 07:56:18,567 INFO L226 Difference]: Without dead ends: 113 [2025-03-04 07:56:18,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 54 SyntacticMatches, 12 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=1639, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 07:56:18,568 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 105 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:18,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 678 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:56:18,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-04 07:56:18,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2025-03-04 07:56:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 97 states have internal predecessors, (113), 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-03-04 07:56:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2025-03-04 07:56:18,570 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 42 [2025-03-04 07:56:18,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:18,570 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2025-03-04 07:56:18,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 2.235294117647059) internal successors, (76), 32 states have internal predecessors, (76), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:56:18,571 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2025-03-04 07:56:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 07:56:18,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:18,571 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-03-04 07:56:18,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 07:56:18,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 07:56:18,772 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:18,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:18,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1958653064, now seen corresponding path program 1 times [2025-03-04 07:56:18,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:18,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589007119] [2025-03-04 07:56:18,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:18,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:18,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:56:18,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:56:18,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:18,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:56:18,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:18,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589007119] [2025-03-04 07:56:18,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589007119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:18,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278496138] [2025-03-04 07:56:18,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:18,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:18,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:18,958 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-03-04 07:56:18,960 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-03-04 07:56:19,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:56:19,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:56:19,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:19,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:19,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:56:19,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:19,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:56:19,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:56:19,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:56:19,198 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:56:19,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278496138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:19,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:56:19,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2025-03-04 07:56:19,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671759165] [2025-03-04 07:56:19,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:19,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:56:19,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:19,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:56:19,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:56:19,199 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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-03-04 07:56:19,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:19,274 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2025-03-04 07:56:19,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:56:19,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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 43 [2025-03-04 07:56:19,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:19,275 INFO L225 Difference]: With dead ends: 100 [2025-03-04 07:56:19,275 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 07:56:19,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:56:19,275 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 80 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:19,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 133 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:56:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 07:56:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-04 07:56:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.382716049382716) internal successors, (112), 96 states have internal predecessors, (112), 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-03-04 07:56:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2025-03-04 07:56:19,277 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 43 [2025-03-04 07:56:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:19,277 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2025-03-04 07:56:19,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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-03-04 07:56:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2025-03-04 07:56:19,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 07:56:19,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:19,278 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:19,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:56:19,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 07:56:19,482 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:19,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash 864593429, now seen corresponding path program 1 times [2025-03-04 07:56:19,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:19,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760012206] [2025-03-04 07:56:19,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:19,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:19,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:56:19,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:56:19,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:19,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:56:19,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:19,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760012206] [2025-03-04 07:56:19,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760012206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:19,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:19,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:56:19,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991356000] [2025-03-04 07:56:19,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:19,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:56:19,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:19,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:56:19,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:56:19,577 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 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-03-04 07:56:19,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:19,665 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2025-03-04 07:56:19,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:56:19,665 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 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 44 [2025-03-04 07:56:19,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:19,666 INFO L225 Difference]: With dead ends: 99 [2025-03-04 07:56:19,666 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 07:56:19,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:56:19,667 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 128 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:19,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 125 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:56:19,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 07:56:19,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-04 07:56:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 95 states have internal predecessors, (110), 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-03-04 07:56:19,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2025-03-04 07:56:19,670 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 44 [2025-03-04 07:56:19,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:19,670 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2025-03-04 07:56:19,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 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-03-04 07:56:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2025-03-04 07:56:19,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:56:19,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:19,673 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:19,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 07:56:19,674 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:19,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:19,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1032592534, now seen corresponding path program 1 times [2025-03-04 07:56:19,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:19,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372834208] [2025-03-04 07:56:19,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:19,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:19,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:56:19,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:56:19,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:19,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:56:20,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:20,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372834208] [2025-03-04 07:56:20,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372834208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:20,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:20,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 07:56:20,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413428948] [2025-03-04 07:56:20,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:20,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:56:20,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:20,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:56:20,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:56:20,025 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 17 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 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-03-04 07:56:20,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:20,300 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2025-03-04 07:56:20,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:56:20,300 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 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 45 [2025-03-04 07:56:20,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:20,301 INFO L225 Difference]: With dead ends: 109 [2025-03-04 07:56:20,301 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 07:56:20,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:56:20,302 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 43 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:20,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 347 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:56:20,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 07:56:20,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2025-03-04 07:56:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 98 states have internal predecessors, (114), 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-03-04 07:56:20,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2025-03-04 07:56:20,304 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 45 [2025-03-04 07:56:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:20,304 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2025-03-04 07:56:20,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 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-03-04 07:56:20,304 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2025-03-04 07:56:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:56:20,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:20,304 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:20,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 07:56:20,305 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:20,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:20,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1032592535, now seen corresponding path program 1 times [2025-03-04 07:56:20,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:20,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990975129] [2025-03-04 07:56:20,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:20,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:20,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:56:20,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:56:20,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:20,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:20,570 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:56:20,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:20,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990975129] [2025-03-04 07:56:20,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990975129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:20,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:20,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 07:56:20,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772013746] [2025-03-04 07:56:20,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:20,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:56:20,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:20,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:56:20,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:56:20,572 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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-03-04 07:56:20,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:20,803 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2025-03-04 07:56:20,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:56:20,803 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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 45 [2025-03-04 07:56:20,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:20,804 INFO L225 Difference]: With dead ends: 114 [2025-03-04 07:56:20,804 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 07:56:20,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:56:20,804 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 48 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:20,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 418 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:56:20,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 07:56:20,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2025-03-04 07:56:20,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 98 states have internal predecessors, (112), 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-03-04 07:56:20,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2025-03-04 07:56:20,806 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 45 [2025-03-04 07:56:20,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:20,806 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2025-03-04 07:56:20,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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-03-04 07:56:20,806 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2025-03-04 07:56:20,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 07:56:20,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:20,807 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:20,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 07:56:20,807 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:20,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:20,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1192244474, now seen corresponding path program 1 times [2025-03-04 07:56:20,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:20,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945146294] [2025-03-04 07:56:20,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:20,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:20,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 07:56:20,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 07:56:20,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:20,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:56:20,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:20,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945146294] [2025-03-04 07:56:20,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945146294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:20,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044566672] [2025-03-04 07:56:20,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:20,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:20,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:20,871 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-03-04 07:56:20,875 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-03-04 07:56:21,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 07:56:21,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 07:56:21,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:21,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:21,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:56:21,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:56:21,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:56:21,078 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:56:21,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-03-04 07:56:21,095 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:56:21,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044566672] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:56:21,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:56:21,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-03-04 07:56:21,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512143665] [2025-03-04 07:56:21,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:56:21,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:56:21,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:21,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:56:21,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:56:21,096 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-03-04 07:56:21,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:21,147 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2025-03-04 07:56:21,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:56:21,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 46 [2025-03-04 07:56:21,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:21,148 INFO L225 Difference]: With dead ends: 100 [2025-03-04 07:56:21,148 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 07:56:21,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:56:21,148 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 76 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:21,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 113 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:56:21,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 07:56:21,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-04 07:56:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 96 states have internal predecessors, (109), 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-03-04 07:56:21,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2025-03-04 07:56:21,150 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 46 [2025-03-04 07:56:21,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:21,154 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2025-03-04 07:56:21,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-03-04 07:56:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2025-03-04 07:56:21,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 07:56:21,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:21,154 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1] [2025-03-04 07:56:21,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 07:56:21,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 07:56:21,355 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:21,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:21,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1695126937, now seen corresponding path program 1 times [2025-03-04 07:56:21,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:21,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877634170] [2025-03-04 07:56:21,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:21,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:21,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 07:56:21,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:56:21,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:21,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:56:21,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:21,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877634170] [2025-03-04 07:56:21,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877634170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:21,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732630261] [2025-03-04 07:56:21,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:21,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:21,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:21,841 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-03-04 07:56:21,843 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-03-04 07:56:21,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 07:56:22,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:56:22,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:22,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:22,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-04 07:56:22,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:22,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:56:22,056 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:56:22,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:56:22,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:56:22,135 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2025-03-04 07:56:22,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 24 [2025-03-04 07:56:22,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-04 07:56:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:56:22,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:56:22,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-04 07:56:22,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:56:22,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-03-04 07:56:22,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-04 07:56:22,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:56:22,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732630261] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:56:22,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:56:22,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 40 [2025-03-04 07:56:22,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459874921] [2025-03-04 07:56:22,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:56:22,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 07:56:22,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:22,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 07:56:22,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1438, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 07:56:22,645 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 40 states, 40 states have (on average 1.9) internal successors, (76), 35 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:56:23,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:23,270 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2025-03-04 07:56:23,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 07:56:23,270 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.9) internal successors, (76), 35 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2025-03-04 07:56:23,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:23,271 INFO L225 Difference]: With dead ends: 102 [2025-03-04 07:56:23,271 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 07:56:23,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=220, Invalid=2330, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 07:56:23,272 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 46 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:23,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 889 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:56:23,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 07:56:23,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-04 07:56:23,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 96 states have internal predecessors, (108), 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-03-04 07:56:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2025-03-04 07:56:23,274 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 47 [2025-03-04 07:56:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:23,274 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2025-03-04 07:56:23,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.9) internal successors, (76), 35 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:56:23,275 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2025-03-04 07:56:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 07:56:23,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:23,275 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:23,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 07:56:23,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:23,475 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:23,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:23,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1408416273, now seen corresponding path program 1 times [2025-03-04 07:56:23,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:23,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352112410] [2025-03-04 07:56:23,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:23,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:23,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 07:56:23,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:56:23,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:23,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:56:24,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:24,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352112410] [2025-03-04 07:56:24,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352112410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:24,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828009183] [2025-03-04 07:56:24,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:24,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:24,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:24,198 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:56:24,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:56:24,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 07:56:24,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:56:24,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:24,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:24,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-03-04 07:56:24,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:24,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:56:24,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 07:56:24,801 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-03-04 07:56:24,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2025-03-04 07:56:25,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:56:25,159 INFO L349 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2025-03-04 07:56:25,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 52 [2025-03-04 07:56:25,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 07:56:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:56:25,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:56:25,275 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:56:25,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-03-04 07:56:25,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2025-03-04 07:56:25,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2025-03-04 07:56:25,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 220 [2025-03-04 07:56:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:56:25,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828009183] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:56:25,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:56:25,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 24] total 60 [2025-03-04 07:56:25,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547032097] [2025-03-04 07:56:25,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:56:25,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-04 07:56:25,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:25,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-04 07:56:25,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=3412, Unknown=0, NotChecked=0, Total=3660 [2025-03-04 07:56:25,860 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand has 61 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 55 states have internal predecessors, (94), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 07:56:26,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:26,686 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2025-03-04 07:56:26,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 07:56:26,687 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 55 states have internal predecessors, (94), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 48 [2025-03-04 07:56:26,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:26,687 INFO L225 Difference]: With dead ends: 103 [2025-03-04 07:56:26,687 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 07:56:26,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1197 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=446, Invalid=4956, Unknown=0, NotChecked=0, Total=5402 [2025-03-04 07:56:26,689 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 109 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:26,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1192 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:56:26,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 07:56:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-04 07:56:26,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 99 states have internal predecessors, (112), 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-03-04 07:56:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2025-03-04 07:56:26,691 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 48 [2025-03-04 07:56:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:26,691 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2025-03-04 07:56:26,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 55 states have internal predecessors, (94), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 07:56:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2025-03-04 07:56:26,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 07:56:26,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:26,691 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:26,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 07:56:26,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:26,892 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:26,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:26,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1408416274, now seen corresponding path program 1 times [2025-03-04 07:56:26,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:26,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251554900] [2025-03-04 07:56:26,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:26,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:26,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 07:56:26,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:56:26,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:26,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:56:28,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:28,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251554900] [2025-03-04 07:56:28,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251554900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:28,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796064772] [2025-03-04 07:56:28,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:28,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:28,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:28,190 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:56:28,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 07:56:28,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 07:56:28,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:56:28,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:28,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:28,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 137 conjuncts are in the unsatisfiable core [2025-03-04 07:56:28,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:28,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:56:28,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:56:28,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:56:28,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 07:56:28,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 07:56:28,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:56:28,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:56:28,927 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:56:28,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-04 07:56:28,943 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:56:28,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:56:28,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-03-04 07:56:29,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:56:29,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-03-04 07:56:29,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-04 07:56:29,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-03-04 07:56:29,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:56:29,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-04 07:56:29,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2025-03-04 07:56:29,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2025-03-04 07:56:29,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2025-03-04 07:56:29,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 72 [2025-03-04 07:56:30,039 INFO L349 Elim1Store]: treesize reduction 40, result has 69.9 percent of original size [2025-03-04 07:56:30,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 149 treesize of output 181 [2025-03-04 07:56:30,094 INFO L349 Elim1Store]: treesize reduction 16, result has 76.8 percent of original size [2025-03-04 07:56:30,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 89 treesize of output 119 [2025-03-04 07:56:31,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:56:31,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:56:32,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 73 [2025-03-04 07:56:32,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 57 [2025-03-04 07:56:33,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 202 [2025-03-04 07:56:33,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796064772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:33,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:56:33,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 55 [2025-03-04 07:56:33,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68008922] [2025-03-04 07:56:33,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:56:33,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-04 07:56:33,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:33,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-04 07:56:33,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=5274, Unknown=6, NotChecked=0, Total=5550 [2025-03-04 07:56:33,282 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 56 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 50 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:56:35,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:35,749 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2025-03-04 07:56:35,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 07:56:35,750 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 50 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2025-03-04 07:56:35,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:35,750 INFO L225 Difference]: With dead ends: 103 [2025-03-04 07:56:35,750 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 07:56:35,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=548, Invalid=8758, Unknown=6, NotChecked=0, Total=9312 [2025-03-04 07:56:35,752 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 92 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:35,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 996 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1639 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 07:56:35,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 07:56:35,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-04 07:56:35,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 99 states have internal predecessors, (111), 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-03-04 07:56:35,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2025-03-04 07:56:35,756 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 48 [2025-03-04 07:56:35,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:35,756 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2025-03-04 07:56:35,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 50 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:56:35,756 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2025-03-04 07:56:35,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 07:56:35,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:35,756 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:35,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 07:56:35,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:35,957 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:35,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:35,957 INFO L85 PathProgramCache]: Analyzing trace with hash -707149312, now seen corresponding path program 1 times [2025-03-04 07:56:35,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:35,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182909002] [2025-03-04 07:56:35,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:35,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:35,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:56:35,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:56:35,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:35,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:36,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:56:36,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:36,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182909002] [2025-03-04 07:56:36,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182909002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:36,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353012442] [2025-03-04 07:56:36,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:36,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:36,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:36,074 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:56:36,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 07:56:36,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:56:36,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:56:36,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:36,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:36,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 07:56:36,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:36,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 07:56:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:56:36,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:56:36,470 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2025-03-04 07:56:36,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-04 07:56:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:56:36,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353012442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:56:36,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:56:36,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2025-03-04 07:56:36,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15608907] [2025-03-04 07:56:36,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:56:36,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:56:36,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:36,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:56:36,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:56:36,501 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 15 states, 14 states have (on average 6.428571428571429) internal successors, (90), 15 states have internal predecessors, (90), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:56:36,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:36,625 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2025-03-04 07:56:36,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:56:36,625 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.428571428571429) internal successors, (90), 15 states have internal predecessors, (90), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2025-03-04 07:56:36,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:36,626 INFO L225 Difference]: With dead ends: 126 [2025-03-04 07:56:36,626 INFO L226 Difference]: Without dead ends: 126 [2025-03-04 07:56:36,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:56:36,626 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 163 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:36,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 372 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:56:36,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-04 07:56:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2025-03-04 07:56:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 103 states have internal predecessors, (116), 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-03-04 07:56:36,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2025-03-04 07:56:36,628 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 53 [2025-03-04 07:56:36,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:36,628 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2025-03-04 07:56:36,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.428571428571429) internal successors, (90), 15 states have internal predecessors, (90), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:56:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2025-03-04 07:56:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 07:56:36,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:36,630 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:36,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 07:56:36,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 07:56:36,831 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:36,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:36,831 INFO L85 PathProgramCache]: Analyzing trace with hash -446810977, now seen corresponding path program 1 times [2025-03-04 07:56:36,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:36,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142730085] [2025-03-04 07:56:36,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:36,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:36,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 07:56:36,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 07:56:36,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:36,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:56:36,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:36,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142730085] [2025-03-04 07:56:36,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142730085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:36,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:36,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:56:36,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138569130] [2025-03-04 07:56:36,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:36,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:56:36,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:36,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:56:36,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:56:36,910 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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-03-04 07:56:36,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:36,978 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2025-03-04 07:56:36,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:56:36,979 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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 54 [2025-03-04 07:56:36,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:36,979 INFO L225 Difference]: With dead ends: 118 [2025-03-04 07:56:36,979 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 07:56:36,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:56:36,980 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:36,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 399 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:56:36,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 07:56:36,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2025-03-04 07:56:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 105 states have internal predecessors, (118), 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-03-04 07:56:36,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2025-03-04 07:56:36,981 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 54 [2025-03-04 07:56:36,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:36,982 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2025-03-04 07:56:36,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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-03-04 07:56:36,982 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2025-03-04 07:56:36,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 07:56:36,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:36,982 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:36,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 07:56:36,982 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:36,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:36,982 INFO L85 PathProgramCache]: Analyzing trace with hash 111329063, now seen corresponding path program 1 times [2025-03-04 07:56:36,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:36,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369223403] [2025-03-04 07:56:36,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:36,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:36,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 07:56:37,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 07:56:37,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:37,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:56:37,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:37,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369223403] [2025-03-04 07:56:37,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369223403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:37,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975187885] [2025-03-04 07:56:37,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:37,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:37,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:37,051 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:56:37,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 07:56:37,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 07:56:37,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 07:56:37,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:37,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:37,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:56:37,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:56:37,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:56:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:56:37,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975187885] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:56:37,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:56:37,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 07:56:37,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334016886] [2025-03-04 07:56:37,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:56:37,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:56:37,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:37,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:56:37,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:56:37,350 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:56:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:37,365 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2025-03-04 07:56:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:56:37,365 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2025-03-04 07:56:37,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:37,365 INFO L225 Difference]: With dead ends: 112 [2025-03-04 07:56:37,365 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 07:56:37,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:56:37,366 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 35 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:37,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 249 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:56:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 07:56:37,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-04 07:56:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 96 states have (on average 1.2604166666666667) internal successors, (121), 108 states have internal predecessors, (121), 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-03-04 07:56:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2025-03-04 07:56:37,368 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 56 [2025-03-04 07:56:37,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:37,368 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2025-03-04 07:56:37,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:56:37,368 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2025-03-04 07:56:37,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 07:56:37,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:37,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:37,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 07:56:37,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:37,569 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:37,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:37,570 INFO L85 PathProgramCache]: Analyzing trace with hash -281590278, now seen corresponding path program 1 times [2025-03-04 07:56:37,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:37,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617774243] [2025-03-04 07:56:37,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:37,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:37,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 07:56:37,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 07:56:37,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:37,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:56:39,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:39,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617774243] [2025-03-04 07:56:39,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617774243] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:39,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686151645] [2025-03-04 07:56:39,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:39,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:39,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:39,265 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:56:39,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 07:56:39,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 07:56:39,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 07:56:39,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:39,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:39,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 142 conjuncts are in the unsatisfiable core [2025-03-04 07:56:39,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:39,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:56:39,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:56:39,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:56:39,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 07:56:39,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:56:39,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:56:39,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:56:39,917 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-03-04 07:56:39,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2025-03-04 07:56:39,929 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-04 07:56:39,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-03-04 07:56:40,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2025-03-04 07:56:41,071 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:56:41,072 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:56:41,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:56:41,087 INFO L349 Elim1Store]: treesize reduction 84, result has 11.6 percent of original size [2025-03-04 07:56:41,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 156 treesize of output 85 [2025-03-04 07:56:41,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:56:41,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2025-03-04 07:56:41,103 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:56:41,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-04 07:56:41,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:56:41,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 47 [2025-03-04 07:56:41,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2025-03-04 07:56:41,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:56:41,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2025-03-04 07:56:41,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2025-03-04 07:56:41,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 07:56:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:56:41,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:56:42,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2025-03-04 07:56:44,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 357 treesize of output 261 [2025-03-04 07:56:44,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 265 treesize of output 189 [2025-03-04 07:56:44,566 WARN L851 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse5 .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (and (forall ((|ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.offset| Int) (v_ArrVal_3491 (Array Int Int))) (= (select (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3491) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_ArrVal_3491 .cse3 .cse2)))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.offset|)))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (forall ((|ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.base| Int) (v_ArrVal_3491 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse5 .cse3 .cse1)))) (store .cse4 .cse1 (store (select .cse4 .cse1) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3491) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.base|))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3))))))) is different from false [2025-03-04 07:56:44,580 WARN L851 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse5 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse4 .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((|ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.base| Int) (v_ArrVal_3489 Int) (v_ArrVal_3491 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse4 .cse5 .cse1)))) (store .cse0 .cse1 (store (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3489)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3491) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.base|))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5))) (forall ((v_ArrVal_3489 Int) (|ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.offset| Int) (v_ArrVal_3491 (Array Int Int))) (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3489)))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3491) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse6 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_ArrVal_3491 .cse5 .cse7)))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse7 |ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) is different from false [2025-03-04 07:56:44,601 WARN L851 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse4 .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((|ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.base| Int) (v_ArrVal_3489 Int) (v_ArrVal_3491 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse4 .cse5 .cse1)))) (store .cse0 .cse1 (store (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3489)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3491) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse5))) (forall ((v_ArrVal_3489 Int) (|ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.offset| Int) (v_ArrVal_3491 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3489)))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3491) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse6 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3491 .cse5 .cse7)))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse7 |ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse5)))))))) is different from false [2025-03-04 07:56:44,633 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2025-03-04 07:56:44,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 464 treesize of output 467 [2025-03-04 07:56:44,636 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:56:44,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 123 [2025-03-04 07:56:44,640 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:56:44,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:56:44,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 100 [2025-03-04 07:56:44,667 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-03-04 07:56:44,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 298 treesize of output 1 [2025-03-04 07:56:44,913 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-03-04 07:56:44,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686151645] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:56:44,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:56:44,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 32, 30] total 91 [2025-03-04 07:56:44,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461784873] [2025-03-04 07:56:44,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:56:44,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2025-03-04 07:56:44,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:44,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2025-03-04 07:56:44,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=7307, Unknown=3, NotChecked=522, Total=8190 [2025-03-04 07:56:44,916 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand has 91 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 84 states have internal predecessors, (139), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 07:56:48,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:48,414 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2025-03-04 07:56:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 07:56:48,415 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 84 states have internal predecessors, (139), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2025-03-04 07:56:48,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:48,416 INFO L225 Difference]: With dead ends: 99 [2025-03-04 07:56:48,416 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 07:56:48,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 116 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2925 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=707, Invalid=12412, Unknown=3, NotChecked=684, Total=13806 [2025-03-04 07:56:48,423 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 135 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 2701 mSolverCounterSat, 11 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 2984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2701 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 263 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:48,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1476 Invalid, 2984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2701 Invalid, 9 Unknown, 263 Unchecked, 1.5s Time] [2025-03-04 07:56:48,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 07:56:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2025-03-04 07:56:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 93 states have internal predecessors, (97), 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-03-04 07:56:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2025-03-04 07:56:48,431 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 57 [2025-03-04 07:56:48,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:48,431 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2025-03-04 07:56:48,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 84 states have internal predecessors, (139), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 07:56:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2025-03-04 07:56:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 07:56:48,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:48,432 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:48,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 07:56:48,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:48,636 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:48,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:48,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1651889540, now seen corresponding path program 1 times [2025-03-04 07:56:48,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:48,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585151579] [2025-03-04 07:56:48,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:48,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:48,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 07:56:48,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 07:56:48,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:48,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:56:49,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:49,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585151579] [2025-03-04 07:56:49,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585151579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:49,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127021537] [2025-03-04 07:56:49,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:49,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:49,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:49,079 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:56:49,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 07:56:49,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 07:56:49,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 07:56:49,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:49,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:49,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:56:49,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:56:49,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:56:49,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127021537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:49,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:56:49,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-04 07:56:49,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604350361] [2025-03-04 07:56:49,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:49,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:56:49,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:49,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:56:49,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:56:49,434 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-03-04 07:56:49,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:49,458 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2025-03-04 07:56:49,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:56:49,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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 65 [2025-03-04 07:56:49,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:49,459 INFO L225 Difference]: With dead ends: 63 [2025-03-04 07:56:49,459 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 07:56:49,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:56:49,460 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:49,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:56:49,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 07:56:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-04 07:56:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 59 states have internal predecessors, (59), 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-03-04 07:56:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2025-03-04 07:56:49,462 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 65 [2025-03-04 07:56:49,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:49,462 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2025-03-04 07:56:49,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-03-04 07:56:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2025-03-04 07:56:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 07:56:49,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:49,463 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:56:49,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 07:56:49,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:49,664 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:56:49,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:49,666 INFO L85 PathProgramCache]: Analyzing trace with hash -331050628, now seen corresponding path program 1 times [2025-03-04 07:56:49,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:49,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782791150] [2025-03-04 07:56:49,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:49,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:49,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 07:56:49,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 07:56:49,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:49,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:56:52,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:52,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782791150] [2025-03-04 07:56:52,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782791150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:56:52,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461720524] [2025-03-04 07:56:52,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:52,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:56:52,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:56:52,209 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:56:52,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 07:56:52,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 07:56:52,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 07:56:52,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:52,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:52,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-04 07:56:52,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:56:53,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:56:53,552 INFO L349 Elim1Store]: treesize reduction 38, result has 49.3 percent of original size [2025-03-04 07:56:53,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 166 [2025-03-04 07:56:54,000 INFO L349 Elim1Store]: treesize reduction 32, result has 63.6 percent of original size [2025-03-04 07:56:54,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 205 [2025-03-04 07:56:57,156 INFO L349 Elim1Store]: treesize reduction 176, result has 69.2 percent of original size [2025-03-04 07:56:57,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 921 treesize of output 1043 [2025-03-04 07:56:57,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1