./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:12:31,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:12:31,319 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 23:12:31,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:12:31,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:12:31,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:12:31,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:12:31,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:12:31,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:12:31,349 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:12:31,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:12:31,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:12:31,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:12:31,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:12:31,350 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:12:31,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:12:31,350 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 23:12:31,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:12:31,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 23:12:31,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:12:31,351 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:12:31,351 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:12:31,352 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:12:31,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:12:31,352 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:12:31,352 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:12:31,352 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 23:12:31,352 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:12:31,352 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:12:31,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:12:31,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:12:31,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:12:31,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:12:31,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:12:31,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:12:31,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:12:31,353 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 23:12:31,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 23:12:31,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:12:31,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:12:31,353 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:12:31,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:12:31,353 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2025-03-08 23:12:31,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:12:31,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:12:31,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:12:31,602 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:12:31,602 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:12:31,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2025-03-08 23:12:32,738 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0366e6dc7/344ec2090e0b4f1286eafb7a9e16adbd/FLAG1ccdb1dae [2025-03-08 23:12:32,977 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:12:32,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2025-03-08 23:12:32,985 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0366e6dc7/344ec2090e0b4f1286eafb7a9e16adbd/FLAG1ccdb1dae [2025-03-08 23:12:33,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0366e6dc7/344ec2090e0b4f1286eafb7a9e16adbd [2025-03-08 23:12:33,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:12:33,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:12:33,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:12:33,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:12:33,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:12:33,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:12:33" (1/1) ... [2025-03-08 23:12:33,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@227fc47e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:33, skipping insertion in model container [2025-03-08 23:12:33,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:12:33" (1/1) ... [2025-03-08 23:12:33,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:12:33,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:12:33,530 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:12:33,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:12:33,576 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:12:33,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:33 WrapperNode [2025-03-08 23:12:33,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:12:33,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:12:33,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:12:33,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:12:33,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:33" (1/1) ... [2025-03-08 23:12:33,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:33" (1/1) ... [2025-03-08 23:12:33,600 INFO L138 Inliner]: procedures = 122, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2025-03-08 23:12:33,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:12:33,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:12:33,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:12:33,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:12:33,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:33" (1/1) ... [2025-03-08 23:12:33,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:33" (1/1) ... [2025-03-08 23:12:33,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:33" (1/1) ... [2025-03-08 23:12:33,617 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2025-03-08 23:12:33,617 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:33" (1/1) ... [2025-03-08 23:12:33,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:33" (1/1) ... [2025-03-08 23:12:33,622 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:33" (1/1) ... [2025-03-08 23:12:33,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:33" (1/1) ... [2025-03-08 23:12:33,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:33" (1/1) ... [2025-03-08 23:12:33,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:33" (1/1) ... [2025-03-08 23:12:33,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:12:33,626 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:12:33,626 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:12:33,626 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:12:33,627 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:33" (1/1) ... [2025-03-08 23:12:33,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:12:33,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:12:33,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 23:12:33,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 23:12:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-03-08 23:12:33,669 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-03-08 23:12:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 23:12:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 23:12:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 23:12:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 23:12:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 23:12:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 23:12:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 23:12:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 23:12:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 23:12:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 23:12:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 23:12:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 23:12:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 23:12:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:12:33,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:12:33,739 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:12:33,741 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:12:33,756 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-03-08 23:12:33,962 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2025-03-08 23:12:33,962 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:12:33,971 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:12:33,972 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:12:33,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:12:33 BoogieIcfgContainer [2025-03-08 23:12:33,972 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:12:33,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:12:33,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:12:33,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:12:33,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:12:33" (1/3) ... [2025-03-08 23:12:33,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b46c3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:12:33, skipping insertion in model container [2025-03-08 23:12:33,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:33" (2/3) ... [2025-03-08 23:12:33,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b46c3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:12:33, skipping insertion in model container [2025-03-08 23:12:33,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:12:33" (3/3) ... [2025-03-08 23:12:33,979 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2025-03-08 23:12:33,990 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:12:33,991 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_circular_traversal-2.i that has 2 procedures, 84 locations, 1 initial locations, 3 loop locations, and 35 error locations. [2025-03-08 23:12:34,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:12:34,028 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;@4ce2697e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:12:34,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-03-08 23:12:34,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 45 states have (on average 2.0) internal successors, (90), 81 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 23:12:34,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:12:34,035 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 23:12:34,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-08 23:12:34,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:12:34,039 INFO L85 PathProgramCache]: Analyzing trace with hash 3908540, now seen corresponding path program 1 times [2025-03-08 23:12:34,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:12:34,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831936090] [2025-03-08 23:12:34,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:34,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:12:34,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 23:12:34,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 23:12:34,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:34,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:12:34,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:12:34,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831936090] [2025-03-08 23:12:34,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831936090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:12:34,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:12:34,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:12:34,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631181822] [2025-03-08 23:12:34,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:12:34,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:12:34,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:12:34,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:12:34,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:12:34,238 INFO L87 Difference]: Start difference. First operand has 83 states, 45 states have (on average 2.0) internal successors, (90), 81 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-03-08 23:12:34,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:12:34,332 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2025-03-08 23:12:34,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:12:34,333 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-03-08 23:12:34,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:12:34,337 INFO L225 Difference]: With dead ends: 78 [2025-03-08 23:12:34,337 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 23:12:34,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:12:34,341 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:12:34,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 95 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:12:34,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 23:12:34,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-08 23:12:34,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.829268292682927) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:34,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2025-03-08 23:12:34,371 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 4 [2025-03-08 23:12:34,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:12:34,371 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2025-03-08 23:12:34,372 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-03-08 23:12:34,372 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2025-03-08 23:12:34,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 23:12:34,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:12:34,372 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 23:12:34,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 23:12:34,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-08 23:12:34,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:12:34,373 INFO L85 PathProgramCache]: Analyzing trace with hash 3908541, now seen corresponding path program 1 times [2025-03-08 23:12:34,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:12:34,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819945840] [2025-03-08 23:12:34,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:34,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:12:34,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 23:12:34,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 23:12:34,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:34,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:12:34,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:12:34,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819945840] [2025-03-08 23:12:34,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819945840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:12:34,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:12:34,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:12:34,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847557966] [2025-03-08 23:12:34,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:12:34,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:12:34,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:12:34,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:12:34,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:12:34,460 INFO L87 Difference]: Start difference. First operand 72 states and 75 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-03-08 23:12:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:12:34,523 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2025-03-08 23:12:34,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:12:34,523 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-03-08 23:12:34,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:12:34,524 INFO L225 Difference]: With dead ends: 68 [2025-03-08 23:12:34,524 INFO L226 Difference]: Without dead ends: 68 [2025-03-08 23:12:34,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:12:34,525 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 19 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:12:34,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 88 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:12:34,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-08 23:12:34,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-08 23:12:34,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2025-03-08 23:12:34,532 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 4 [2025-03-08 23:12:34,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:12:34,532 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2025-03-08 23:12:34,532 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-03-08 23:12:34,532 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2025-03-08 23:12:34,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 23:12:34,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:12:34,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:12:34,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 23:12:34,533 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-08 23:12:34,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:12:34,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2099180722, now seen corresponding path program 1 times [2025-03-08 23:12:34,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:12:34,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480330872] [2025-03-08 23:12:34,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:34,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:12:34,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 23:12:34,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 23:12:34,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:34,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:34,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:12:34,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:12:34,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480330872] [2025-03-08 23:12:34,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480330872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:12:34,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:12:34,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:12:34,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361179423] [2025-03-08 23:12:34,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:12:34,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:12:34,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:12:34,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:12:34,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:12:34,617 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-03-08 23:12:34,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:12:34,660 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2025-03-08 23:12:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:12:34,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-03-08 23:12:34,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:12:34,661 INFO L225 Difference]: With dead ends: 66 [2025-03-08 23:12:34,661 INFO L226 Difference]: Without dead ends: 66 [2025-03-08 23:12:34,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:12:34,662 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:12:34,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 94 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:12:34,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-08 23:12:34,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-08 23:12:34,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:34,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2025-03-08 23:12:34,665 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 10 [2025-03-08 23:12:34,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:12:34,665 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2025-03-08 23:12:34,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-03-08 23:12:34,665 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2025-03-08 23:12:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 23:12:34,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:12:34,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:12:34,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 23:12:34,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-08 23:12:34,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:12:34,666 INFO L85 PathProgramCache]: Analyzing trace with hash 2099180723, now seen corresponding path program 1 times [2025-03-08 23:12:34,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:12:34,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628729250] [2025-03-08 23:12:34,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:34,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:12:34,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 23:12:34,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 23:12:34,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:34,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:12:34,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:12:34,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628729250] [2025-03-08 23:12:34,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628729250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:12:34,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:12:34,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:12:34,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258939408] [2025-03-08 23:12:34,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:12:34,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:12:34,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:12:34,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:12:34,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:12:34,773 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-03-08 23:12:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:12:34,828 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2025-03-08 23:12:34,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:12:34,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-03-08 23:12:34,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:12:34,829 INFO L225 Difference]: With dead ends: 64 [2025-03-08 23:12:34,830 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 23:12:34,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:12:34,830 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:12:34,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 97 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:12:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 23:12:34,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-08 23:12:34,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:34,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2025-03-08 23:12:34,836 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 10 [2025-03-08 23:12:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:12:34,836 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2025-03-08 23:12:34,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-03-08 23:12:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2025-03-08 23:12:34,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 23:12:34,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:12:34,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:12:34,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 23:12:34,837 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-08 23:12:34,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:12:34,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2099181206, now seen corresponding path program 1 times [2025-03-08 23:12:34,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:12:34,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747771491] [2025-03-08 23:12:34,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:34,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:12:34,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 23:12:34,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 23:12:34,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:34,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:34,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:12:34,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:12:34,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747771491] [2025-03-08 23:12:34,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747771491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:12:34,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:12:34,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:12:34,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116778298] [2025-03-08 23:12:34,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:12:34,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:12:34,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:12:34,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:12:34,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:12:34,892 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-03-08 23:12:34,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:12:34,908 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2025-03-08 23:12:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:12:34,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-03-08 23:12:34,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:12:34,912 INFO L225 Difference]: With dead ends: 72 [2025-03-08 23:12:34,912 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 23:12:34,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:12:34,913 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:12:34,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 122 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:12:34,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 23:12:34,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2025-03-08 23:12:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.619047619047619) internal successors, (68), 64 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2025-03-08 23:12:34,920 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 10 [2025-03-08 23:12:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:12:34,920 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2025-03-08 23:12:34,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-03-08 23:12:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2025-03-08 23:12:34,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 23:12:34,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:12:34,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:12:34,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 23:12:34,920 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-08 23:12:34,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:12:34,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1321953937, now seen corresponding path program 1 times [2025-03-08 23:12:34,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:12:34,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760605772] [2025-03-08 23:12:34,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:34,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:12:34,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 23:12:34,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 23:12:34,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:34,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:12:35,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:12:35,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760605772] [2025-03-08 23:12:35,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760605772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:12:35,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:12:35,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:12:35,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010601668] [2025-03-08 23:12:35,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:12:35,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:12:35,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:12:35,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:12:35,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:12:35,076 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:35,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:12:35,153 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2025-03-08 23:12:35,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:12:35,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 23:12:35,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:12:35,154 INFO L225 Difference]: With dead ends: 69 [2025-03-08 23:12:35,156 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 23:12:35,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:12:35,156 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:12:35,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 109 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:12:35,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 23:12:35,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-08 23:12:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2025-03-08 23:12:35,163 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2025-03-08 23:12:35,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:12:35,163 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2025-03-08 23:12:35,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:35,163 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2025-03-08 23:12:35,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 23:12:35,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:12:35,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:12:35,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 23:12:35,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-08 23:12:35,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:12:35,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1321953936, now seen corresponding path program 1 times [2025-03-08 23:12:35,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:12:35,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88702289] [2025-03-08 23:12:35,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:35,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:12:35,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 23:12:35,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 23:12:35,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:35,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:12:35,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:12:35,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88702289] [2025-03-08 23:12:35,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88702289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:12:35,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:12:35,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:12:35,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766010119] [2025-03-08 23:12:35,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:12:35,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:12:35,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:12:35,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:12:35,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:12:35,347 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:12:35,442 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2025-03-08 23:12:35,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:12:35,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 23:12:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:12:35,443 INFO L225 Difference]: With dead ends: 69 [2025-03-08 23:12:35,443 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 23:12:35,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:12:35,443 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 36 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:12:35,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 117 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:12:35,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 23:12:35,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-08 23:12:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.565217391304348) internal successors, (72), 68 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2025-03-08 23:12:35,446 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 12 [2025-03-08 23:12:35,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:12:35,446 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2025-03-08 23:12:35,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:35,446 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2025-03-08 23:12:35,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 23:12:35,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:12:35,446 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:12:35,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 23:12:35,447 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-08 23:12:35,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:12:35,447 INFO L85 PathProgramCache]: Analyzing trace with hash 823153563, now seen corresponding path program 1 times [2025-03-08 23:12:35,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:12:35,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057079584] [2025-03-08 23:12:35,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:35,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:12:35,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 23:12:35,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 23:12:35,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:35,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:35,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:12:35,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:12:35,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057079584] [2025-03-08 23:12:35,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057079584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:12:35,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054115435] [2025-03-08 23:12:35,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:35,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:12:35,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:12:35,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:12:35,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 23:12:35,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 23:12:35,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 23:12:35,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:35,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:35,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 23:12:35,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:12:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:12:35,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:12:35,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:12:35,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054115435] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:12:35,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:12:35,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-08 23:12:35,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941092353] [2025-03-08 23:12:35,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:12:35,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:12:35,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:12:35,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:12:35,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:12:35,681 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:35,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:12:35,699 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2025-03-08 23:12:35,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:12:35,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-03-08 23:12:35,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:12:35,700 INFO L225 Difference]: With dead ends: 87 [2025-03-08 23:12:35,700 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 23:12:35,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:12:35,701 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 18 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:12:35,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 185 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:12:35,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 23:12:35,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2025-03-08 23:12:35,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.5) internal successors, (90), 82 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-03-08 23:12:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2025-03-08 23:12:35,704 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 16 [2025-03-08 23:12:35,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:12:35,704 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2025-03-08 23:12:35,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:35,705 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2025-03-08 23:12:35,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 23:12:35,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:12:35,705 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:12:35,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 23:12:35,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:12:35,906 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-08 23:12:35,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:12:35,906 INFO L85 PathProgramCache]: Analyzing trace with hash 776127796, now seen corresponding path program 1 times [2025-03-08 23:12:35,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:12:35,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505656314] [2025-03-08 23:12:35,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:35,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:12:35,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 23:12:35,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 23:12:35,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:35,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:12:36,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:12:36,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505656314] [2025-03-08 23:12:36,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505656314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:12:36,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024978761] [2025-03-08 23:12:36,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:36,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:12:36,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:12:36,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:12:36,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 23:12:36,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 23:12:36,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 23:12:36,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:36,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:36,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 23:12:36,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:12:36,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:12:36,176 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 23:12:36,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-08 23:12:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:12:36,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:12:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:12:36,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024978761] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:12:36,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:12:36,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2025-03-08 23:12:36,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23689796] [2025-03-08 23:12:36,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:12:36,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:12:36,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:12:36,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:12:36,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:12:36,234 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-03-08 23:12:36,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:12:36,301 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2025-03-08 23:12:36,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:12:36,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 18 [2025-03-08 23:12:36,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:12:36,302 INFO L225 Difference]: With dead ends: 81 [2025-03-08 23:12:36,302 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 23:12:36,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:12:36,303 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 7 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:12:36,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 115 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:12:36,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 23:12:36,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-08 23:12:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 80 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-03-08 23:12:36,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2025-03-08 23:12:36,306 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 18 [2025-03-08 23:12:36,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:12:36,306 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2025-03-08 23:12:36,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-03-08 23:12:36,306 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2025-03-08 23:12:36,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 23:12:36,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:12:36,307 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:12:36,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 23:12:36,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 23:12:36,507 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-08 23:12:36,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:12:36,508 INFO L85 PathProgramCache]: Analyzing trace with hash 776127797, now seen corresponding path program 1 times [2025-03-08 23:12:36,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:12:36,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233860898] [2025-03-08 23:12:36,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:36,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:12:36,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 23:12:36,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 23:12:36,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:36,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:36,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:12:36,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:12:36,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233860898] [2025-03-08 23:12:36,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233860898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:12:36,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701686845] [2025-03-08 23:12:36,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:36,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:12:36,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:12:36,666 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:12:36,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 23:12:36,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 23:12:36,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 23:12:36,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:36,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:36,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 23:12:36,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:12:36,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:12:36,809 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 23:12:36,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-08 23:12:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:12:36,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:12:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:12:36,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701686845] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:12:36,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:12:36,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2025-03-08 23:12:36,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295006745] [2025-03-08 23:12:36,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:12:36,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:12:36,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:12:36,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:12:36,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:12:36,934 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:37,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:12:37,029 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2025-03-08 23:12:37,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:12:37,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 18 [2025-03-08 23:12:37,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:12:37,030 INFO L225 Difference]: With dead ends: 79 [2025-03-08 23:12:37,030 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 23:12:37,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:12:37,030 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:12:37,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 187 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:12:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 23:12:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-08 23:12:37,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:37,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2025-03-08 23:12:37,038 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 18 [2025-03-08 23:12:37,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:12:37,039 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2025-03-08 23:12:37,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:37,039 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2025-03-08 23:12:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 23:12:37,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:12:37,039 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:12:37,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 23:12:37,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:12:37,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-08 23:12:37,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:12:37,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2099347250, now seen corresponding path program 1 times [2025-03-08 23:12:37,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:12:37,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392747120] [2025-03-08 23:12:37,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:37,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:12:37,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:12:37,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:12:37,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:37,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 23:12:37,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:12:37,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392747120] [2025-03-08 23:12:37,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392747120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:12:37,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:12:37,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:12:37,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493354924] [2025-03-08 23:12:37,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:12:37,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:12:37,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:12:37,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:12:37,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:12:37,395 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:37,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:12:37,498 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2025-03-08 23:12:37,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:12:37,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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 37 [2025-03-08 23:12:37,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:12:37,499 INFO L225 Difference]: With dead ends: 76 [2025-03-08 23:12:37,499 INFO L226 Difference]: Without dead ends: 76 [2025-03-08 23:12:37,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:12:37,500 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 18 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:12:37,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 119 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:12:37,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-08 23:12:37,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-08 23:12:37,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:37,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2025-03-08 23:12:37,503 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 37 [2025-03-08 23:12:37,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:12:37,503 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2025-03-08 23:12:37,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:37,503 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2025-03-08 23:12:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 23:12:37,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:12:37,504 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:12:37,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 23:12:37,504 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-08 23:12:37,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:12:37,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2099347251, now seen corresponding path program 1 times [2025-03-08 23:12:37,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:12:37,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988843180] [2025-03-08 23:12:37,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:37,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:12:37,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:12:37,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:12:37,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:37,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:37,741 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 23:12:37,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:12:37,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988843180] [2025-03-08 23:12:37,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988843180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:12:37,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:12:37,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:12:37,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765884705] [2025-03-08 23:12:37,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:12:37,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:12:37,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:12:37,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:12:37,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:12:37,742 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:37,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:12:37,840 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2025-03-08 23:12:37,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:12:37,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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 37 [2025-03-08 23:12:37,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:12:37,841 INFO L225 Difference]: With dead ends: 83 [2025-03-08 23:12:37,841 INFO L226 Difference]: Without dead ends: 83 [2025-03-08 23:12:37,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:12:37,842 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:12:37,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 151 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:12:37,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-08 23:12:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2025-03-08 23:12:37,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.296875) internal successors, (83), 78 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:37,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2025-03-08 23:12:37,844 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 37 [2025-03-08 23:12:37,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:12:37,844 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2025-03-08 23:12:37,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:37,844 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2025-03-08 23:12:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 23:12:37,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:12:37,845 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:12:37,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 23:12:37,846 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-08 23:12:37,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:12:37,846 INFO L85 PathProgramCache]: Analyzing trace with hash 85247174, now seen corresponding path program 1 times [2025-03-08 23:12:37,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:12:37,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243099163] [2025-03-08 23:12:37,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:37,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:12:37,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:12:37,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:12:37,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:37,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 23:12:38,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:12:38,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243099163] [2025-03-08 23:12:38,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243099163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:12:38,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195962777] [2025-03-08 23:12:38,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:38,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:12:38,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:12:38,367 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:12:38,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 23:12:38,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:12:38,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:12:38,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:38,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:38,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-08 23:12:38,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:12:38,623 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 23:12:38,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-08 23:12:38,719 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2025-03-08 23:12:38,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2025-03-08 23:12:38,858 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-08 23:12:38,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-03-08 23:12:38,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:12:38,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 23:12:39,016 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 11 [2025-03-08 23:12:39,046 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 11 [2025-03-08 23:12:39,130 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:12:39,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:12:39,253 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_908 (Array Int Int)) (v_ArrVal_907 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_907))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_908) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_908 (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_908 .cse1)))))))) is different from false [2025-03-08 23:12:39,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:12:39,262 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2025-03-08 23:12:39,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:12:39,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 100 [2025-03-08 23:12:39,293 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2025-03-08 23:12:39,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 75 [2025-03-08 23:12:39,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-08 23:12:39,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:12:39,357 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 28 treesize of output 32 [2025-03-08 23:12:39,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:12:39,381 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 48 treesize of output 52 [2025-03-08 23:12:39,427 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 35 treesize of output 31 [2025-03-08 23:12:39,443 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 69 treesize of output 61 [2025-03-08 23:12:39,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:12:39,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 129 [2025-03-08 23:12:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-03-08 23:12:40,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195962777] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:12:40,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:12:40,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 43 [2025-03-08 23:12:40,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402351938] [2025-03-08 23:12:40,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:12:40,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-08 23:12:40,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:12:40,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-08 23:12:40,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1484, Unknown=23, NotChecked=80, Total=1806 [2025-03-08 23:12:40,099 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 43 states, 43 states have (on average 2.4186046511627906) internal successors, (104), 43 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-03-08 23:12:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:12:40,638 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2025-03-08 23:12:40,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 23:12:40,639 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.4186046511627906) internal successors, (104), 43 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) Word has length 41 [2025-03-08 23:12:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:12:40,639 INFO L225 Difference]: With dead ends: 79 [2025-03-08 23:12:40,639 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 23:12:40,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=426, Invalid=2205, Unknown=25, NotChecked=100, Total=2756 [2025-03-08 23:12:40,641 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 44 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:12:40,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 651 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 457 Invalid, 0 Unknown, 29 Unchecked, 0.3s Time] [2025-03-08 23:12:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 23:12:40,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-08 23:12:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.28125) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:40,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2025-03-08 23:12:40,649 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 41 [2025-03-08 23:12:40,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:12:40,649 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2025-03-08 23:12:40,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.4186046511627906) internal successors, (104), 43 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-03-08 23:12:40,650 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2025-03-08 23:12:40,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 23:12:40,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:12:40,650 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:12:40,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 23:12:40,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:12:40,851 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-08 23:12:40,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:12:40,851 INFO L85 PathProgramCache]: Analyzing trace with hash 382033688, now seen corresponding path program 1 times [2025-03-08 23:12:40,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:12:40,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933155836] [2025-03-08 23:12:40,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:40,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:12:40,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 23:12:40,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 23:12:40,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:40,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 23:12:41,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:12:41,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933155836] [2025-03-08 23:12:41,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933155836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:12:41,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439679170] [2025-03-08 23:12:41,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:41,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:12:41,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:12:41,550 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:12:41,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 23:12:41,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 23:12:41,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 23:12:41,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:41,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:41,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-08 23:12:41,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:12:41,730 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-08 23:12:41,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-08 23:12:41,759 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 23:12:41,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-08 23:12:41,803 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-08 23:12:41,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-03-08 23:12:41,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 23:12:41,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 23:12:41,855 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 23:12:41,855 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-08 23:12:41,901 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 30 treesize of output 23 [2025-03-08 23:12:41,920 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 41 treesize of output 19 [2025-03-08 23:12:41,972 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 37 treesize of output 19 [2025-03-08 23:12:41,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 31 treesize of output 13 [2025-03-08 23:12:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:12:41,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:12:42,096 INFO L349 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2025-03-08 23:12:42,097 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 24 treesize of output 23 [2025-03-08 23:12:46,147 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 (Array Int Int)) (v_ArrVal_1151 (Array Int Int)) (v_ArrVal_1150 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1150 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1150)) (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1150) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1152) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2025-03-08 23:12:46,156 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 74 treesize of output 72 [2025-03-08 23:12:46,159 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 58 treesize of output 50 [2025-03-08 23:12:46,164 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 24 treesize of output 20 [2025-03-08 23:12:46,313 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 23:12:46,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-08 23:12:46,322 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 27 refuted. 1 times theorem prover too weak. 2 trivial. 3 not checked. [2025-03-08 23:12:46,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439679170] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:12:46,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:12:46,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 39 [2025-03-08 23:12:46,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931349109] [2025-03-08 23:12:46,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:12:46,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 23:12:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:12:46,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 23:12:46,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1321, Unknown=27, NotChecked=74, Total=1560 [2025-03-08 23:12:46,323 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 40 states, 39 states have (on average 2.769230769230769) internal successors, (108), 40 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:12:46,960 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2025-03-08 23:12:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 23:12:46,960 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.769230769230769) internal successors, (108), 40 states have internal predecessors, (108), 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 43 [2025-03-08 23:12:46,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:12:46,961 INFO L225 Difference]: With dead ends: 83 [2025-03-08 23:12:46,961 INFO L226 Difference]: Without dead ends: 83 [2025-03-08 23:12:46,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=308, Invalid=2119, Unknown=27, NotChecked=96, Total=2550 [2025-03-08 23:12:46,962 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 60 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:12:46,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 428 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 791 Invalid, 0 Unknown, 52 Unchecked, 0.4s Time] [2025-03-08 23:12:46,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-08 23:12:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-08 23:12:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 82 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-03-08 23:12:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2025-03-08 23:12:46,964 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 43 [2025-03-08 23:12:46,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:12:46,964 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2025-03-08 23:12:46,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.769230769230769) internal successors, (108), 40 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2025-03-08 23:12:46,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 23:12:46,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:12:46,965 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:12:46,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 23:12:47,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 23:12:47,166 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-08 23:12:47,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:12:47,167 INFO L85 PathProgramCache]: Analyzing trace with hash 382033689, now seen corresponding path program 1 times [2025-03-08 23:12:47,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:12:47,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078890455] [2025-03-08 23:12:47,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:47,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:12:47,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 23:12:47,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 23:12:47,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:47,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 23:12:48,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:12:48,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078890455] [2025-03-08 23:12:48,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078890455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:12:48,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941781932] [2025-03-08 23:12:48,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:48,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:12:48,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:12:48,687 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:12:48,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 23:12:48,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 23:12:48,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 23:12:48,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:48,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:48,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-08 23:12:48,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:12:48,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 23:12:48,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:12:48,937 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 23:12:48,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-08 23:12:48,949 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:12:48,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 23:12:48,986 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 11 treesize of output 7 [2025-03-08 23:12:48,993 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 11 treesize of output 7 [2025-03-08 23:12:49,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 23:12:49,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 23:12:49,047 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:12:49,048 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-08 23:12:49,053 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 24 treesize of output 11 [2025-03-08 23:12:49,137 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-08 23:12:49,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2025-03-08 23:12:49,147 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-08 23:12:49,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 23:12:49,216 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 23:12:49,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 49 [2025-03-08 23:12:49,221 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 23:12:49,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2025-03-08 23:12:49,414 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 23:12:49,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 49 [2025-03-08 23:12:49,420 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 23:12:49,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2025-03-08 23:12:49,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:12:49,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 46 [2025-03-08 23:12:49,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:12:49,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2025-03-08 23:12:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 23:12:49,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:12:49,969 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1404) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< (+ 3 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1403) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (select |c_#length| .cse1)) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_ArrVal_1403 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1403) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse2) (< 0 (+ .cse2 1))))) (or (forall ((v_ArrVal_1403 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1403) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) 1))) (forall ((v_ArrVal_1404 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1404) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1403) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< (+ 3 .cse3) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1404) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse3)))))) is different from false [2025-03-08 23:12:50,050 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (or (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1401 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1401) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1404) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1401 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1401)))) (forall ((v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1400 (Array Int Int))) (or (not (= v_ArrVal_1400 (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1400 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1400) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1403) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) 1))))) (forall ((v_ArrVal_1400 (Array Int Int))) (or (not (= v_ArrVal_1400 (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1400 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1403 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1400) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1403) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse3) (< 0 (+ .cse3 1))))))) (forall ((v_ArrVal_1400 (Array Int Int))) (or (not (= v_ArrVal_1400 (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1400 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1401 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1401 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1401)) (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1400) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1403) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse4) (< (+ 3 .cse4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1401) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1404) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)))))))))) (forall ((v_ArrVal_1400 (Array Int Int))) (or (not (= v_ArrVal_1400 (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1400 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1401 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1401 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1401)) (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1401) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1404) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< (+ 3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1400) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1403) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (select |c_#length| .cse5))))))))))) is different from false [2025-03-08 23:12:50,068 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 67 treesize of output 65 [2025-03-08 23:12:50,079 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 23 treesize of output 15 [2025-03-08 23:12:50,084 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:12:50,085 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 40 treesize of output 38 [2025-03-08 23:12:50,088 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:12:50,089 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 39 treesize of output 37 [2025-03-08 23:12:50,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:12:50,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-08 23:12:50,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:12:50,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-08 23:12:50,110 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 24 treesize of output 16 [2025-03-08 23:12:50,115 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 27 treesize of output 15 [2025-03-08 23:12:50,121 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:12:50,123 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 47 treesize of output 45 [2025-03-08 23:12:50,126 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:12:50,128 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 32 treesize of output 30 [2025-03-08 23:12:50,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:12:50,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-08 23:12:50,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-08 23:12:50,150 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:12:50,152 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 24 treesize of output 22 [2025-03-08 23:12:50,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:12:50,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-08 23:12:50,164 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 16 treesize of output 8 [2025-03-08 23:12:50,169 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:12:50,171 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 24 [2025-03-08 23:12:50,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:12:50,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-08 23:12:50,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-08 23:12:50,350 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 2 not checked. [2025-03-08 23:12:50,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941781932] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:12:50,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:12:50,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 13] total 46 [2025-03-08 23:12:50,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988863593] [2025-03-08 23:12:50,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:12:50,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-08 23:12:50,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:12:50,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-08 23:12:50,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1827, Unknown=2, NotChecked=174, Total=2162 [2025-03-08 23:12:50,352 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 47 states, 46 states have (on average 2.4347826086956523) internal successors, (112), 47 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:52,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:12:52,059 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2025-03-08 23:12:52,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 23:12:52,060 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.4347826086956523) internal successors, (112), 47 states have internal predecessors, (112), 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 43 [2025-03-08 23:12:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:12:52,060 INFO L225 Difference]: With dead ends: 89 [2025-03-08 23:12:52,060 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 23:12:52,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=420, Invalid=3368, Unknown=2, NotChecked=242, Total=4032 [2025-03-08 23:12:52,061 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 65 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 23:12:52,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 586 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1146 Invalid, 0 Unknown, 134 Unchecked, 0.6s Time] [2025-03-08 23:12:52,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 23:12:52,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2025-03-08 23:12:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 71 states have (on average 1.267605633802817) internal successors, (90), 84 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-03-08 23:12:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2025-03-08 23:12:52,063 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 43 [2025-03-08 23:12:52,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:12:52,063 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2025-03-08 23:12:52,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.4347826086956523) internal successors, (112), 47 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:12:52,063 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2025-03-08 23:12:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 23:12:52,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:12:52,069 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:12:52,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 23:12:52,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 23:12:52,269 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-08 23:12:52,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:12:52,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2062169669, now seen corresponding path program 1 times [2025-03-08 23:12:52,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:12:52,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970367979] [2025-03-08 23:12:52,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:52,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:12:52,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 23:12:52,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 23:12:52,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:52,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 23:12:52,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:12:52,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970367979] [2025-03-08 23:12:52,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970367979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:12:52,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:12:52,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:12:52,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298509113] [2025-03-08 23:12:52,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:12:52,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:12:52,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:12:52,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:12:52,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:12:52,352 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 5 states, 4 states have (on average 6.75) 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-03-08 23:12:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:12:52,403 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2025-03-08 23:12:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:12:52,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) 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 45 [2025-03-08 23:12:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:12:52,404 INFO L225 Difference]: With dead ends: 87 [2025-03-08 23:12:52,404 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 23:12:52,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:12:52,405 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:12:52,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 85 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:12:52,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 23:12:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2025-03-08 23:12:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 82 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-03-08 23:12:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2025-03-08 23:12:52,407 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 45 [2025-03-08 23:12:52,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:12:52,407 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2025-03-08 23:12:52,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) 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-03-08 23:12:52,408 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2025-03-08 23:12:52,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 23:12:52,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:12:52,409 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:12:52,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 23:12:52,409 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-08 23:12:52,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:12:52,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2062169670, now seen corresponding path program 1 times [2025-03-08 23:12:52,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:12:52,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025242707] [2025-03-08 23:12:52,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:52,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:12:52,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 23:12:52,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 23:12:52,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:52,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 23:12:52,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:12:52,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025242707] [2025-03-08 23:12:52,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025242707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:12:52,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:12:52,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:12:52,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072556840] [2025-03-08 23:12:52,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:12:52,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:12:52,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:12:52,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:12:52,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:12:52,587 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 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-03-08 23:12:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:12:52,697 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2025-03-08 23:12:52,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:12:52,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 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 45 [2025-03-08 23:12:52,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:12:52,698 INFO L225 Difference]: With dead ends: 86 [2025-03-08 23:12:52,698 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 23:12:52,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:12:52,699 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 16 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:12:52,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 138 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:12:52,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 23:12:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2025-03-08 23:12:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 81 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-03-08 23:12:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2025-03-08 23:12:52,700 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 45 [2025-03-08 23:12:52,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:12:52,700 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2025-03-08 23:12:52,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 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-03-08 23:12:52,700 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2025-03-08 23:12:52,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 23:12:52,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:12:52,701 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:12:52,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 23:12:52,701 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-08 23:12:52,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:12:52,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1750745516, now seen corresponding path program 1 times [2025-03-08 23:12:52,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:12:52,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504955856] [2025-03-08 23:12:52,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:52,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:12:52,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 23:12:52,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 23:12:52,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:52,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:12:53,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:12:53,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504955856] [2025-03-08 23:12:53,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504955856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:12:53,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103913407] [2025-03-08 23:12:53,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:12:53,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:12:53,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:12:54,001 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:12:54,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 23:12:54,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 23:12:54,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 23:12:54,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:12:54,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:12:54,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-03-08 23:12:54,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:12:54,251 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 23:12:54,251 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 17 treesize of output 21 [2025-03-08 23:12:54,347 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-08 23:12:54,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-03-08 23:12:54,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:12:54,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 23:12:54,563 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-03-08 23:12:54,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2025-03-08 23:12:54,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:12:54,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 23:12:54,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 23:12:54,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 23:12:54,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 23:12:54,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 23:12:54,704 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:12:54,704 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 74 [2025-03-08 23:12:54,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-03-08 23:12:54,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 23:12:54,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 23:12:54,808 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 36 treesize of output 27 [2025-03-08 23:12:54,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-08 23:12:54,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 23:12:54,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-03-08 23:12:54,853 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 20 treesize of output 15 [2025-03-08 23:12:54,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-03-08 23:12:54,956 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 20 treesize of output 15 [2025-03-08 23:12:54,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 23:12:54,969 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 27 treesize of output 15 [2025-03-08 23:12:54,973 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 15 treesize of output 7 [2025-03-08 23:12:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:12:55,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:12:55,527 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_36| Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1905 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1907) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1916) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|) |c_ULTIMATE.start_main_~data_init~0#1|) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|)))) is different from false [2025-03-08 23:13:00,311 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1903 Int) (v_ArrVal_1901 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_36| Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1902 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1907) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1916) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1902) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1901) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 0)))) is different from false [2025-03-08 23:13:00,453 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1903 Int) (v_ArrVal_1901 (Array Int Int)) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1898 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_36| Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1902 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (or (not (= v_ArrVal_1900 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1900 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (< (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1899) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1901) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1898) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1907) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1916) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1902) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|) |c_ULTIMATE.start_main_~data_init~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 0) (not (= (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1899 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1899))))) is different from false [2025-03-08 23:13:00,482 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 326 treesize of output 324 [2025-03-08 23:13:00,502 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 74 treesize of output 66 [2025-03-08 23:13:00,514 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 71 treesize of output 67 [2025-03-08 23:13:00,539 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 78 treesize of output 76 [2025-03-08 23:13:00,552 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 66 treesize of output 58 [2025-03-08 23:13:00,572 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 28 treesize of output 24 [2025-03-08 23:13:00,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:00,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2025-03-08 23:13:00,846 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 27 treesize of output 23 [2025-03-08 23:13:01,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:01,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2025-03-08 23:13:01,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:01,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-08 23:13:01,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:01,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-08 23:13:01,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:01,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-08 23:13:03,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:03,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-08 23:13:03,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:03,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-08 23:13:15,209 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2025-03-08 23:13:15,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 5094 treesize of output 4810 [2025-03-08 23:13:15,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:15,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 508 treesize of output 516 [2025-03-08 23:13:15,348 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:13:15,353 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 402 treesize of output 392 [2025-03-08 23:13:15,369 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:13:15,374 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 319 treesize of output 307 [2025-03-08 23:13:15,399 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 338 treesize of output 320 [2025-03-08 23:13:15,421 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 393 treesize of output 357 [2025-03-08 23:13:15,521 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 6 treesize of output 4 [2025-03-08 23:13:15,606 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 6 treesize of output 4 [2025-03-08 23:13:15,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2025-03-08 23:13:15,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2025-03-08 23:13:17,222 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:13:17,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:17,262 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 411 treesize of output 411 [2025-03-08 23:13:20,242 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-08 23:13:20,265 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 234 treesize of output 226 [2025-03-08 23:13:20,275 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 53 treesize of output 49 [2025-03-08 23:13:20,285 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 49 treesize of output 47 [2025-03-08 23:13:20,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:13:20,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:20,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 467 treesize of output 459 [2025-03-08 23:13:20,377 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 108 treesize of output 100 [2025-03-08 23:13:20,388 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 158 treesize of output 142 [2025-03-08 23:13:20,399 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 99 treesize of output 95 [2025-03-08 23:13:20,594 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:13:20,694 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-08 23:13:20,694 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 7775 treesize of output 7665 [2025-03-08 23:13:20,716 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 237 treesize of output 227 [2025-03-08 23:13:20,730 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 220 treesize of output 204 [2025-03-08 23:13:20,747 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:13:20,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 119 [2025-03-08 23:13:20,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:20,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 66 [2025-03-08 23:13:20,803 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:13:20,810 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 132 treesize of output 128 [2025-03-08 23:13:21,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:13:21,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:21,376 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 21 treesize of output 25 [2025-03-08 23:13:21,462 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:13:21,559 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-08 23:13:21,559 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2251 treesize of output 2109 [2025-03-08 23:13:21,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:21,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 229 [2025-03-08 23:13:21,605 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:13:21,610 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 184 treesize of output 176 [2025-03-08 23:13:21,622 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 262 treesize of output 246 [2025-03-08 23:13:21,636 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 116 treesize of output 106 [2025-03-08 23:13:21,676 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 6 treesize of output 4 [2025-03-08 23:13:22,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:22,039 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 38 treesize of output 42 [2025-03-08 23:13:22,356 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:13:22,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:22,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2025-03-08 23:13:22,386 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 46 treesize of output 42 [2025-03-08 23:13:22,390 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:13:22,394 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 30 treesize of output 28 [2025-03-08 23:13:22,399 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:13:22,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:22,417 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 30 treesize of output 34 [2025-03-08 23:13:22,424 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 9 treesize of output 7 [2025-03-08 23:13:22,624 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-08 23:13:22,624 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 646 treesize of output 592 [2025-03-08 23:13:22,637 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:13:22,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:22,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 134 [2025-03-08 23:13:22,664 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:13:22,668 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 93 treesize of output 87 [2025-03-08 23:13:22,678 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 54 treesize of output 46 [2025-03-08 23:13:22,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:13:22,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:22,856 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 24 treesize of output 28 [2025-03-08 23:13:22,986 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:13:22,991 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:13:23,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:23,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 645 treesize of output 573 [2025-03-08 23:13:23,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:23,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 77 [2025-03-08 23:13:23,057 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 60 treesize of output 56 [2025-03-08 23:13:23,069 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 54 treesize of output 46 [2025-03-08 23:13:23,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:13:23,173 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:13:23,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2025-03-08 23:13:38,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:38,200 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 95 treesize of output 363 [2025-03-08 23:13:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2025-03-08 23:13:42,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103913407] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:13:42,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:13:42,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 24] total 67 [2025-03-08 23:13:42,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116575604] [2025-03-08 23:13:42,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:13:42,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-08 23:13:42,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:42,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-08 23:13:42,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=3721, Unknown=72, NotChecked=378, Total=4422 [2025-03-08 23:13:42,415 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 67 states, 67 states have (on average 1.9701492537313432) internal successors, (132), 67 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:13:56,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:56,151 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2025-03-08 23:13:56,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 23:13:56,155 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.9701492537313432) internal successors, (132), 67 states have internal predecessors, (132), 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 47 [2025-03-08 23:13:56,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:56,155 INFO L225 Difference]: With dead ends: 82 [2025-03-08 23:13:56,155 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 23:13:56,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1638 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=664, Invalid=6415, Unknown=73, NotChecked=504, Total=7656 [2025-03-08 23:13:56,157 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 61 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 1837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:56,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 938 Invalid, 1837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1661 Invalid, 0 Unknown, 138 Unchecked, 8.5s Time] [2025-03-08 23:13:56,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 23:13:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-08 23:13:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 81 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-03-08 23:13:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2025-03-08 23:13:56,159 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 47 [2025-03-08 23:13:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:56,159 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2025-03-08 23:13:56,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.9701492537313432) internal successors, (132), 67 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:13:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2025-03-08 23:13:56,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 23:13:56,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:56,160 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:56,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 23:13:56,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:56,360 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-08 23:13:56,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:56,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1115587906, now seen corresponding path program 1 times [2025-03-08 23:13:56,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:56,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306374192] [2025-03-08 23:13:56,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:56,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:56,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 23:13:56,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 23:13:56,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:56,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:57,610 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 23:13:57,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:57,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306374192] [2025-03-08 23:13:57,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306374192] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:57,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340942282] [2025-03-08 23:13:57,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:57,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:57,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:57,612 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:13:57,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 23:13:57,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 23:13:57,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 23:13:57,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:57,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:57,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-08 23:13:57,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:57,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:13:58,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 23:13:58,050 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:13:58,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 23:13:58,178 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 13 treesize of output 9 [2025-03-08 23:13:58,315 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 25 treesize of output 13 [2025-03-08 23:13:58,369 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 23:13:58,369 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2025-03-08 23:13:58,588 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 23:13:58,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 23:13:58,595 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 8 treesize of output 4 [2025-03-08 23:13:58,731 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 40 treesize of output 24 [2025-03-08 23:13:58,756 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 13 treesize of output 9 [2025-03-08 23:13:59,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2025-03-08 23:13:59,270 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 25 treesize of output 13 [2025-03-08 23:13:59,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2025-03-08 23:13:59,714 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 9 treesize of output 3 [2025-03-08 23:13:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 23:13:59,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:14:01,667 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (or (< 0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 1)) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int) (v_ArrVal_2172 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2172) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int) (v_ArrVal_2172 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2172) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (< (+ 3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (select |c_#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))) is different from false [2025-03-08 23:14:01,706 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int) (v_ArrVal_2172 (Array Int Int))) (or (< (+ 3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (select |c_#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2172) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (or (< 0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 1)) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int) (v_ArrVal_2172 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2172) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) is different from false [2025-03-08 23:14:02,045 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (or (< 0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 1)) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2170 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int) (v_ArrVal_2172 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2170 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2170)) (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2170) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2171) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2172) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (forall ((v_ArrVal_2170 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2170 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2170)) (forall ((v_ArrVal_2171 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int) (v_ArrVal_2172 (Array Int Int))) (or (< (+ 3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (select |c_#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2170) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2171) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2172) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))))) is different from false [2025-03-08 23:14:02,062 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 151 treesize of output 149 [2025-03-08 23:14:02,072 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 62 treesize of output 58 [2025-03-08 23:14:02,091 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 44 treesize of output 36 [2025-03-08 23:14:02,135 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 151 treesize of output 149 [2025-03-08 23:14:02,145 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 62 treesize of output 58 [2025-03-08 23:14:02,166 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 8 treesize of output 4 [2025-03-08 23:14:02,385 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 35 treesize of output 33 [2025-03-08 23:14:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 10 not checked. [2025-03-08 23:14:03,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340942282] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:14:03,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:14:03,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 51 [2025-03-08 23:14:03,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717803019] [2025-03-08 23:14:03,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:14:03,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-08 23:14:03,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:03,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-08 23:14:03,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2080, Unknown=13, NotChecked=282, Total=2550 [2025-03-08 23:14:03,211 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 51 states, 51 states have (on average 2.4313725490196076) internal successors, (124), 51 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:08,343 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2025-03-08 23:14:08,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 23:14:08,344 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.4313725490196076) internal successors, (124), 51 states have internal predecessors, (124), 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 48 [2025-03-08 23:14:08,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:08,344 INFO L225 Difference]: With dead ends: 81 [2025-03-08 23:14:08,344 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 23:14:08,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=367, Invalid=3537, Unknown=14, NotChecked=372, Total=4290 [2025-03-08 23:14:08,345 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 52 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:08,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 707 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1241 Invalid, 0 Unknown, 161 Unchecked, 3.0s Time] [2025-03-08 23:14:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 23:14:08,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-08 23:14:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.2) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:08,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2025-03-08 23:14:08,347 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 48 [2025-03-08 23:14:08,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:08,347 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2025-03-08 23:14:08,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.4313725490196076) internal successors, (124), 51 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:08,347 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2025-03-08 23:14:08,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 23:14:08,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:08,348 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:08,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0