./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0232-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0232-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 01db24b1589b54f78ea9acc56548e9023dc94ca9b67a9629bccf00110df292f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:22:37,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:22:37,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:22:37,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:22:37,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:22:37,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:22:37,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:22:37,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:22:37,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:22:37,541 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:22:37,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:22:37,541 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:22:37,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:22:37,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:22:37,542 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:22:37,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:22:37,542 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:22:37,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:22:37,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:22:37,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:22:37,542 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:22:37,542 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:22:37,542 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:22:37,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:22:37,542 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:22:37,542 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:22:37,542 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:22:37,542 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:22:37,545 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:22:37,545 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:22:37,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:22:37,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:22:37,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:22:37,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:22:37,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:22:37,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:22:37,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:22:37,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:22:37,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:22:37,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:22:37,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:22:37,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:22:37,547 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-jdk21/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 -> 01db24b1589b54f78ea9acc56548e9023dc94ca9b67a9629bccf00110df292f7 [2025-02-08 06:22:37,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:22:37,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:22:37,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:22:37,800 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:22:37,800 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:22:37,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0232-3.i [2025-02-08 06:22:38,958 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ffcd2871/79a0662dbe224bfeae54ee4606dd4c59/FLAG5ebfcde1f [2025-02-08 06:22:39,248 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:22:39,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-3.i [2025-02-08 06:22:39,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ffcd2871/79a0662dbe224bfeae54ee4606dd4c59/FLAG5ebfcde1f [2025-02-08 06:22:39,530 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ffcd2871/79a0662dbe224bfeae54ee4606dd4c59 [2025-02-08 06:22:39,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:22:39,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:22:39,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:22:39,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:22:39,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:22:39,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:22:39" (1/1) ... [2025-02-08 06:22:39,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a3954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:39, skipping insertion in model container [2025-02-08 06:22:39,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:22:39" (1/1) ... [2025-02-08 06:22:39,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:22:39,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:22:39,783 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:22:39,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:22:39,845 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:22:39,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:39 WrapperNode [2025-02-08 06:22:39,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:22:39,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:22:39,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:22:39,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:22:39,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:39" (1/1) ... [2025-02-08 06:22:39,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:39" (1/1) ... [2025-02-08 06:22:39,880 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2025-02-08 06:22:39,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:22:39,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:22:39,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:22:39,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:22:39,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:39" (1/1) ... [2025-02-08 06:22:39,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:39" (1/1) ... [2025-02-08 06:22:39,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:39" (1/1) ... [2025-02-08 06:22:39,904 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 9, 13]. 54 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 2, 3]. [2025-02-08 06:22:39,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:39" (1/1) ... [2025-02-08 06:22:39,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:39" (1/1) ... [2025-02-08 06:22:39,909 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:39" (1/1) ... [2025-02-08 06:22:39,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:39" (1/1) ... [2025-02-08 06:22:39,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:39" (1/1) ... [2025-02-08 06:22:39,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:39" (1/1) ... [2025-02-08 06:22:39,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:22:39,919 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:22:39,920 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:22:39,920 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:22:39,921 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:39" (1/1) ... [2025-02-08 06:22:39,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:22:39,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:22:39,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:22:39,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:22:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:22:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:22:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:22:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:22:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:22:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:22:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:22:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:22:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:22:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:22:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 06:22:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 06:22:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 06:22:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:22:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:22:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:22:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:22:39,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:22:40,060 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:22:40,061 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:22:40,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L539: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2025-02-08 06:22:40,319 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-02-08 06:22:40,319 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:22:40,330 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:22:40,330 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:22:40,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:22:40 BoogieIcfgContainer [2025-02-08 06:22:40,331 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:22:40,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:22:40,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:22:40,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:22:40,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:22:39" (1/3) ... [2025-02-08 06:22:40,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c609531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:22:40, skipping insertion in model container [2025-02-08 06:22:40,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:39" (2/3) ... [2025-02-08 06:22:40,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c609531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:22:40, skipping insertion in model container [2025-02-08 06:22:40,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:22:40" (3/3) ... [2025-02-08 06:22:40,341 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0232-3.i [2025-02-08 06:22:40,350 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:22:40,351 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0232-3.i that has 1 procedures, 108 locations, 1 initial locations, 2 loop locations, and 55 error locations. [2025-02-08 06:22:40,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:22:40,387 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;@2d67aa15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:22:40,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2025-02-08 06:22:40,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 52 states have (on average 2.1923076923076925) internal successors, (114), 107 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:22:40,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:40,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:22:40,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:40,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash 142927, now seen corresponding path program 1 times [2025-02-08 06:22:40,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:40,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738879007] [2025-02-08 06:22:40,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:40,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:40,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:22:40,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:22:40,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:40,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:40,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:40,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738879007] [2025-02-08 06:22:40,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738879007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:40,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:40,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:22:40,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608036508] [2025-02-08 06:22:40,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:40,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:22:40,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:40,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:22:40,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:22:40,647 INFO L87 Difference]: Start difference. First operand has 108 states, 52 states have (on average 2.1923076923076925) internal successors, (114), 107 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:40,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:40,802 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2025-02-08 06:22:40,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:22:40,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 06:22:40,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:40,808 INFO L225 Difference]: With dead ends: 101 [2025-02-08 06:22:40,808 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 06:22:40,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-02-08 06:22:40,813 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 96 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:40,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 95 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:40,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 06:22:40,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-08 06:22:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 52 states have (on average 2.0) internal successors, (104), 98 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:40,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2025-02-08 06:22:40,840 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 3 [2025-02-08 06:22:40,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:40,840 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2025-02-08 06:22:40,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:40,841 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2025-02-08 06:22:40,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:22:40,841 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:40,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:22:40,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:22:40,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:40,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:40,843 INFO L85 PathProgramCache]: Analyzing trace with hash 142928, now seen corresponding path program 1 times [2025-02-08 06:22:40,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:40,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093832170] [2025-02-08 06:22:40,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:40,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:40,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:22:40,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:22:40,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:40,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:40,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:40,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093832170] [2025-02-08 06:22:40,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093832170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:40,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:40,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:22:40,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444401558] [2025-02-08 06:22:40,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:40,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:22:40,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:40,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:22:40,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:22:40,994 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:41,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:41,107 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2025-02-08 06:22:41,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:22:41,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 06:22:41,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:41,109 INFO L225 Difference]: With dead ends: 97 [2025-02-08 06:22:41,109 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 06:22:41,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-02-08 06:22:41,109 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:41,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 83 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:41,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 06:22:41,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2025-02-08 06:22:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 94 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2025-02-08 06:22:41,117 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 3 [2025-02-08 06:22:41,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:41,118 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2025-02-08 06:22:41,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2025-02-08 06:22:41,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:22:41,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:41,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:22:41,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:22:41,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:41,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:41,119 INFO L85 PathProgramCache]: Analyzing trace with hash 4430813, now seen corresponding path program 1 times [2025-02-08 06:22:41,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:41,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528047602] [2025-02-08 06:22:41,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:41,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:41,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:22:41,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:22:41,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:41,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:41,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:41,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528047602] [2025-02-08 06:22:41,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528047602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:41,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:41,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:22:41,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950756697] [2025-02-08 06:22:41,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:41,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:22:41,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:41,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:22:41,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:22:41,168 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:41,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:41,229 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2025-02-08 06:22:41,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:22:41,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 06:22:41,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:41,230 INFO L225 Difference]: With dead ends: 91 [2025-02-08 06:22:41,230 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 06:22:41,230 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-02-08 06:22:41,230 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 12 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:41,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 115 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:41,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 06:22:41,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-08 06:22:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 90 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:41,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2025-02-08 06:22:41,237 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 4 [2025-02-08 06:22:41,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:41,237 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2025-02-08 06:22:41,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:41,237 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2025-02-08 06:22:41,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:22:41,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:41,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:22:41,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:22:41,238 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:41,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:41,238 INFO L85 PathProgramCache]: Analyzing trace with hash 4430814, now seen corresponding path program 1 times [2025-02-08 06:22:41,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:41,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061322376] [2025-02-08 06:22:41,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:41,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:41,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:22:41,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:22:41,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:41,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:41,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:41,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061322376] [2025-02-08 06:22:41,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061322376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:41,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:41,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:22:41,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992369199] [2025-02-08 06:22:41,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:41,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:22:41,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:41,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:22:41,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:22:41,274 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:41,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:41,321 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2025-02-08 06:22:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:22:41,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 06:22:41,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:41,322 INFO L225 Difference]: With dead ends: 87 [2025-02-08 06:22:41,322 INFO L226 Difference]: Without dead ends: 87 [2025-02-08 06:22:41,323 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-02-08 06:22:41,323 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 12 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:41,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 124 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:22:41,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-08 06:22:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-08 06:22:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.6545454545454545) internal successors, (91), 86 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:41,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2025-02-08 06:22:41,329 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 4 [2025-02-08 06:22:41,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:41,329 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2025-02-08 06:22:41,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:41,330 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2025-02-08 06:22:41,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:22:41,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:41,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:41,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:22:41,330 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:41,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:41,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1373178197, now seen corresponding path program 1 times [2025-02-08 06:22:41,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:41,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27186361] [2025-02-08 06:22:41,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:41,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:41,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:22:41,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:22:41,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:41,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:41,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:41,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27186361] [2025-02-08 06:22:41,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27186361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:41,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:41,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:22:41,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382622376] [2025-02-08 06:22:41,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:41,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:22:41,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:41,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:22:41,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:22:41,490 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:41,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:41,639 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2025-02-08 06:22:41,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:22:41,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 06:22:41,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:41,640 INFO L225 Difference]: With dead ends: 97 [2025-02-08 06:22:41,640 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 06:22:41,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:22:41,641 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 20 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:41,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 441 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:41,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 06:22:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2025-02-08 06:22:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 61 states have (on average 1.5901639344262295) internal successors, (97), 92 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2025-02-08 06:22:41,647 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 9 [2025-02-08 06:22:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:41,648 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2025-02-08 06:22:41,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2025-02-08 06:22:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:22:41,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:41,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:41,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:22:41,649 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:41,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:41,649 INFO L85 PathProgramCache]: Analyzing trace with hash 381112206, now seen corresponding path program 1 times [2025-02-08 06:22:41,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:41,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273794913] [2025-02-08 06:22:41,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:41,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:41,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:22:41,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:22:41,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:41,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:41,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:41,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:41,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273794913] [2025-02-08 06:22:41,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273794913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:41,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:41,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:22:41,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969107039] [2025-02-08 06:22:41,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:41,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:22:41,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:41,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:22:41,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:22:41,721 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:41,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:41,757 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2025-02-08 06:22:41,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:22:41,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 06:22:41,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:41,758 INFO L225 Difference]: With dead ends: 92 [2025-02-08 06:22:41,758 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 06:22:41,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-02-08 06:22:41,759 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 14 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:41,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 124 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:22:41,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 06:22:41,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2025-02-08 06:22:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 58 states have (on average 1.603448275862069) internal successors, (93), 88 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2025-02-08 06:22:41,763 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 10 [2025-02-08 06:22:41,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:41,763 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2025-02-08 06:22:41,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2025-02-08 06:22:41,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:22:41,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:41,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:41,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:22:41,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:41,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:41,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2122734201, now seen corresponding path program 1 times [2025-02-08 06:22:41,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:41,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526397758] [2025-02-08 06:22:41,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:41,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:41,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:22:41,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:22:41,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:41,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:41,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:41,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526397758] [2025-02-08 06:22:41,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526397758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:41,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:41,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:22:41,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78881628] [2025-02-08 06:22:41,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:41,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:22:41,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:41,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:22:41,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:22:41,906 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:42,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:42,037 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2025-02-08 06:22:42,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:22:42,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-08 06:22:42,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:42,038 INFO L225 Difference]: With dead ends: 118 [2025-02-08 06:22:42,039 INFO L226 Difference]: Without dead ends: 118 [2025-02-08 06:22:42,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:22:42,039 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 63 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:42,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 190 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:42,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-08 06:22:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 88. [2025-02-08 06:22:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 87 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2025-02-08 06:22:42,046 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 16 [2025-02-08 06:22:42,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:42,046 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2025-02-08 06:22:42,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2025-02-08 06:22:42,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:22:42,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:42,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:42,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:22:42,046 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:42,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:42,047 INFO L85 PathProgramCache]: Analyzing trace with hash -2122734200, now seen corresponding path program 1 times [2025-02-08 06:22:42,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:42,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981080209] [2025-02-08 06:22:42,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:42,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:42,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:22:42,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:22:42,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:42,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:42,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:42,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981080209] [2025-02-08 06:22:42,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981080209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:42,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:42,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:22:42,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493779706] [2025-02-08 06:22:42,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:42,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:22:42,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:42,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:22:42,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:22:42,223 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:42,361 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2025-02-08 06:22:42,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:22:42,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-08 06:22:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:42,362 INFO L225 Difference]: With dead ends: 119 [2025-02-08 06:22:42,362 INFO L226 Difference]: Without dead ends: 119 [2025-02-08 06:22:42,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:22:42,363 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 72 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:42,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 206 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:42,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-08 06:22:42,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 87. [2025-02-08 06:22:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 86 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2025-02-08 06:22:42,369 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 16 [2025-02-08 06:22:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:42,369 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2025-02-08 06:22:42,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:42,372 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2025-02-08 06:22:42,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 06:22:42,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:42,372 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:42,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:22:42,373 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:42,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:42,373 INFO L85 PathProgramCache]: Analyzing trace with hash 723924927, now seen corresponding path program 1 times [2025-02-08 06:22:42,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:42,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235342851] [2025-02-08 06:22:42,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:42,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:42,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:22:42,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:22:42,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:42,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:42,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:42,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235342851] [2025-02-08 06:22:42,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235342851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:42,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:42,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:22:42,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074517058] [2025-02-08 06:22:42,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:42,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:22:42,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:42,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:22:42,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:22:42,487 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:42,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:42,595 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2025-02-08 06:22:42,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:22:42,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-08 06:22:42,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:42,596 INFO L225 Difference]: With dead ends: 116 [2025-02-08 06:22:42,596 INFO L226 Difference]: Without dead ends: 116 [2025-02-08 06:22:42,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:22:42,597 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 64 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:42,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 156 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:42,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-08 06:22:42,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 86. [2025-02-08 06:22:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 85 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:42,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2025-02-08 06:22:42,604 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 19 [2025-02-08 06:22:42,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:42,604 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2025-02-08 06:22:42,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:42,604 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2025-02-08 06:22:42,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 06:22:42,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:42,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:42,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:22:42,605 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:42,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:42,605 INFO L85 PathProgramCache]: Analyzing trace with hash 723924928, now seen corresponding path program 1 times [2025-02-08 06:22:42,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:42,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812323737] [2025-02-08 06:22:42,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:42,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:42,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:22:42,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:22:42,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:42,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:42,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:42,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812323737] [2025-02-08 06:22:42,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812323737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:42,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:42,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:22:42,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755925092] [2025-02-08 06:22:42,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:42,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:22:42,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:42,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:22:42,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:22:42,818 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:42,939 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2025-02-08 06:22:42,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:22:42,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-08 06:22:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:42,940 INFO L225 Difference]: With dead ends: 117 [2025-02-08 06:22:42,940 INFO L226 Difference]: Without dead ends: 117 [2025-02-08 06:22:42,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:22:42,941 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 73 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:42,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 204 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-08 06:22:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 85. [2025-02-08 06:22:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 84 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2025-02-08 06:22:42,948 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 19 [2025-02-08 06:22:42,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:42,948 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2025-02-08 06:22:42,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2025-02-08 06:22:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 06:22:42,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:42,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:42,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:22:42,949 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:42,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash 722969630, now seen corresponding path program 1 times [2025-02-08 06:22:42,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:42,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592253610] [2025-02-08 06:22:42,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:42,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:42,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:22:42,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:22:42,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:42,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:43,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:43,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:43,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592253610] [2025-02-08 06:22:43,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592253610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:43,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:43,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:22:43,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351475432] [2025-02-08 06:22:43,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:43,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:22:43,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:43,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:22:43,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:22:43,048 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:43,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:43,117 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2025-02-08 06:22:43,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:22:43,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-08 06:22:43,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:43,118 INFO L225 Difference]: With dead ends: 88 [2025-02-08 06:22:43,118 INFO L226 Difference]: Without dead ends: 88 [2025-02-08 06:22:43,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:22:43,118 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 41 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:43,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 209 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:43,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-08 06:22:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2025-02-08 06:22:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 84 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2025-02-08 06:22:43,120 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 19 [2025-02-08 06:22:43,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:43,120 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2025-02-08 06:22:43,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:43,120 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2025-02-08 06:22:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:22:43,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:43,121 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:43,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:22:43,121 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:43,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:43,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1076425796, now seen corresponding path program 1 times [2025-02-08 06:22:43,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:43,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508775657] [2025-02-08 06:22:43,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:43,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:43,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:22:43,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:22:43,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:43,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:43,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:43,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:43,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508775657] [2025-02-08 06:22:43,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508775657] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:22:43,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191342829] [2025-02-08 06:22:43,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:43,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:22:43,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:22:43,447 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:22:43,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:22:43,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:22:43,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:22:43,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:43,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:43,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-08 06:22:43,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:22:43,664 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-02-08 06:22:43,668 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-02-08 06:22:43,710 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 06:22:43,710 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-02-08 06:22:43,715 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 24 treesize of output 19 [2025-02-08 06:22:43,735 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 31 treesize of output 19 [2025-02-08 06:22:43,741 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 14 [2025-02-08 06:22:43,773 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-02-08 06:22:43,779 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-02-08 06:22:43,819 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 31 treesize of output 19 [2025-02-08 06:22:43,824 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 26 treesize of output 14 [2025-02-08 06:22:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:43,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:22:44,058 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 32 treesize of output 28 [2025-02-08 06:22:44,072 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 66 treesize of output 62 [2025-02-08 06:22:44,076 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 102 treesize of output 94 [2025-02-08 06:22:44,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:22:44,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 134 [2025-02-08 06:22:44,273 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 68 treesize of output 64 [2025-02-08 06:22:44,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:44,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191342829] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:22:44,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:22:44,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-02-08 06:22:44,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973810644] [2025-02-08 06:22:44,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:22:44,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 06:22:44,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:44,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 06:22:44,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2025-02-08 06:22:44,412 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:44,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:44,800 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2025-02-08 06:22:44,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:22:44,800 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-08 06:22:44,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:44,801 INFO L225 Difference]: With dead ends: 87 [2025-02-08 06:22:44,801 INFO L226 Difference]: Without dead ends: 87 [2025-02-08 06:22:44,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2025-02-08 06:22:44,802 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 105 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:44,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 457 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:22:44,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-08 06:22:44,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2025-02-08 06:22:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.5) internal successors, (87), 83 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2025-02-08 06:22:44,803 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 20 [2025-02-08 06:22:44,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:44,804 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2025-02-08 06:22:44,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2025-02-08 06:22:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:22:44,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:44,804 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:44,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:22:45,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 06:22:45,005 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:45,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:45,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1076425795, now seen corresponding path program 1 times [2025-02-08 06:22:45,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:45,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083007675] [2025-02-08 06:22:45,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:45,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:45,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:22:45,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:22:45,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:45,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:45,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:45,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:45,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083007675] [2025-02-08 06:22:45,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083007675] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:22:45,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469832531] [2025-02-08 06:22:45,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:45,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:22:45,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:22:45,180 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:22:45,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:22:45,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:22:45,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:22:45,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:45,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:45,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 06:22:45,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:22:45,283 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-02-08 06:22:45,301 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-02-08 06:22:45,302 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 23 treesize of output 24 [2025-02-08 06:22:45,317 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-02-08 06:22:45,333 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-02-08 06:22:45,356 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-02-08 06:22:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:45,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:22:45,417 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 38 treesize of output 34 [2025-02-08 06:22:45,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:22:45,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 339 [2025-02-08 06:22:45,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:45,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469832531] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:22:45,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:22:45,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-02-08 06:22:45,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436162364] [2025-02-08 06:22:45,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:22:45,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 06:22:45,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:45,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 06:22:45,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:22:45,965 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:46,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:46,269 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2025-02-08 06:22:46,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:22:46,270 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-08 06:22:46,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:46,270 INFO L225 Difference]: With dead ends: 86 [2025-02-08 06:22:46,270 INFO L226 Difference]: Without dead ends: 86 [2025-02-08 06:22:46,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2025-02-08 06:22:46,271 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 77 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:46,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 407 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:22:46,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-08 06:22:46,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2025-02-08 06:22:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 82 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:46,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2025-02-08 06:22:46,273 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 20 [2025-02-08 06:22:46,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:46,273 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2025-02-08 06:22:46,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:46,273 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2025-02-08 06:22:46,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:22:46,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:46,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:46,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:22:46,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:22:46,477 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:46,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:46,477 INFO L85 PathProgramCache]: Analyzing trace with hash 966836290, now seen corresponding path program 1 times [2025-02-08 06:22:46,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:46,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70095627] [2025-02-08 06:22:46,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:46,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:46,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:22:46,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:22:46,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:46,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:46,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:46,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70095627] [2025-02-08 06:22:46,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70095627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:46,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:46,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:22:46,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763734618] [2025-02-08 06:22:46,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:46,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:22:46,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:46,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:22:46,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:22:46,726 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:46,898 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2025-02-08 06:22:46,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:22:46,898 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-08 06:22:46,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:46,899 INFO L225 Difference]: With dead ends: 121 [2025-02-08 06:22:46,899 INFO L226 Difference]: Without dead ends: 121 [2025-02-08 06:22:46,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:22:46,899 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 36 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:46,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 321 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:46,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-08 06:22:46,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2025-02-08 06:22:46,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.408450704225352) internal successors, (100), 95 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2025-02-08 06:22:46,901 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 20 [2025-02-08 06:22:46,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:46,901 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2025-02-08 06:22:46,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2025-02-08 06:22:46,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:22:46,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:46,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:46,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:22:46,903 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:46,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:46,903 INFO L85 PathProgramCache]: Analyzing trace with hash -92846051, now seen corresponding path program 1 times [2025-02-08 06:22:46,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:46,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453499300] [2025-02-08 06:22:46,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:46,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:46,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:22:46,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:22:46,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:46,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:47,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:47,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453499300] [2025-02-08 06:22:47,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453499300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:47,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:47,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:22:47,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553357204] [2025-02-08 06:22:47,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:47,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:22:47,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:47,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:22:47,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:22:47,136 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:47,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:47,323 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2025-02-08 06:22:47,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:22:47,323 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-08 06:22:47,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:47,324 INFO L225 Difference]: With dead ends: 120 [2025-02-08 06:22:47,324 INFO L226 Difference]: Without dead ends: 120 [2025-02-08 06:22:47,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:22:47,324 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 36 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:47,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 271 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-08 06:22:47,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 97. [2025-02-08 06:22:47,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 96 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2025-02-08 06:22:47,326 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 21 [2025-02-08 06:22:47,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:47,326 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2025-02-08 06:22:47,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:47,326 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2025-02-08 06:22:47,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 06:22:47,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:47,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:47,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 06:22:47,329 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:47,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:47,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1416739744, now seen corresponding path program 1 times [2025-02-08 06:22:47,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:47,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906110368] [2025-02-08 06:22:47,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:47,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:47,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 06:22:47,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 06:22:47,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:47,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:47,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:47,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906110368] [2025-02-08 06:22:47,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906110368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:47,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:47,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:22:47,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963123948] [2025-02-08 06:22:47,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:47,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:22:47,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:47,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:22:47,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:22:47,496 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:47,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:47,667 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2025-02-08 06:22:47,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:22:47,671 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-08 06:22:47,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:47,671 INFO L225 Difference]: With dead ends: 111 [2025-02-08 06:22:47,671 INFO L226 Difference]: Without dead ends: 111 [2025-02-08 06:22:47,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:22:47,672 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 24 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:47,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 230 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-08 06:22:47,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2025-02-08 06:22:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 97 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:47,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2025-02-08 06:22:47,675 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 22 [2025-02-08 06:22:47,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:47,675 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2025-02-08 06:22:47,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2025-02-08 06:22:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:22:47,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:47,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:47,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 06:22:47,678 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:47,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:47,678 INFO L85 PathProgramCache]: Analyzing trace with hash 969259130, now seen corresponding path program 1 times [2025-02-08 06:22:47,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:47,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144296052] [2025-02-08 06:22:47,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:47,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:47,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:22:47,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:22:47,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:47,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:47,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:47,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144296052] [2025-02-08 06:22:47,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144296052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:47,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:47,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:22:47,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385522694] [2025-02-08 06:22:47,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:47,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:22:47,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:47,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:22:47,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:22:47,802 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:47,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:47,896 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2025-02-08 06:22:47,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:22:47,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-08 06:22:47,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:47,897 INFO L225 Difference]: With dead ends: 97 [2025-02-08 06:22:47,897 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 06:22:47,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:22:47,897 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 107 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:47,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 79 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 06:22:47,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-08 06:22:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 96 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2025-02-08 06:22:47,899 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 23 [2025-02-08 06:22:47,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:47,899 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2025-02-08 06:22:47,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:47,899 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2025-02-08 06:22:47,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:22:47,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:47,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:47,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:22:47,900 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:47,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:47,900 INFO L85 PathProgramCache]: Analyzing trace with hash 969259131, now seen corresponding path program 1 times [2025-02-08 06:22:47,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:47,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908310579] [2025-02-08 06:22:47,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:47,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:47,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:22:47,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:22:47,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:47,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:47,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:47,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908310579] [2025-02-08 06:22:47,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908310579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:47,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:47,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:22:47,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140981447] [2025-02-08 06:22:47,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:47,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:22:47,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:47,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:22:47,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:22:47,945 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:47,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:47,978 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2025-02-08 06:22:47,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:22:47,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-08 06:22:47,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:47,979 INFO L225 Difference]: With dead ends: 93 [2025-02-08 06:22:47,979 INFO L226 Difference]: Without dead ends: 93 [2025-02-08 06:22:47,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-02-08 06:22:47,979 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 50 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:47,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 62 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:22:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-08 06:22:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-08 06:22:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 92 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2025-02-08 06:22:47,981 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 23 [2025-02-08 06:22:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:47,981 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2025-02-08 06:22:47,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2025-02-08 06:22:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:22:47,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:47,982 INFO L218 NwaCegarLoop]: trace histogram [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-02-08 06:22:47,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 06:22:47,982 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:47,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:47,982 INFO L85 PathProgramCache]: Analyzing trace with hash -17738018, now seen corresponding path program 1 times [2025-02-08 06:22:47,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:47,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526469120] [2025-02-08 06:22:47,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:47,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:47,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:22:47,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:22:47,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:47,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:48,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:48,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:48,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526469120] [2025-02-08 06:22:48,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526469120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:48,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:48,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:22:48,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965032409] [2025-02-08 06:22:48,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:48,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:22:48,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:48,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:22:48,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:22:48,048 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:48,092 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2025-02-08 06:22:48,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:22:48,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-08 06:22:48,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:48,093 INFO L225 Difference]: With dead ends: 92 [2025-02-08 06:22:48,094 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 06:22:48,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:22:48,094 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 26 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:48,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 186 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:22:48,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 06:22:48,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-08 06:22:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 91 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2025-02-08 06:22:48,096 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 24 [2025-02-08 06:22:48,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:48,096 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2025-02-08 06:22:48,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:48,097 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2025-02-08 06:22:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:22:48,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:48,097 INFO L218 NwaCegarLoop]: trace histogram [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-02-08 06:22:48,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 06:22:48,098 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:48,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:48,099 INFO L85 PathProgramCache]: Analyzing trace with hash -549878536, now seen corresponding path program 1 times [2025-02-08 06:22:48,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:48,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056100488] [2025-02-08 06:22:48,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:48,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:48,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:22:48,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:22:48,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:48,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:48,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:48,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056100488] [2025-02-08 06:22:48,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056100488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:48,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:48,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:22:48,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914574965] [2025-02-08 06:22:48,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:48,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:22:48,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:48,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:22:48,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:22:48,177 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:48,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:48,236 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2025-02-08 06:22:48,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:22:48,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-08 06:22:48,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:48,237 INFO L225 Difference]: With dead ends: 91 [2025-02-08 06:22:48,237 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 06:22:48,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:22:48,237 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 26 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:48,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 157 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:22:48,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 06:22:48,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-08 06:22:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 90 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2025-02-08 06:22:48,239 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 25 [2025-02-08 06:22:48,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:48,239 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2025-02-08 06:22:48,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:48,239 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2025-02-08 06:22:48,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 06:22:48,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:48,239 INFO L218 NwaCegarLoop]: trace histogram [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-02-08 06:22:48,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 06:22:48,239 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:48,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:48,240 INFO L85 PathProgramCache]: Analyzing trace with hash 133634588, now seen corresponding path program 1 times [2025-02-08 06:22:48,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:48,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079478368] [2025-02-08 06:22:48,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:48,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:48,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 06:22:48,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 06:22:48,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:48,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:48,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:48,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079478368] [2025-02-08 06:22:48,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079478368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:48,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:48,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 06:22:48,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036216619] [2025-02-08 06:22:48,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:48,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:22:48,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:48,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:22:48,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:22:48,481 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:48,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:48,736 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2025-02-08 06:22:48,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:22:48,737 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-08 06:22:48,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:48,737 INFO L225 Difference]: With dead ends: 111 [2025-02-08 06:22:48,737 INFO L226 Difference]: Without dead ends: 111 [2025-02-08 06:22:48,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:22:48,738 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 69 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:48,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 219 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:48,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-08 06:22:48,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2025-02-08 06:22:48,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 94 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:48,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2025-02-08 06:22:48,742 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 26 [2025-02-08 06:22:48,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:48,742 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2025-02-08 06:22:48,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2025-02-08 06:22:48,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 06:22:48,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:48,743 INFO L218 NwaCegarLoop]: trace histogram [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-02-08 06:22:48,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 06:22:48,743 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:48,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:48,743 INFO L85 PathProgramCache]: Analyzing trace with hash -152295051, now seen corresponding path program 1 times [2025-02-08 06:22:48,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:48,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050190653] [2025-02-08 06:22:48,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:48,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:48,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 06:22:48,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 06:22:48,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:48,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:48,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:48,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050190653] [2025-02-08 06:22:48,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050190653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:48,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:48,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:22:48,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349348443] [2025-02-08 06:22:48,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:48,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:22:48,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:48,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:22:48,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:22:48,850 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:48,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:48,932 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2025-02-08 06:22:48,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:22:48,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-08 06:22:48,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:48,933 INFO L225 Difference]: With dead ends: 94 [2025-02-08 06:22:48,933 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 06:22:48,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:22:48,934 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 81 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:48,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 115 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:48,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 06:22:48,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-08 06:22:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 93 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2025-02-08 06:22:48,936 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 27 [2025-02-08 06:22:48,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:48,937 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2025-02-08 06:22:48,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:48,937 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2025-02-08 06:22:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:22:48,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:48,937 INFO L218 NwaCegarLoop]: trace histogram [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-02-08 06:22:48,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 06:22:48,937 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:48,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:48,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1052406606, now seen corresponding path program 1 times [2025-02-08 06:22:48,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:48,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278957140] [2025-02-08 06:22:48,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:48,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:48,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:22:48,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:22:48,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:48,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:49,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:49,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278957140] [2025-02-08 06:22:49,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278957140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:49,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:49,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 06:22:49,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446330740] [2025-02-08 06:22:49,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:49,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:22:49,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:49,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:22:49,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:22:49,304 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:49,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:49,482 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2025-02-08 06:22:49,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:22:49,483 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-08 06:22:49,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:49,483 INFO L225 Difference]: With dead ends: 122 [2025-02-08 06:22:49,483 INFO L226 Difference]: Without dead ends: 122 [2025-02-08 06:22:49,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:22:49,484 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 24 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:49,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 492 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:49,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-08 06:22:49,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2025-02-08 06:22:49,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 101 states have (on average 1.2178217821782178) internal successors, (123), 117 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:49,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2025-02-08 06:22:49,487 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 33 [2025-02-08 06:22:49,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:49,488 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2025-02-08 06:22:49,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2025-02-08 06:22:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:22:49,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:49,489 INFO L218 NwaCegarLoop]: trace histogram [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-02-08 06:22:49,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 06:22:49,489 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:49,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:49,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1052406542, now seen corresponding path program 1 times [2025-02-08 06:22:49,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:49,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311957702] [2025-02-08 06:22:49,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:49,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:49,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:22:49,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:22:49,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:49,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:50,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:50,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311957702] [2025-02-08 06:22:50,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311957702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:50,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:50,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 06:22:50,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058668161] [2025-02-08 06:22:50,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:50,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 06:22:50,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:50,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 06:22:50,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:22:50,213 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:50,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:50,609 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2025-02-08 06:22:50,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:22:50,610 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-08 06:22:50,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:50,610 INFO L225 Difference]: With dead ends: 121 [2025-02-08 06:22:50,610 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 06:22:50,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:22:50,611 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 11 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:50,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 391 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:22:50,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 06:22:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-02-08 06:22:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 98 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2025-02-08 06:22:50,613 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 33 [2025-02-08 06:22:50,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:50,613 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2025-02-08 06:22:50,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:50,613 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2025-02-08 06:22:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 06:22:50,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:50,613 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] [2025-02-08 06:22:50,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 06:22:50,614 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:22:50,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:50,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1700340878, now seen corresponding path program 1 times [2025-02-08 06:22:50,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:50,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200605007] [2025-02-08 06:22:50,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:50,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:50,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 06:22:50,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 06:22:50,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:50,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:22:51,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:51,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200605007] [2025-02-08 06:22:51,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200605007] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:22:51,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038441789] [2025-02-08 06:22:51,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:51,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:22:51,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:22:51,203 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:22:51,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:22:51,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 06:22:51,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 06:22:51,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:51,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:51,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-02-08 06:22:51,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:22:51,391 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-02-08 06:22:51,439 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-02-08 06:22:51,443 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-02-08 06:22:51,493 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 06:22:51,493 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-02-08 06:22:51,582 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 27 treesize of output 26 [2025-02-08 06:22:51,595 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 11 [2025-02-08 06:22:51,710 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 19 treesize of output 11 [2025-02-08 06:22:51,907 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:22:51,911 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 06:22:51,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2025-02-08 06:22:51,991 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 06:22:51,995 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 0 case distinctions, treesize of input 39 treesize of output 16 [2025-02-08 06:22:52,103 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 38 treesize of output 22 [2025-02-08 06:22:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:52,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:22:52,495 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 84 treesize of output 76 [2025-02-08 06:22:52,497 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 130 treesize of output 122 [2025-02-08 06:22:52,965 INFO L349 Elim1Store]: treesize reduction 66, result has 77.3 percent of original size [2025-02-08 06:22:52,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 983 treesize of output 1142 [2025-02-08 06:22:53,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:22:53,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 470 treesize of output 624 [2025-02-08 06:22:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:59,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038441789] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:22:59,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:22:59,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 41 [2025-02-08 06:22:59,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021885767] [2025-02-08 06:22:59,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:22:59,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-08 06:22:59,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:59,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-08 06:22:59,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1489, Unknown=0, NotChecked=0, Total=1722 [2025-02-08 06:22:59,097 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand has 42 states, 41 states have (on average 2.4146341463414633) internal successors, (99), 42 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:23:00,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:23:00,286 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2025-02-08 06:23:00,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 06:23:00,286 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.4146341463414633) internal successors, (99), 42 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-08 06:23:00,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:23:00,287 INFO L225 Difference]: With dead ends: 113 [2025-02-08 06:23:00,287 INFO L226 Difference]: Without dead ends: 113 [2025-02-08 06:23:00,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=583, Invalid=2839, Unknown=0, NotChecked=0, Total=3422 [2025-02-08 06:23:00,288 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 120 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:23:00,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 812 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 06:23:00,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-08 06:23:00,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2025-02-08 06:23:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 97 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:23:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2025-02-08 06:23:00,295 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 34 [2025-02-08 06:23:00,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:23:00,295 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2025-02-08 06:23:00,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.4146341463414633) internal successors, (99), 42 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:23:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2025-02-08 06:23:00,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:23:00,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:23:00,296 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] [2025-02-08 06:23:00,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 06:23:00,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:23:00,496 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-02-08 06:23:00,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:23:00,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1170959635, now seen corresponding path program 1 times [2025-02-08 06:23:00,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:23:00,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929985694] [2025-02-08 06:23:00,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:23:00,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:23:00,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:23:00,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:23:00,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:23:00,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:23:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:23:01,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:23:01,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929985694] [2025-02-08 06:23:01,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929985694] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:23:01,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608132721] [2025-02-08 06:23:01,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:23:01,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:23:01,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:23:01,190 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:23:01,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:23:01,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:23:01,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:23:01,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:23:01,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:23:01,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-02-08 06:23:01,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:23:01,377 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-02-08 06:23:01,417 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-02-08 06:23:01,425 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-02-08 06:23:01,468 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 06:23:01,468 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-02-08 06:23:01,543 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 11 [2025-02-08 06:23:01,554 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 29 treesize of output 28 [2025-02-08 06:23:01,648 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 19 treesize of output 11 [2025-02-08 06:23:01,821 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:23:01,826 INFO L349 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2025-02-08 06:23:01,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 44 [2025-02-08 06:23:01,894 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 0 case distinctions, treesize of input 75 treesize of output 44 [2025-02-08 06:23:01,900 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 06:23:01,977 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 40 [2025-02-08 06:23:02,007 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 06:23:02,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 19 [2025-02-08 06:23:02,015 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:23:02,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:23:02,543 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 84 treesize of output 76 [2025-02-08 06:23:02,545 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 138 treesize of output 130 [2025-02-08 06:23:03,439 INFO L349 Elim1Store]: treesize reduction 66, result has 86.2 percent of original size [2025-02-08 06:23:03,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 1283 treesize of output 1611 [2025-02-08 06:23:03,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:23:03,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 1114 treesize of output 1384