./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.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 b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:53:45,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:53:45,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:53:45,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:53:45,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:53:45,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:53:45,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:53:45,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:53:45,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:53:45,362 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:53:45,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:53:45,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:53:45,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:53:45,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:53:45,363 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:53:45,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:53:45,363 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:53:45,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:53:45,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:53:45,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:53:45,364 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:53:45,364 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:53:45,364 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:53:45,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:53:45,364 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:53:45,364 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:53:45,364 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:53:45,364 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:53:45,364 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:53:45,364 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:53:45,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:53:45,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:53:45,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:53:45,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:53:45,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:53:45,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:53:45,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:53:45,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:53:45,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:53:45,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:53:45,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:53:45,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:53:45,366 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 -> b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d [2025-03-04 07:53:45,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:53:45,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:53:45,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:53:45,588 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:53:45,588 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:53:45,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2025-03-04 07:53:46,645 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34433dce1/1e5b92a898334cebb329386a9aab4060/FLAG6acf2f7f0 [2025-03-04 07:53:46,885 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:53:46,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2025-03-04 07:53:46,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34433dce1/1e5b92a898334cebb329386a9aab4060/FLAG6acf2f7f0 [2025-03-04 07:53:47,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34433dce1/1e5b92a898334cebb329386a9aab4060 [2025-03-04 07:53:47,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:53:47,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:53:47,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:53:47,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:53:47,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:53:47,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:53:47" (1/1) ... [2025-03-04 07:53:47,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a739258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:47, skipping insertion in model container [2025-03-04 07:53:47,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:53:47" (1/1) ... [2025-03-04 07:53:47,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:53:47,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:53:47,475 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:53:47,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:53:47,538 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:53:47,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:47 WrapperNode [2025-03-04 07:53:47,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:53:47,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:53:47,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:53:47,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:53:47,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:47" (1/1) ... [2025-03-04 07:53:47,557 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:47" (1/1) ... [2025-03-04 07:53:47,578 INFO L138 Inliner]: procedures = 119, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 106 [2025-03-04 07:53:47,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:53:47,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:53:47,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:53:47,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:53:47,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:47" (1/1) ... [2025-03-04 07:53:47,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:47" (1/1) ... [2025-03-04 07:53:47,589 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:47" (1/1) ... [2025-03-04 07:53:47,604 INFO L175 MemorySlicer]: Split 22 memory accesses to 2 slices as follows [2, 20]. 91 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-04 07:53:47,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:47" (1/1) ... [2025-03-04 07:53:47,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:47" (1/1) ... [2025-03-04 07:53:47,616 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:47" (1/1) ... [2025-03-04 07:53:47,617 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:47" (1/1) ... [2025-03-04 07:53:47,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:47" (1/1) ... [2025-03-04 07:53:47,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:47" (1/1) ... [2025-03-04 07:53:47,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:53:47,623 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:53:47,626 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:53:47,626 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:53:47,627 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:47" (1/1) ... [2025-03-04 07:53:47,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:53:47,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:53:47,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:53:47,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:53:47,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:53:47,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:53:47,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:53:47,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:53:47,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:53:47,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:53:47,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:53:47,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:53:47,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:53:47,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:53:47,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:53:47,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:53:47,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:53:47,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:53:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:53:47,764 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:53:47,766 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:53:48,054 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2025-03-04 07:53:48,054 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:53:48,066 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:53:48,066 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:53:48,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:53:48 BoogieIcfgContainer [2025-03-04 07:53:48,067 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:53:48,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:53:48,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:53:48,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:53:48,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:53:47" (1/3) ... [2025-03-04 07:53:48,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f67845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:53:48, skipping insertion in model container [2025-03-04 07:53:48,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:47" (2/3) ... [2025-03-04 07:53:48,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f67845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:53:48, skipping insertion in model container [2025-03-04 07:53:48,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:53:48" (3/3) ... [2025-03-04 07:53:48,073 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-1.i [2025-03-04 07:53:48,084 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:53:48,086 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-simple-white-blue-1.i that has 1 procedures, 101 locations, 1 initial locations, 6 loop locations, and 45 error locations. [2025-03-04 07:53:48,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:53:48,126 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;@74acfa23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:53:48,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2025-03-04 07:53:48,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 55 states have (on average 2.090909090909091) internal successors, (115), 100 states have internal predecessors, (115), 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-04 07:53:48,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:53:48,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:48,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:53:48,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:53:48,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:48,140 INFO L85 PathProgramCache]: Analyzing trace with hash 146931, now seen corresponding path program 1 times [2025-03-04 07:53:48,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:48,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133375702] [2025-03-04 07:53:48,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:48,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:48,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:53:48,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:53:48,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:48,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:48,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:48,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133375702] [2025-03-04 07:53:48,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133375702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:48,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:48,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:53:48,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837446356] [2025-03-04 07:53:48,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:48,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:53:48,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:48,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:53:48,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:53:48,321 INFO L87 Difference]: Start difference. First operand has 101 states, 55 states have (on average 2.090909090909091) internal successors, (115), 100 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:48,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:48,429 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2025-03-04 07:53:48,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:53:48,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 07:53:48,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:48,436 INFO L225 Difference]: With dead ends: 123 [2025-03-04 07:53:48,436 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 07:53:48,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:53:48,440 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 78 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:48,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 108 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:53:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 07:53:48,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 95. [2025-03-04 07:53:48,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 94 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:48,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2025-03-04 07:53:48,471 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 3 [2025-03-04 07:53:48,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:48,471 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2025-03-04 07:53:48,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:48,472 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2025-03-04 07:53:48,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:53:48,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:48,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:53:48,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:53:48,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:53:48,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:48,475 INFO L85 PathProgramCache]: Analyzing trace with hash 146932, now seen corresponding path program 1 times [2025-03-04 07:53:48,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:48,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969769249] [2025-03-04 07:53:48,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:48,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:48,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:53:48,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:53:48,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:48,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:48,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:48,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969769249] [2025-03-04 07:53:48,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969769249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:48,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:48,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:53:48,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327887827] [2025-03-04 07:53:48,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:48,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:53:48,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:48,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:53:48,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:53:48,589 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:48,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:48,683 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2025-03-04 07:53:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:53:48,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 07:53:48,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:48,684 INFO L225 Difference]: With dead ends: 119 [2025-03-04 07:53:48,684 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 07:53:48,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:53:48,684 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 78 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:48,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 104 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:53:48,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 07:53:48,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 93. [2025-03-04 07:53:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 92 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2025-03-04 07:53:48,695 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 3 [2025-03-04 07:53:48,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:48,695 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2025-03-04 07:53:48,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:48,695 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2025-03-04 07:53:48,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:53:48,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:48,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:48,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:53:48,696 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:53:48,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:48,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1814068694, now seen corresponding path program 1 times [2025-03-04 07:53:48,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:48,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221774352] [2025-03-04 07:53:48,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:48,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:48,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:53:48,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:53:48,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:48,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:48,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:48,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221774352] [2025-03-04 07:53:48,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221774352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:48,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:48,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:53:48,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161384191] [2025-03-04 07:53:48,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:48,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:53:48,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:48,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:53:48,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:53:48,859 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-04 07:53:49,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:49,007 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2025-03-04 07:53:49,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:53:49,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-03-04 07:53:49,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:49,008 INFO L225 Difference]: With dead ends: 90 [2025-03-04 07:53:49,010 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 07:53:49,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:53:49,010 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 98 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:49,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 40 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:53:49,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 07:53:49,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-03-04 07:53:49,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 87 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2025-03-04 07:53:49,019 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 8 [2025-03-04 07:53:49,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:49,019 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2025-03-04 07:53:49,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-04 07:53:49,019 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2025-03-04 07:53:49,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:53:49,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:49,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:49,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:53:49,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:53:49,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:49,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1814068695, now seen corresponding path program 1 times [2025-03-04 07:53:49,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:49,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917635155] [2025-03-04 07:53:49,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:49,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:49,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:53:49,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:53:49,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:49,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:49,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:49,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:49,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917635155] [2025-03-04 07:53:49,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917635155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:49,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:49,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:53:49,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408898043] [2025-03-04 07:53:49,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:49,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:53:49,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:49,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:53:49,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:53:49,224 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-04 07:53:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:49,392 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2025-03-04 07:53:49,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:53:49,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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 8 [2025-03-04 07:53:49,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:49,393 INFO L225 Difference]: With dead ends: 105 [2025-03-04 07:53:49,393 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 07:53:49,393 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-04 07:53:49,394 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 124 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:49,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 61 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:53:49,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 07:53:49,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2025-03-04 07:53:49,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 102 states have internal predecessors, (115), 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-04 07:53:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2025-03-04 07:53:49,398 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 8 [2025-03-04 07:53:49,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:49,398 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2025-03-04 07:53:49,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-04 07:53:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2025-03-04 07:53:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:53:49,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:49,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:49,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:53:49,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:53:49,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:49,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1233287312, now seen corresponding path program 1 times [2025-03-04 07:53:49,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:49,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062257485] [2025-03-04 07:53:49,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:49,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:49,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:53:49,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:53:49,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:49,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:49,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:49,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062257485] [2025-03-04 07:53:49,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062257485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:49,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:49,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:53:49,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092063394] [2025-03-04 07:53:49,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:49,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:53:49,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:49,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:53:49,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:53:49,504 INFO L87 Difference]: Start difference. First operand 103 states and 115 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-04 07:53:49,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:49,648 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2025-03-04 07:53:49,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:53:49,648 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-04 07:53:49,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:49,649 INFO L225 Difference]: With dead ends: 104 [2025-03-04 07:53:49,649 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 07:53:49,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:53:49,649 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 24 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:49,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 170 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:53:49,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 07:53:49,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2025-03-04 07:53:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4805194805194806) internal successors, (114), 101 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2025-03-04 07:53:49,658 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 12 [2025-03-04 07:53:49,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:49,658 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2025-03-04 07:53:49,658 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-04 07:53:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2025-03-04 07:53:49,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:53:49,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:49,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:49,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:53:49,662 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:53:49,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:49,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1233287313, now seen corresponding path program 1 times [2025-03-04 07:53:49,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:49,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983060873] [2025-03-04 07:53:49,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:49,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:49,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:53:49,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:53:49,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:49,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:49,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:49,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983060873] [2025-03-04 07:53:49,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983060873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:49,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:49,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:53:49,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878544771] [2025-03-04 07:53:49,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:49,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:53:49,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:49,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:53:49,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:53:49,815 INFO L87 Difference]: Start difference. First operand 102 states and 114 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-04 07:53:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:49,975 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2025-03-04 07:53:49,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:53:49,975 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-04 07:53:49,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:49,976 INFO L225 Difference]: With dead ends: 100 [2025-03-04 07:53:49,976 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 07:53:49,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:53:49,977 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 9 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:49,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 214 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:53:49,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 07:53:49,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2025-03-04 07:53:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 92 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-04 07:53:49,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2025-03-04 07:53:49,985 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 12 [2025-03-04 07:53:49,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:49,985 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2025-03-04 07:53:49,985 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-04 07:53:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2025-03-04 07:53:49,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:53:49,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:49,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:49,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:53:49,987 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:53:49,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:49,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1635962004, now seen corresponding path program 1 times [2025-03-04 07:53:49,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:49,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719508614] [2025-03-04 07:53:49,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:49,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:49,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:53:50,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:53:50,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:50,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:50,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:50,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719508614] [2025-03-04 07:53:50,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719508614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:50,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:50,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:53:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339994488] [2025-03-04 07:53:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:50,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:53:50,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:50,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:53:50,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:53:50,141 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-04 07:53:50,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:50,234 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2025-03-04 07:53:50,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:53:50,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2025-03-04 07:53:50,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:50,236 INFO L225 Difference]: With dead ends: 104 [2025-03-04 07:53:50,236 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 07:53:50,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:53:50,236 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 19 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:50,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 209 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:53:50,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 07:53:50,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2025-03-04 07:53:50,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.435897435897436) internal successors, (112), 98 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-04 07:53:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2025-03-04 07:53:50,243 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 15 [2025-03-04 07:53:50,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:50,245 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2025-03-04 07:53:50,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-04 07:53:50,245 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2025-03-04 07:53:50,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:53:50,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:50,245 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:50,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:53:50,245 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:53:50,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:50,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2116582951, now seen corresponding path program 1 times [2025-03-04 07:53:50,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:50,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097221200] [2025-03-04 07:53:50,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:50,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:50,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:53:50,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:53:50,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:50,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:50,497 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-04 07:53:50,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:50,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097221200] [2025-03-04 07:53:50,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097221200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:53:50,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98969688] [2025-03-04 07:53:50,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:50,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:50,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:53:50,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:53:50,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:53:50,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:53:50,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:53:50,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:50,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:50,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:53:50,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:53:50,587 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-04 07:53:50,601 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 25 treesize of output 13 [2025-03-04 07:53:50,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:50,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:53:50,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98969688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:50,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:53:50,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-03-04 07:53:50,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186646455] [2025-03-04 07:53:50,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:50,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:53:50,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:50,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:53:50,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:53:50,628 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-04 07:53:50,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:50,741 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2025-03-04 07:53:50,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:53:50,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-04 07:53:50,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:50,743 INFO L225 Difference]: With dead ends: 120 [2025-03-04 07:53:50,743 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 07:53:50,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:53:50,744 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 22 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:50,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 206 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:53:50,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 07:53:50,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2025-03-04 07:53:50,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 101 states have internal predecessors, (115), 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-04 07:53:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2025-03-04 07:53:50,752 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 18 [2025-03-04 07:53:50,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:50,753 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2025-03-04 07:53:50,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-04 07:53:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2025-03-04 07:53:50,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:53:50,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:50,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:50,759 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-04 07:53:50,953 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-04 07:53:50,954 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:53:50,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:50,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1190362184, now seen corresponding path program 1 times [2025-03-04 07:53:50,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:50,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051859744] [2025-03-04 07:53:50,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:50,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:50,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:53:50,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:53:50,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:50,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:51,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:51,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:51,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051859744] [2025-03-04 07:53:51,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051859744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:51,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:51,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:53:51,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314284250] [2025-03-04 07:53:51,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:51,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:53:51,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:51,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:53:51,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:53:51,125 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:51,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:51,331 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2025-03-04 07:53:51,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:53:51,331 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 07:53:51,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:51,332 INFO L225 Difference]: With dead ends: 121 [2025-03-04 07:53:51,332 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 07:53:51,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:53:51,332 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 198 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:51,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 100 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:53:51,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 07:53:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2025-03-04 07:53:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 102 states have internal predecessors, (117), 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-04 07:53:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2025-03-04 07:53:51,338 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 19 [2025-03-04 07:53:51,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:51,338 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2025-03-04 07:53:51,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2025-03-04 07:53:51,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:53:51,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:51,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:51,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:53:51,339 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:53:51,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:51,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1190362185, now seen corresponding path program 1 times [2025-03-04 07:53:51,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:51,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696288738] [2025-03-04 07:53:51,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:51,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:51,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:53:51,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:53:51,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:51,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:51,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:51,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696288738] [2025-03-04 07:53:51,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696288738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:51,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:51,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:53:51,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615349580] [2025-03-04 07:53:51,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:51,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:53:51,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:51,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:53:51,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:53:51,570 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:51,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:51,911 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2025-03-04 07:53:51,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:53:51,911 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 07:53:51,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:51,912 INFO L225 Difference]: With dead ends: 128 [2025-03-04 07:53:51,912 INFO L226 Difference]: Without dead ends: 128 [2025-03-04 07:53:51,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:53:51,913 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 158 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:51,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 193 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:53:51,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-04 07:53:51,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 105. [2025-03-04 07:53:51,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.4) internal successors, (119), 104 states have internal predecessors, (119), 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-04 07:53:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2025-03-04 07:53:51,917 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 19 [2025-03-04 07:53:51,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:51,917 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2025-03-04 07:53:51,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2025-03-04 07:53:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:53:51,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:51,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:51,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:53:51,918 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:53:51,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:51,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1753498109, now seen corresponding path program 1 times [2025-03-04 07:53:51,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:51,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84740704] [2025-03-04 07:53:51,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:51,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:51,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:53:51,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:53:51,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:51,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:51,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:51,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:51,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84740704] [2025-03-04 07:53:51,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84740704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:51,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:51,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:53:51,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661164076] [2025-03-04 07:53:51,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:51,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:53:51,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:51,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:53:51,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:53:51,964 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:52,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:52,033 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2025-03-04 07:53:52,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:53:52,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 07:53:52,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:52,035 INFO L225 Difference]: With dead ends: 110 [2025-03-04 07:53:52,035 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 07:53:52,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:53:52,036 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 103 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:52,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 85 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:53:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 07:53:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2025-03-04 07:53:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.388235294117647) internal successors, (118), 104 states have internal predecessors, (118), 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-04 07:53:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2025-03-04 07:53:52,040 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 20 [2025-03-04 07:53:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:52,041 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2025-03-04 07:53:52,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:52,041 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2025-03-04 07:53:52,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:53:52,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:52,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:52,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:53:52,043 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:53:52,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:52,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1825311874, now seen corresponding path program 1 times [2025-03-04 07:53:52,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:52,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456717517] [2025-03-04 07:53:52,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:52,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:52,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:53:52,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:53:52,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:52,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:52,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:52,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456717517] [2025-03-04 07:53:52,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456717517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:52,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:52,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 07:53:52,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503869629] [2025-03-04 07:53:52,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:52,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:53:52,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:52,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:53:52,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:53:52,325 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-04 07:53:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:52,634 INFO L93 Difference]: Finished difference Result 156 states and 172 transitions. [2025-03-04 07:53:52,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:53:52,635 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 07:53:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:52,635 INFO L225 Difference]: With dead ends: 156 [2025-03-04 07:53:52,635 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 07:53:52,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:53:52,636 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 113 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:52,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 332 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:53:52,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 07:53:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 116. [2025-03-04 07:53:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 115 states have internal predecessors, (130), 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-04 07:53:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2025-03-04 07:53:52,640 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 23 [2025-03-04 07:53:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:52,640 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2025-03-04 07:53:52,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-04 07:53:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2025-03-04 07:53:52,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:53:52,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:52,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:52,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:53:52,643 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:53:52,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:52,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1235522535, now seen corresponding path program 1 times [2025-03-04 07:53:52,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:52,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43094411] [2025-03-04 07:53:52,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:52,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:52,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:53:52,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:53:52,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:52,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:52,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:52,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43094411] [2025-03-04 07:53:52,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43094411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:52,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:52,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:53:52,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343078537] [2025-03-04 07:53:52,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:52,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:53:52,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:52,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:53:52,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:53:52,726 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:52,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:52,878 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2025-03-04 07:53:52,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:53:52,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 07:53:52,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:52,879 INFO L225 Difference]: With dead ends: 141 [2025-03-04 07:53:52,880 INFO L226 Difference]: Without dead ends: 141 [2025-03-04 07:53:52,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:53:52,881 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 159 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:52,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 207 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:53:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-04 07:53:52,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 116. [2025-03-04 07:53:52,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 115 states have internal predecessors, (128), 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-04 07:53:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2025-03-04 07:53:52,885 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 23 [2025-03-04 07:53:52,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:52,885 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2025-03-04 07:53:52,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:52,885 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2025-03-04 07:53:52,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:53:52,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:52,886 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:52,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:53:52,886 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:53:52,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:52,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1328621166, now seen corresponding path program 1 times [2025-03-04 07:53:52,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:52,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654381415] [2025-03-04 07:53:52,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:52,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:52,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:53:52,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:53:52,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:52,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:53,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:53,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:53,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654381415] [2025-03-04 07:53:53,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654381415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:53:53,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902886153] [2025-03-04 07:53:53,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:53,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:53,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:53:53,080 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:53:53,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:53:53,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:53:53,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:53:53,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:53,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:53,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 07:53:53,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:53:53,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:53:53,201 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 07:53:53,201 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-04 07:53:53,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:53:53,321 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:53:53,321 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 33 treesize of output 24 [2025-03-04 07:53:53,344 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:53:53,344 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 34 treesize of output 33 [2025-03-04 07:53:53,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:53:53,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:53,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:53:53,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:53,587 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 20 treesize of output 21 [2025-03-04 07:53:53,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:53,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2025-03-04 07:53:53,603 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 7 treesize of output 5 [2025-03-04 07:53:53,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:53,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902886153] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:53:53,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:53:53,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2025-03-04 07:53:53,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708012005] [2025-03-04 07:53:53,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:53:53,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 07:53:53,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:53,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 07:53:53,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=527, Unknown=18, NotChecked=0, Total=650 [2025-03-04 07:53:53,829 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 26 states have internal predecessors, (54), 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-04 07:53:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:54,607 INFO L93 Difference]: Finished difference Result 210 states and 237 transitions. [2025-03-04 07:53:54,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:53:54,607 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 07:53:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:54,608 INFO L225 Difference]: With dead ends: 210 [2025-03-04 07:53:54,608 INFO L226 Difference]: Without dead ends: 210 [2025-03-04 07:53:54,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=1088, Unknown=22, NotChecked=0, Total=1332 [2025-03-04 07:53:54,609 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 328 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:54,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 424 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:53:54,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-04 07:53:54,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 132. [2025-03-04 07:53:54,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 131 states have internal predecessors, (149), 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-04 07:53:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2025-03-04 07:53:54,611 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 23 [2025-03-04 07:53:54,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:54,612 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2025-03-04 07:53:54,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 26 states have internal predecessors, (54), 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-04 07:53:54,612 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2025-03-04 07:53:54,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:53:54,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:54,614 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:54,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:53:54,815 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,SelfDestructingSolverStorable13 [2025-03-04 07:53:54,815 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:53:54,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:54,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1328621167, now seen corresponding path program 1 times [2025-03-04 07:53:54,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:54,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666511025] [2025-03-04 07:53:54,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:54,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:54,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:53:54,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:53:54,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:54,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:55,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:55,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:55,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666511025] [2025-03-04 07:53:55,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666511025] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:53:55,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537075418] [2025-03-04 07:53:55,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:55,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:55,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:53:55,076 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:53:55,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:53:55,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:53:55,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:53:55,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:55,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:55,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 07:53:55,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:53:55,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-04 07:53:55,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:53:55,181 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:53:55,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:53:55,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:53:55,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:53:55,307 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:53:55,307 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 33 treesize of output 24 [2025-03-04 07:53:55,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:53:55,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 16 treesize of output 11 [2025-03-04 07:53:55,328 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:53:55,329 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-04 07:53:55,335 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-04 07:53:55,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:53:55,435 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 7 treesize of output 3 [2025-03-04 07:53:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:55,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:53:55,594 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_443 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_444) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_443) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_444 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_444) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2025-03-04 07:53:55,607 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_443 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_444) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_443) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_444 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_444) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2025-03-04 07:53:55,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:55,667 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 18 treesize of output 19 [2025-03-04 07:53:55,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:55,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2025-03-04 07:53:55,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-04 07:53:55,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:55,691 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 37 treesize of output 38 [2025-03-04 07:53:55,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:55,696 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 29 treesize of output 30 [2025-03-04 07:53:55,698 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:53:55,700 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-03-04 07:53:55,702 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:53:55,703 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-04 07:53:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:55,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537075418] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:53:55,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:53:55,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2025-03-04 07:53:55,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423021951] [2025-03-04 07:53:55,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:53:55,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 07:53:55,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:55,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 07:53:55,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=656, Unknown=12, NotChecked=106, Total=870 [2025-03-04 07:53:55,791 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 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-04 07:53:56,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:56,720 INFO L93 Difference]: Finished difference Result 171 states and 192 transitions. [2025-03-04 07:53:56,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:53:56,720 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 07:53:56,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:56,721 INFO L225 Difference]: With dead ends: 171 [2025-03-04 07:53:56,721 INFO L226 Difference]: Without dead ends: 171 [2025-03-04 07:53:56,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=255, Invalid=1461, Unknown=14, NotChecked=162, Total=1892 [2025-03-04 07:53:56,722 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 274 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 316 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:56,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 598 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1121 Invalid, 0 Unknown, 316 Unchecked, 0.6s Time] [2025-03-04 07:53:56,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-04 07:53:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 126. [2025-03-04 07:53:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 109 states have (on average 1.3027522935779816) internal successors, (142), 125 states have internal predecessors, (142), 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-04 07:53:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2025-03-04 07:53:56,725 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 23 [2025-03-04 07:53:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:56,725 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2025-03-04 07:53:56,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 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-04 07:53:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2025-03-04 07:53:56,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:53:56,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:56,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:56,733 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-04 07:53:56,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:56,929 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:53:56,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:56,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1613611563, now seen corresponding path program 1 times [2025-03-04 07:53:56,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:56,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27185496] [2025-03-04 07:53:56,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:56,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:56,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:53:56,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:53:56,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:56,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:57,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:57,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27185496] [2025-03-04 07:53:57,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27185496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:57,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:57,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:53:57,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752250603] [2025-03-04 07:53:57,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:57,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:53:57,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:57,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:53:57,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:53:57,093 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:57,242 INFO L93 Difference]: Finished difference Result 170 states and 190 transitions. [2025-03-04 07:53:57,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:53:57,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-04 07:53:57,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:57,244 INFO L225 Difference]: With dead ends: 170 [2025-03-04 07:53:57,244 INFO L226 Difference]: Without dead ends: 170 [2025-03-04 07:53:57,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:53:57,245 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 109 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:57,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 231 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:53:57,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-04 07:53:57,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 139. [2025-03-04 07:53:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 138 states have internal predecessors, (157), 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-04 07:53:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2025-03-04 07:53:57,249 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 24 [2025-03-04 07:53:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:57,249 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2025-03-04 07:53:57,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2025-03-04 07:53:57,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:53:57,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:57,250 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:57,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:53:57,250 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:53:57,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:57,250 INFO L85 PathProgramCache]: Analyzing trace with hash 750709621, now seen corresponding path program 1 times [2025-03-04 07:53:57,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:57,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118156248] [2025-03-04 07:53:57,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:57,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:57,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:53:57,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:53:57,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:57,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:57,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:57,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118156248] [2025-03-04 07:53:57,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118156248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:53:57,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426198336] [2025-03-04 07:53:57,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:57,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:57,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:53:57,473 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:53:57,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:53:57,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:53:57,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:53:57,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:57,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:57,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 07:53:57,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:53:57,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:53:57,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:53:57,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:53:57,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:53:57,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:53:57,686 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:53:57,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:53:57,710 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 16 treesize of output 11 [2025-03-04 07:53:57,714 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 16 treesize of output 11 [2025-03-04 07:53:57,727 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 22 [2025-03-04 07:53:57,734 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 15 [2025-03-04 07:53:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:57,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:53:58,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:58,260 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 13 treesize of output 17 [2025-03-04 07:53:58,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:58,270 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 13 treesize of output 17 [2025-03-04 07:53:58,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2025-03-04 07:53:58,709 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:53:58,711 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 19 treesize of output 17 [2025-03-04 07:53:58,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:58,717 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 20 [2025-03-04 07:53:58,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:58,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2025-03-04 07:53:58,748 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:53:58,754 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:53:58,754 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 16 treesize of output 11 [2025-03-04 07:53:58,759 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-04 07:53:58,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:58,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426198336] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:53:58,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:53:58,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 13] total 26 [2025-03-04 07:53:58,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207162773] [2025-03-04 07:53:58,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:53:58,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 07:53:58,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:58,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 07:53:58,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=581, Unknown=3, NotChecked=0, Total=650 [2025-03-04 07:53:58,811 INFO L87 Difference]: Start difference. First operand 139 states and 157 transitions. Second operand has 26 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 26 states have internal predecessors, (64), 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-04 07:53:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:59,506 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2025-03-04 07:53:59,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:53:59,507 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 26 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-04 07:53:59,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:59,507 INFO L225 Difference]: With dead ends: 161 [2025-03-04 07:53:59,507 INFO L226 Difference]: Without dead ends: 161 [2025-03-04 07:53:59,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=988, Unknown=3, NotChecked=0, Total=1122 [2025-03-04 07:53:59,508 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 161 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:59,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 561 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:53:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-04 07:53:59,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 142. [2025-03-04 07:53:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 125 states have (on average 1.28) internal successors, (160), 141 states have internal predecessors, (160), 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-04 07:53:59,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2025-03-04 07:53:59,511 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 24 [2025-03-04 07:53:59,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:59,511 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2025-03-04 07:53:59,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 26 states have internal predecessors, (64), 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-04 07:53:59,511 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2025-03-04 07:53:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:53:59,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:59,511 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:59,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:53:59,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 07:53:59,716 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:53:59,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:59,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1518449242, now seen corresponding path program 1 times [2025-03-04 07:53:59,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:59,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16444651] [2025-03-04 07:53:59,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:59,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:59,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:53:59,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:53:59,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:59,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:59,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:59,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16444651] [2025-03-04 07:53:59,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16444651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:59,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:59,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 07:53:59,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223792571] [2025-03-04 07:53:59,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:59,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:53:59,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:59,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:53:59,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:53:59,891 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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-04 07:54:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:00,149 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2025-03-04 07:54:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:54:00,150 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-04 07:54:00,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:00,150 INFO L225 Difference]: With dead ends: 160 [2025-03-04 07:54:00,151 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 07:54:00,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:54:00,151 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 31 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:00,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 287 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:54:00,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 07:54:00,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2025-03-04 07:54:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 137 states have (on average 1.2554744525547445) internal successors, (172), 153 states have internal predecessors, (172), 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-04 07:54:00,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 172 transitions. [2025-03-04 07:54:00,155 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 172 transitions. Word has length 25 [2025-03-04 07:54:00,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:00,155 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 172 transitions. [2025-03-04 07:54:00,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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-04 07:54:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 172 transitions. [2025-03-04 07:54:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:54:00,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:00,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:00,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:54:00,156 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:00,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:00,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1889182868, now seen corresponding path program 1 times [2025-03-04 07:54:00,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:00,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175962649] [2025-03-04 07:54:00,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:00,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:00,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:54:00,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:54:00,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:00,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:54:00,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:54:00,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175962649] [2025-03-04 07:54:00,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175962649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:00,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:00,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:54:00,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322969233] [2025-03-04 07:54:00,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:00,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:54:00,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:54:00,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:54:00,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:54:00,203 INFO L87 Difference]: Start difference. First operand 154 states and 172 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-04 07:54:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:00,273 INFO L93 Difference]: Finished difference Result 156 states and 174 transitions. [2025-03-04 07:54:00,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:54:00,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2025-03-04 07:54:00,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:00,274 INFO L225 Difference]: With dead ends: 156 [2025-03-04 07:54:00,274 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 07:54:00,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:54:00,274 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 92 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:00,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 76 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:54:00,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 07:54:00,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2025-03-04 07:54:00,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 138 states have (on average 1.2536231884057971) internal successors, (173), 154 states have internal predecessors, (173), 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-04 07:54:00,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2025-03-04 07:54:00,277 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 28 [2025-03-04 07:54:00,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:00,277 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2025-03-04 07:54:00,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-04 07:54:00,277 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2025-03-04 07:54:00,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:54:00,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:00,277 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:00,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 07:54:00,277 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:00,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:00,279 INFO L85 PathProgramCache]: Analyzing trace with hash 508395693, now seen corresponding path program 2 times [2025-03-04 07:54:00,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:00,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579552348] [2025-03-04 07:54:00,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:54:00,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:00,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 07:54:00,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:54:00,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:54:00,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:00,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:54:00,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579552348] [2025-03-04 07:54:00,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579552348] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:54:00,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664281536] [2025-03-04 07:54:00,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:54:00,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:00,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:00,540 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:00,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:54:00,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 07:54:00,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:54:00,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:54:00,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:00,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-04 07:54:00,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:00,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:54:00,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:54:00,770 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:54:00,770 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 16 treesize of output 15 [2025-03-04 07:54:00,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-04 07:54:00,785 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:54:00,786 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 16 treesize of output 15 [2025-03-04 07:54:00,820 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-04 07:54:00,821 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 23 treesize of output 26 [2025-03-04 07:54:00,832 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-04 07:54:00,832 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 23 treesize of output 26 [2025-03-04 07:54:01,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:01,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:54:01,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:01,337 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 95 treesize of output 89 [2025-03-04 07:54:02,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:02,013 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 91 treesize of output 75 [2025-03-04 07:54:02,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:02,019 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 43 treesize of output 36 [2025-03-04 07:54:02,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:02,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 196 treesize of output 181 [2025-03-04 07:54:02,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:02,064 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 238 treesize of output 217 [2025-03-04 07:54:02,075 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 246 treesize of output 232 [2025-03-04 07:54:02,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:02,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 185 treesize of output 247 [2025-03-04 07:54:06,597 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 07:54:06,597 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 54 treesize of output 1 [2025-03-04 07:54:06,601 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 07:54:06,601 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 73 treesize of output 1 [2025-03-04 07:54:06,608 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 07:54:06,608 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 70 treesize of output 1 [2025-03-04 07:54:06,641 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:06,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664281536] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:54:06,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:54:06,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 37 [2025-03-04 07:54:06,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583315806] [2025-03-04 07:54:06,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:54:06,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 07:54:06,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:54:06,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 07:54:06,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1167, Unknown=25, NotChecked=0, Total=1332 [2025-03-04 07:54:06,642 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand has 37 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 37 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-04 07:54:06,916 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_682 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_682 |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (forall ((v_arrayElimArr_8 (Array Int Int))) (or (= (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1) 0) (not (= (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) (= .cse1 0))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_ArrVal_682 (Array Int Int))) (or (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_682 |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (select (select .cse2 .cse3) (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0) (= .cse3 0) (not (= (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~x~0#1.offset|) 0))))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_ArrVal_682 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_682 |c_ULTIMATE.start_main_~x~0#1.offset| 0)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (forall ((v_arrayElimArr_8 (Array Int Int))) (or (= (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_8))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse5) 0) (not (= (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) (= .cse5 0)))) (forall ((v_ArrVal_682 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_8))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (select (select .cse6 .cse7) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_682 |c_ULTIMATE.start_main_~x~0#1.offset| 0)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (= .cse7 0) (not (= (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))))))) (let ((.cse8 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) 0) 0)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) 0))) (or (and .cse8 (= .cse9 0)) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse9) 0) 0) .cse8 (= (select (select |c_#memory_$Pointer$#1.offset| .cse9) 0) 0))))) is different from false [2025-03-04 07:54:07,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse12 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse6 (select .cse12 |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse7 (select .cse13 |c_ULTIMATE.start_main_~head~0#1.offset|))) (and (forall ((v_ArrVal_682 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_682 |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (forall ((v_arrayElimArr_8 (Array Int Int))) (or (= (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1) 0) (not (= (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) (= .cse1 0))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_ArrVal_682 (Array Int Int))) (or (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_682 |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (select (select .cse2 .cse3) (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0) (= .cse3 0) (not (= (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~x~0#1.offset|) 0))))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_ArrVal_682 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_682 |c_ULTIMATE.start_main_~x~0#1.offset| 0)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (forall ((v_arrayElimArr_8 (Array Int Int))) (or (= (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_8))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse5) 0) (not (= (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) (= .cse5 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7) 0) (forall ((v_ArrVal_682 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_8))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (select (select .cse8 .cse9) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_682 |c_ULTIMATE.start_main_~x~0#1.offset| 0)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (= .cse9 0) (not (= (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))))))) (= (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse7) 0) (let ((.cse10 (= (select .cse13 0) 0)) (.cse11 (select .cse12 0))) (or (and .cse10 (= .cse11 0)) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse11) 0) 0) .cse10 (= (select (select |c_#memory_$Pointer$#1.offset| .cse11) 0) 0))))))) is different from false [2025-03-04 07:54:09,081 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_682 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_682 |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (forall ((v_arrayElimArr_8 (Array Int Int))) (or (= (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1) 0) (not (= (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) (= .cse1 0))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_ArrVal_682 (Array Int Int))) (or (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_682 |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (select (select .cse2 .cse3) (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0) (= .cse3 0) (not (= (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~x~0#1.offset|) 0))))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_ArrVal_682 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_682 |c_ULTIMATE.start_main_~x~0#1.offset| 0)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (forall ((v_arrayElimArr_8 (Array Int Int))) (or (= (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_8))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse5) 0) (not (= (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) (= .cse5 0)))) (forall ((v_ArrVal_682 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_8))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (select (select .cse6 .cse7) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_682 |c_ULTIMATE.start_main_~x~0#1.offset| 0)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (= .cse7 0) (not (= (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~x~0#1.offset|) 0))))))))) is different from false [2025-03-04 07:54:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:09,669 INFO L93 Difference]: Finished difference Result 199 states and 218 transitions. [2025-03-04 07:54:09,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 07:54:09,670 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 37 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) Word has length 28 [2025-03-04 07:54:09,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:09,670 INFO L225 Difference]: With dead ends: 199 [2025-03-04 07:54:09,670 INFO L226 Difference]: Without dead ends: 199 [2025-03-04 07:54:09,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=475, Invalid=2589, Unknown=28, NotChecked=330, Total=3422 [2025-03-04 07:54:09,671 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 402 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 71 mSolverCounterUnsat, 214 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 214 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:09,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 783 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1321 Invalid, 214 Unknown, 108 Unchecked, 1.7s Time] [2025-03-04 07:54:09,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-04 07:54:09,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 154. [2025-03-04 07:54:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 137 states have (on average 1.2408759124087592) internal successors, (170), 153 states have internal predecessors, (170), 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-04 07:54:09,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 170 transitions. [2025-03-04 07:54:09,677 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 170 transitions. Word has length 28 [2025-03-04 07:54:09,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:09,677 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 170 transitions. [2025-03-04 07:54:09,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 37 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-04 07:54:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 170 transitions. [2025-03-04 07:54:09,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:54:09,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:09,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:09,684 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-04 07:54:09,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:09,883 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:09,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:09,883 INFO L85 PathProgramCache]: Analyzing trace with hash -604652049, now seen corresponding path program 1 times [2025-03-04 07:54:09,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:09,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774174027] [2025-03-04 07:54:09,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:09,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:09,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:54:09,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:54:09,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:09,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:54:09,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:54:09,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774174027] [2025-03-04 07:54:09,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774174027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:54:09,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178884941] [2025-03-04 07:54:09,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:09,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:09,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:09,965 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:09,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:54:10,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:54:10,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:54:10,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:10,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:10,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 07:54:10,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:10,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:54:10,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:10,111 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 16 treesize of output 16 [2025-03-04 07:54:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:54:10,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:54:10,209 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 11 treesize of output 9 [2025-03-04 07:54:10,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-04 07:54:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:54:10,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178884941] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:54:10,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:54:10,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 16 [2025-03-04 07:54:10,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470466504] [2025-03-04 07:54:10,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:54:10,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 07:54:10,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:54:10,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 07:54:10,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:54:10,224 INFO L87 Difference]: Start difference. First operand 154 states and 170 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 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-04 07:54:10,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:10,510 INFO L93 Difference]: Finished difference Result 183 states and 201 transitions. [2025-03-04 07:54:10,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:54:10,511 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 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 31 [2025-03-04 07:54:10,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:10,515 INFO L225 Difference]: With dead ends: 183 [2025-03-04 07:54:10,515 INFO L226 Difference]: Without dead ends: 183 [2025-03-04 07:54:10,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:54:10,515 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 151 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:10,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 423 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:54:10,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-04 07:54:10,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 167. [2025-03-04 07:54:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 166 states have internal predecessors, (188), 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-04 07:54:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 188 transitions. [2025-03-04 07:54:10,518 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 188 transitions. Word has length 31 [2025-03-04 07:54:10,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:10,518 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 188 transitions. [2025-03-04 07:54:10,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 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-04 07:54:10,518 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 188 transitions. [2025-03-04 07:54:10,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:54:10,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:10,518 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:10,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 07:54:10,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:10,719 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:10,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:10,720 INFO L85 PathProgramCache]: Analyzing trace with hash -604651697, now seen corresponding path program 1 times [2025-03-04 07:54:10,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:10,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217832758] [2025-03-04 07:54:10,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:10,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:10,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:54:10,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:54:10,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:10,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:10,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:54:10,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217832758] [2025-03-04 07:54:10,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217832758] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:54:10,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770745651] [2025-03-04 07:54:10,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:10,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:10,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:10,940 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:10,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:54:11,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:54:11,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:54:11,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:11,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:11,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 07:54:11,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:11,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:54:11,035 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:54:11,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:54:11,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:54:11,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:11,199 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 25 treesize of output 21 [2025-03-04 07:54:11,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:54:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:11,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:54:11,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:11,356 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 25 treesize of output 29 [2025-03-04 07:54:11,431 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 11 treesize of output 9 [2025-03-04 07:54:11,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-04 07:54:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:11,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770745651] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:54:11,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:54:11,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 33 [2025-03-04 07:54:11,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961313078] [2025-03-04 07:54:11,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:54:11,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 07:54:11,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:54:11,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 07:54:11,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 07:54:11,461 INFO L87 Difference]: Start difference. First operand 167 states and 188 transitions. Second operand has 34 states, 33 states have (on average 2.121212121212121) internal successors, (70), 34 states have internal predecessors, (70), 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-04 07:54:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:11,950 INFO L93 Difference]: Finished difference Result 185 states and 202 transitions. [2025-03-04 07:54:11,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:54:11,951 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.121212121212121) internal successors, (70), 34 states have internal predecessors, (70), 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 31 [2025-03-04 07:54:11,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:11,951 INFO L225 Difference]: With dead ends: 185 [2025-03-04 07:54:11,951 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 07:54:11,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=246, Invalid=1734, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 07:54:11,953 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 254 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:11,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 424 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:54:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 07:54:11,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2025-03-04 07:54:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 151 states have (on average 1.2582781456953642) internal successors, (190), 167 states have internal predecessors, (190), 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-04 07:54:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 190 transitions. [2025-03-04 07:54:11,955 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 190 transitions. Word has length 31 [2025-03-04 07:54:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:11,956 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 190 transitions. [2025-03-04 07:54:11,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.121212121212121) internal successors, (70), 34 states have internal predecessors, (70), 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-04 07:54:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 190 transitions. [2025-03-04 07:54:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:54:11,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:11,956 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:11,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:54:12,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:12,157 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:12,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:12,157 INFO L85 PathProgramCache]: Analyzing trace with hash -604651696, now seen corresponding path program 1 times [2025-03-04 07:54:12,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:12,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340250401] [2025-03-04 07:54:12,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:12,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:12,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:54:12,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:54:12,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:12,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:12,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:54:12,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340250401] [2025-03-04 07:54:12,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340250401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:54:12,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123483313] [2025-03-04 07:54:12,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:12,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:12,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:12,302 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:12,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:54:12,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:54:12,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:54:12,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:12,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:12,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 07:54:12,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:12,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:54:12,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:54:12,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:12,598 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 15 treesize of output 15 [2025-03-04 07:54:12,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:12,605 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 17 treesize of output 17 [2025-03-04 07:54:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:12,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:54:12,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:12,905 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 29 treesize of output 33 [2025-03-04 07:54:13,069 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 10 treesize of output 8 [2025-03-04 07:54:13,070 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 14 treesize of output 12 [2025-03-04 07:54:13,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:13,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123483313] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:54:13,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:54:13,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 37 [2025-03-04 07:54:13,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14559490] [2025-03-04 07:54:13,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:54:13,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-04 07:54:13,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:54:13,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 07:54:13,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 07:54:13,136 INFO L87 Difference]: Start difference. First operand 168 states and 190 transitions. Second operand has 38 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 38 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:14,427 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2025-03-04 07:54:14,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 07:54:14,427 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 38 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-04 07:54:14,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:14,428 INFO L225 Difference]: With dead ends: 218 [2025-03-04 07:54:14,428 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 07:54:14,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=486, Invalid=4070, Unknown=0, NotChecked=0, Total=4556 [2025-03-04 07:54:14,430 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 471 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:14,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 763 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 07:54:14,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 07:54:14,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 185. [2025-03-04 07:54:14,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 168 states have (on average 1.2738095238095237) internal successors, (214), 184 states have internal predecessors, (214), 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-04 07:54:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 214 transitions. [2025-03-04 07:54:14,433 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 214 transitions. Word has length 31 [2025-03-04 07:54:14,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:14,433 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 214 transitions. [2025-03-04 07:54:14,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 38 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:14,433 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 214 transitions. [2025-03-04 07:54:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:54:14,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:14,433 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:14,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 07:54:14,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 07:54:14,634 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:14,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:14,634 INFO L85 PathProgramCache]: Analyzing trace with hash -648549284, now seen corresponding path program 1 times [2025-03-04 07:54:14,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:14,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822530883] [2025-03-04 07:54:14,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:14,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:14,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:54:14,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:54:14,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:14,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:15,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:15,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:54:15,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822530883] [2025-03-04 07:54:15,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822530883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:54:15,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620098611] [2025-03-04 07:54:15,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:15,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:15,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:15,008 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:15,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:54:15,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:54:15,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:54:15,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:15,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:15,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-04 07:54:15,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:15,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:54:15,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:54:15,139 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:54:15,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:54:15,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:54:15,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:54:15,178 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-04 07:54:15,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-04 07:54:15,222 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 16 treesize of output 11 [2025-03-04 07:54:15,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:54:15,244 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:54:15,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:54:15,249 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 16 treesize of output 11 [2025-03-04 07:54:15,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:54:15,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:54:15,261 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-04 07:54:15,312 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-04 07:54:15,315 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 7 treesize of output 3 [2025-03-04 07:54:15,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:15,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:54:15,398 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array Int Int))) (not (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 1))) is different from false [2025-03-04 07:54:15,431 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_143| Int) (v_ArrVal_973 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_973) |v_ULTIMATE.start_main_~x~0#1.base_143| v_ArrVal_975) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_143|) 0)))) is different from false [2025-03-04 07:54:15,503 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:54:15,504 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 13 treesize of output 12 [2025-03-04 07:54:15,619 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_143| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_126| Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_24| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|) 0)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_126|) (not (= v_ArrVal_969 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_126| (select v_ArrVal_969 |v_ULTIMATE.start_main_~x~0#1.offset_126|)))) (not (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_969) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_973) |v_ULTIMATE.start_main_~x~0#1.base_143| v_ArrVal_975) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 1)) (= |v_ULTIMATE.start_main_~x~0#1.base_143| |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2025-03-04 07:54:15,625 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:54:15,627 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 43 treesize of output 41 [2025-03-04 07:54:15,630 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 26 treesize of output 22 [2025-03-04 07:54:15,633 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:54:15,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:15,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620098611] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:54:15,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:54:15,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 36 [2025-03-04 07:54:15,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065105258] [2025-03-04 07:54:15,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:54:15,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 07:54:15,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:54:15,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 07:54:15,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=892, Unknown=38, NotChecked=192, Total=1260 [2025-03-04 07:54:15,657 INFO L87 Difference]: Start difference. First operand 185 states and 214 transitions. Second operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 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-04 07:54:16,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:16,311 INFO L93 Difference]: Finished difference Result 236 states and 262 transitions. [2025-03-04 07:54:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 07:54:16,312 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 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) Word has length 31 [2025-03-04 07:54:16,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:16,312 INFO L225 Difference]: With dead ends: 236 [2025-03-04 07:54:16,312 INFO L226 Difference]: Without dead ends: 236 [2025-03-04 07:54:16,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=255, Invalid=1516, Unknown=47, NotChecked=252, Total=2070 [2025-03-04 07:54:16,313 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 299 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 455 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:16,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 714 Invalid, 1626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1104 Invalid, 0 Unknown, 455 Unchecked, 0.5s Time] [2025-03-04 07:54:16,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-04 07:54:16,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 196. [2025-03-04 07:54:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 179 states have (on average 1.2569832402234637) internal successors, (225), 195 states have internal predecessors, (225), 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-04 07:54:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 225 transitions. [2025-03-04 07:54:16,316 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 225 transitions. Word has length 31 [2025-03-04 07:54:16,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:16,316 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 225 transitions. [2025-03-04 07:54:16,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 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-04 07:54:16,317 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 225 transitions. [2025-03-04 07:54:16,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:54:16,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:16,317 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:16,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 07:54:16,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 07:54:16,518 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:16,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:16,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1145239992, now seen corresponding path program 3 times [2025-03-04 07:54:16,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:16,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139696778] [2025-03-04 07:54:16,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:54:16,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:16,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-03-04 07:54:16,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:54:16,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:54:16,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:16,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:54:16,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139696778] [2025-03-04 07:54:16,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139696778] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:54:16,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649841841] [2025-03-04 07:54:16,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:54:16,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:16,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:16,800 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:16,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:54:16,869 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-03-04 07:54:16,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:54:16,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:54:16,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:16,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 07:54:16,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:16,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:54:16,976 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:54:16,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:54:16,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:54:17,087 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:54:17,088 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 24 treesize of output 17 [2025-03-04 07:54:17,103 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:54:17,103 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 24 treesize of output 17 [2025-03-04 07:54:17,118 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:54:17,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:54:17,154 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-03-04 07:54:17,154 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 31 treesize of output 15 [2025-03-04 07:54:17,246 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-03-04 07:54:17,246 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 3 case distinctions, treesize of input 49 treesize of output 44 [2025-03-04 07:54:17,252 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 12 treesize of output 8 [2025-03-04 07:54:17,299 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-03-04 07:54:17,299 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 3 case distinctions, treesize of input 58 treesize of output 51 [2025-03-04 07:54:17,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:54:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:17,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:54:17,487 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2025-03-04 07:54:17,488 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 27 treesize of output 26 [2025-03-04 07:54:17,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:17,567 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 16 treesize of output 20 [2025-03-04 07:54:17,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:17,675 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 23 treesize of output 24 [2025-03-04 07:54:17,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:17,681 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 68 treesize of output 71 [2025-03-04 07:54:17,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:17,686 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 64 treesize of output 60 [2025-03-04 07:54:17,693 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:54:17,693 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 13 treesize of output 12 [2025-03-04 07:54:17,697 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 46 treesize of output 42 [2025-03-04 07:54:18,908 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:18,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649841841] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:54:18,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:54:18,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 38 [2025-03-04 07:54:18,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815473691] [2025-03-04 07:54:18,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:54:18,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-04 07:54:18,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:54:18,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-04 07:54:18,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1282, Unknown=39, NotChecked=0, Total=1482 [2025-03-04 07:54:18,909 INFO L87 Difference]: Start difference. First operand 196 states and 225 transitions. Second operand has 39 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 39 states have internal predecessors, (79), 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-04 07:54:19,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:19,951 INFO L93 Difference]: Finished difference Result 245 states and 277 transitions. [2025-03-04 07:54:19,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 07:54:19,952 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 39 states have internal predecessors, (79), 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 31 [2025-03-04 07:54:19,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:19,952 INFO L225 Difference]: With dead ends: 245 [2025-03-04 07:54:19,952 INFO L226 Difference]: Without dead ends: 245 [2025-03-04 07:54:19,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=394, Invalid=2646, Unknown=40, NotChecked=0, Total=3080 [2025-03-04 07:54:19,953 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 349 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 1726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:19,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 691 Invalid, 1726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 07:54:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-04 07:54:19,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 212. [2025-03-04 07:54:19,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 195 states have (on average 1.2615384615384615) internal successors, (246), 211 states have internal predecessors, (246), 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-04 07:54:19,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 246 transitions. [2025-03-04 07:54:19,960 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 246 transitions. Word has length 31 [2025-03-04 07:54:19,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:19,961 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 246 transitions. [2025-03-04 07:54:19,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 39 states have internal predecessors, (79), 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-04 07:54:19,961 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 246 transitions. [2025-03-04 07:54:19,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:54:19,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:19,962 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:19,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 07:54:20,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 07:54:20,166 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:20,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1145239991, now seen corresponding path program 2 times [2025-03-04 07:54:20,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:20,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984503896] [2025-03-04 07:54:20,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:54:20,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:20,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 07:54:20,178 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:54:20,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:54:20,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:20,569 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:20,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:54:20,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984503896] [2025-03-04 07:54:20,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984503896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:54:20,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239238407] [2025-03-04 07:54:20,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:54:20,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:20,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:20,571 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:20,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:54:20,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 07:54:20,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:54:20,661 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:54:20,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:20,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-04 07:54:20,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:20,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:54:20,716 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:54:20,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:54:20,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:54:20,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:54:20,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:54:20,867 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:54:20,867 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 33 treesize of output 24 [2025-03-04 07:54:20,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:54:20,879 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 16 treesize of output 11 [2025-03-04 07:54:20,922 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:54:20,922 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 33 treesize of output 24 [2025-03-04 07:54:20,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:54:20,931 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 16 treesize of output 11 [2025-03-04 07:54:20,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:54:20,959 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 07:54:20,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-04 07:54:20,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2025-03-04 07:54:21,003 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-04 07:54:21,003 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-04 07:54:21,015 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-03-04 07:54:21,015 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 1 case distinctions, treesize of input 40 treesize of output 20 [2025-03-04 07:54:21,173 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-03-04 07:54:21,173 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 3 case distinctions, treesize of input 76 treesize of output 57 [2025-03-04 07:54:21,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:54:21,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:54:21,177 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 27 treesize of output 25 [2025-03-04 07:54:21,202 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 07:54:21,202 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 81 [2025-03-04 07:54:21,207 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 46 treesize of output 40 [2025-03-04 07:54:21,382 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 07:54:21,383 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 38 [2025-03-04 07:54:21,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 07:54:21,428 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:21,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:54:21,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:21,563 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 13 treesize of output 17 [2025-03-04 07:54:21,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:21,568 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 24 treesize of output 28 [2025-03-04 07:54:21,630 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (or (not (= (select v_arrayElimArr_17 |c_ULTIMATE.start_main_#t~mem4#1.offset|) 0)) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1220) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimArr_16 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_16) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1)) (not (= (select v_arrayElimArr_16 |c_ULTIMATE.start_main_#t~mem4#1.offset|) 0))))) is different from false [2025-03-04 07:54:21,639 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (or (< (+ 3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1220) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_arrayElimArr_17 .cse1) 0)))) (forall ((v_arrayElimArr_16 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_16 .cse1))) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_16) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1)))))) is different from false [2025-03-04 07:54:21,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:21,858 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 18 treesize of output 22 [2025-03-04 07:54:21,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:21,867 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 36 treesize of output 40 [2025-03-04 07:54:21,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:21,870 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 39 treesize of output 43 [2025-03-04 07:54:28,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:28,021 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 116 treesize of output 109 [2025-03-04 07:54:28,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:28,029 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 100 treesize of output 101 [2025-03-04 07:54:28,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:28,039 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 358 treesize of output 357 [2025-03-04 07:54:28,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:28,055 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 620 treesize of output 603 [2025-03-04 07:54:28,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:28,071 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 181 treesize of output 174 [2025-03-04 07:54:28,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:28,086 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 165 treesize of output 170 [2025-03-04 07:54:28,093 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 161 treesize of output 157 [2025-03-04 07:54:28,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:28,108 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 157 treesize of output 160 [2025-03-04 07:54:28,162 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2025-03-04 07:54:28,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 196 [2025-03-04 07:54:28,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:28,180 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 147 treesize of output 152 [2025-03-04 07:54:28,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:28,196 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 143 treesize of output 146 [2025-03-04 07:54:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-03-04 07:54:30,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239238407] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:54:30,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:54:30,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 18] total 48 [2025-03-04 07:54:30,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488668543] [2025-03-04 07:54:30,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:54:30,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-04 07:54:30,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:54:30,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-04 07:54:30,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1921, Unknown=43, NotChecked=182, Total=2352 [2025-03-04 07:54:30,703 INFO L87 Difference]: Start difference. First operand 212 states and 246 transitions. Second operand has 49 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 49 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:35,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:35,201 INFO L93 Difference]: Finished difference Result 283 states and 323 transitions. [2025-03-04 07:54:35,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-04 07:54:35,202 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 49 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-04 07:54:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:35,202 INFO L225 Difference]: With dead ends: 283 [2025-03-04 07:54:35,202 INFO L226 Difference]: Without dead ends: 283 [2025-03-04 07:54:35,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1660 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=768, Invalid=5478, Unknown=82, NotChecked=314, Total=6642 [2025-03-04 07:54:35,204 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 619 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 2045 mSolverCounterSat, 159 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 2649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 2045 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 427 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:35,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 1017 Invalid, 2649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 2045 Invalid, 18 Unknown, 427 Unchecked, 2.4s Time] [2025-03-04 07:54:35,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-04 07:54:35,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 230. [2025-03-04 07:54:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 213 states have (on average 1.267605633802817) internal successors, (270), 229 states have internal predecessors, (270), 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-04 07:54:35,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 270 transitions. [2025-03-04 07:54:35,207 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 270 transitions. Word has length 31 [2025-03-04 07:54:35,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:35,207 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 270 transitions. [2025-03-04 07:54:35,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 49 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:35,208 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 270 transitions. [2025-03-04 07:54:35,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:54:35,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:35,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:35,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:54:35,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 07:54:35,409 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:35,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:35,409 INFO L85 PathProgramCache]: Analyzing trace with hash 622156650, now seen corresponding path program 1 times [2025-03-04 07:54:35,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:35,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252002332] [2025-03-04 07:54:35,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:35,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:35,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:54:35,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:54:35,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:35,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:54:35,420 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:54:35,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:54:35,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:54:35,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:35,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:54:35,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 07:54:35,444 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:54:35,445 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (44 of 45 remaining) [2025-03-04 07:54:35,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (43 of 45 remaining) [2025-03-04 07:54:35,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (42 of 45 remaining) [2025-03-04 07:54:35,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (41 of 45 remaining) [2025-03-04 07:54:35,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 45 remaining) [2025-03-04 07:54:35,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 45 remaining) [2025-03-04 07:54:35,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 45 remaining) [2025-03-04 07:54:35,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 45 remaining) [2025-03-04 07:54:35,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (36 of 45 remaining) [2025-03-04 07:54:35,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 45 remaining) [2025-03-04 07:54:35,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 45 remaining) [2025-03-04 07:54:35,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 45 remaining) [2025-03-04 07:54:35,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 45 remaining) [2025-03-04 07:54:35,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 45 remaining) [2025-03-04 07:54:35,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 45 remaining) [2025-03-04 07:54:35,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 45 remaining) [2025-03-04 07:54:35,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 45 remaining) [2025-03-04 07:54:35,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 45 remaining) [2025-03-04 07:54:35,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 45 remaining) [2025-03-04 07:54:35,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 45 remaining) [2025-03-04 07:54:35,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 45 remaining) [2025-03-04 07:54:35,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 45 remaining) [2025-03-04 07:54:35,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 45 remaining) [2025-03-04 07:54:35,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 45 remaining) [2025-03-04 07:54:35,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 45 remaining) [2025-03-04 07:54:35,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 45 remaining) [2025-03-04 07:54:35,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 45 remaining) [2025-03-04 07:54:35,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 45 remaining) [2025-03-04 07:54:35,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 45 remaining) [2025-03-04 07:54:35,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 45 remaining) [2025-03-04 07:54:35,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 45 remaining) [2025-03-04 07:54:35,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 45 remaining) [2025-03-04 07:54:35,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 45 remaining) [2025-03-04 07:54:35,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 45 remaining) [2025-03-04 07:54:35,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 45 remaining) [2025-03-04 07:54:35,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 45 remaining) [2025-03-04 07:54:35,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 45 remaining) [2025-03-04 07:54:35,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 45 remaining) [2025-03-04 07:54:35,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 45 remaining) [2025-03-04 07:54:35,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 45 remaining) [2025-03-04 07:54:35,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 45 remaining) [2025-03-04 07:54:35,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 45 remaining) [2025-03-04 07:54:35,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 45 remaining) [2025-03-04 07:54:35,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 45 remaining) [2025-03-04 07:54:35,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 45 remaining) [2025-03-04 07:54:35,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 07:54:35,451 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:35,466 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:54:35,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:54:35 BoogieIcfgContainer [2025-03-04 07:54:35,468 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:54:35,469 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:54:35,469 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:54:35,469 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:54:35,470 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:53:48" (3/4) ... [2025-03-04 07:54:35,471 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 07:54:35,472 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:54:35,472 INFO L158 Benchmark]: Toolchain (without parser) took 48263.58ms. Allocated memory was 142.6MB in the beginning and 654.3MB in the end (delta: 511.7MB). Free memory was 111.8MB in the beginning and 506.4MB in the end (delta: -394.7MB). Peak memory consumption was 119.6MB. Max. memory is 16.1GB. [2025-03-04 07:54:35,472 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:54:35,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.44ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 93.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:54:35,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.34ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:54:35,473 INFO L158 Benchmark]: Boogie Preprocessor took 43.19ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:54:35,473 INFO L158 Benchmark]: IcfgBuilder took 444.04ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 68.4MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:54:35,473 INFO L158 Benchmark]: TraceAbstraction took 47400.20ms. Allocated memory was 142.6MB in the beginning and 654.3MB in the end (delta: 511.7MB). Free memory was 67.4MB in the beginning and 506.6MB in the end (delta: -439.2MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. [2025-03-04 07:54:35,473 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 654.3MB. Free memory was 506.6MB in the beginning and 506.4MB in the end (delta: 135.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:54:35,474 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.93ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.44ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 93.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.34ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.19ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 444.04ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 68.4MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 47400.20ms. Allocated memory was 142.6MB in the beginning and 654.3MB in the end (delta: 511.7MB). Free memory was 67.4MB in the beginning and 506.6MB in the end (delta: -439.2MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 654.3MB. Free memory was 506.6MB in the beginning and 506.4MB in the end (delta: 135.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L999] SLL* head = malloc(sizeof(SLL)); [L1000] head->next = ((void*)0) [L1001] head->data = 0 [L1003] SLL* x = head; VAL [head={3:0}, x={3:0}] [L1006] COND TRUE __VERIFIER_nondet_int() [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1016] COND FALSE !(__VERIFIER_nondet_int()) [L1025] x = head VAL [head={3:0}, x={3:0}] [L1026] x->next [L1026] COND FALSE !(x->next) [L1033] EXPR x->next [L1033] SLL* y = x->next; [L1034] x->next = malloc(sizeof(SLL)) [L1035] x->data = 1 [L1036] x->next = y [L1040] x = head VAL [head={3:0}, x={3:0}] [L1043] EXPR x->data [L1043] COND FALSE !(x->data != 1) [L1049] EXPR x->next [L1049] x = x->next [L1050] COND FALSE !(\read(*x)) [L1058] x = head VAL [x={3:0}] [L1059] COND TRUE x != ((void*)0) [L1061] head = x VAL [head={3:0}, x={3:0}] [L1062] EXPR x->next [L1062] x = x->next [L1063] free(head) VAL [x={0:0}] [L1063] free(head) VAL [x={0:0}] [L1063] free(head) [L1059] COND FALSE !(x != ((void*)0)) [L1066] return 0; VAL [\result=0] - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 101 locations, 45 error locations. Started 1 CEGAR loops. OverallTime: 47.3s, OverallIterations: 27, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 232 mSolverCounterUnknown, 4723 SdHoareTripleChecker+Valid, 10.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4723 mSDsluCounter, 9021 SdHoareTripleChecker+Invalid, 8.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1306 IncrementalHoareTripleChecker+Unchecked, 7587 mSDsCounter, 975 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15403 IncrementalHoareTripleChecker+Invalid, 17916 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 975 mSolverCounterUnsat, 1434 mSDtfsCounter, 15403 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1031 GetRequests, 432 SyntacticMatches, 5 SemanticMatches, 594 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 5476 ImplicationChecksByTransitivity, 18.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=26, InterpolantAutomatonStates: 352, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 616 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 27.0s InterpolantComputationTime, 878 NumberOfCodeBlocks, 878 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1083 ConstructedInterpolants, 109 QuantifiedInterpolants, 18097 SizeOfPredicates, 91 NumberOfNonLiveVariables, 2232 ConjunctsInSsa, 476 ConjunctsInUnsatCore, 47 InterpolantComputations, 16 PerfectInterpolantSequences, 27/164 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 07:54:35,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/forester-heap/sll-simple-white-blue-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:54:37,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:54:37,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 07:54:37,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:54:37,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:54:37,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:54:37,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:54:37,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:54:37,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:54:37,464 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:54:37,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:54:37,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:54:37,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:54:37,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:54:37,466 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:54:37,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:54:37,466 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:54:37,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:54:37,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:54:37,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:54:37,466 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:54:37,467 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:54:37,467 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:54:37,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:54:37,467 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:54:37,467 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 07:54:37,467 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 07:54:37,467 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:54:37,467 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:54:37,467 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:54:37,467 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:54:37,467 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:54:37,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:54:37,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:54:37,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:54:37,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:54:37,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:54:37,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:54:37,469 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 07:54:37,469 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 07:54:37,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:54:37,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:54:37,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:54:37,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:54:37,469 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 -> b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d [2025-03-04 07:54:37,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:54:37,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:54:37,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:54:37,713 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:54:37,714 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:54:37,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2025-03-04 07:54:38,938 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b250093a3/620f68bae8f14a57ba91daf9ed8bebdc/FLAG13e5c0e1f [2025-03-04 07:54:39,140 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:54:39,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2025-03-04 07:54:39,153 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b250093a3/620f68bae8f14a57ba91daf9ed8bebdc/FLAG13e5c0e1f [2025-03-04 07:54:39,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b250093a3/620f68bae8f14a57ba91daf9ed8bebdc [2025-03-04 07:54:39,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:54:39,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:54:39,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:54:39,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:54:39,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:54:39,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:54:39" (1/1) ... [2025-03-04 07:54:39,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b04cd1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:39, skipping insertion in model container [2025-03-04 07:54:39,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:54:39" (1/1) ... [2025-03-04 07:54:39,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:54:39,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:54:39,444 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:54:39,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:54:39,516 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:54:39,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:39 WrapperNode [2025-03-04 07:54:39,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:54:39,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:54:39,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:54:39,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:54:39,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:39" (1/1) ... [2025-03-04 07:54:39,540 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:39" (1/1) ... [2025-03-04 07:54:39,558 INFO L138 Inliner]: procedures = 122, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 104 [2025-03-04 07:54:39,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:54:39,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:54:39,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:54:39,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:54:39,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:39" (1/1) ... [2025-03-04 07:54:39,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:39" (1/1) ... [2025-03-04 07:54:39,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:39" (1/1) ... [2025-03-04 07:54:39,596 INFO L175 MemorySlicer]: Split 22 memory accesses to 2 slices as follows [2, 20]. 91 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-04 07:54:39,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:39" (1/1) ... [2025-03-04 07:54:39,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:39" (1/1) ... [2025-03-04 07:54:39,606 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:39" (1/1) ... [2025-03-04 07:54:39,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:39" (1/1) ... [2025-03-04 07:54:39,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:39" (1/1) ... [2025-03-04 07:54:39,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:39" (1/1) ... [2025-03-04 07:54:39,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:54:39,614 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:54:39,614 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:54:39,614 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:54:39,619 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:39" (1/1) ... [2025-03-04 07:54:39,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:54:39,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:39,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:54:39,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:54:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 07:54:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 07:54:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:54:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:54:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:54:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:54:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:54:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:54:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:54:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 07:54:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 07:54:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 07:54:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 07:54:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:54:39,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:54:39,753 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:54:39,754 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:54:40,119 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2025-03-04 07:54:40,119 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:54:40,130 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:54:40,131 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:54:40,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:54:40 BoogieIcfgContainer [2025-03-04 07:54:40,131 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:54:40,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:54:40,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:54:40,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:54:40,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:54:39" (1/3) ... [2025-03-04 07:54:40,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15cf2cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:54:40, skipping insertion in model container [2025-03-04 07:54:40,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:39" (2/3) ... [2025-03-04 07:54:40,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15cf2cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:54:40, skipping insertion in model container [2025-03-04 07:54:40,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:54:40" (3/3) ... [2025-03-04 07:54:40,139 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-1.i [2025-03-04 07:54:40,148 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:54:40,150 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-simple-white-blue-1.i that has 1 procedures, 101 locations, 1 initial locations, 6 loop locations, and 45 error locations. [2025-03-04 07:54:40,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:54:40,188 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;@62db948d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:54:40,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2025-03-04 07:54:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 55 states have (on average 2.090909090909091) internal successors, (115), 100 states have internal predecessors, (115), 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-04 07:54:40,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:54:40,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:40,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:54:40,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:40,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:40,210 INFO L85 PathProgramCache]: Analyzing trace with hash 146931, now seen corresponding path program 1 times [2025-03-04 07:54:40,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:40,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [506920844] [2025-03-04 07:54:40,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:40,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:40,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:40,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:40,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:54:40,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:54:40,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:54:40,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:40,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:40,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:54:40,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:40,317 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 7 [2025-03-04 07:54:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:40,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:40,333 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:40,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506920844] [2025-03-04 07:54:40,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506920844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:40,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:40,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:54:40,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546924475] [2025-03-04 07:54:40,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:40,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:54:40,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:40,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:54:40,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:54:40,358 INFO L87 Difference]: Start difference. First operand has 101 states, 55 states have (on average 2.090909090909091) internal successors, (115), 100 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:40,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:40,509 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2025-03-04 07:54:40,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:54:40,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 07:54:40,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:40,516 INFO L225 Difference]: With dead ends: 123 [2025-03-04 07:54:40,516 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 07:54:40,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:54:40,521 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 78 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:40,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 108 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:54:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 07:54:40,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 95. [2025-03-04 07:54:40,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 94 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2025-03-04 07:54:40,550 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 3 [2025-03-04 07:54:40,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:40,550 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2025-03-04 07:54:40,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:40,550 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2025-03-04 07:54:40,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:54:40,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:40,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:54:40,556 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-04 07:54:40,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:40,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:40,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:40,756 INFO L85 PathProgramCache]: Analyzing trace with hash 146932, now seen corresponding path program 1 times [2025-03-04 07:54:40,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:40,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [729112835] [2025-03-04 07:54:40,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:40,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:40,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:40,759 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:40,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:54:40,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:54:40,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:54:40,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:40,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:40,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:54:40,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:40,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:54:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:40,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:40,814 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:40,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729112835] [2025-03-04 07:54:40,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729112835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:40,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:40,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:54:40,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503728155] [2025-03-04 07:54:40,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:40,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:54:40,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:40,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:54:40,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:54:40,816 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:41,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:41,018 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2025-03-04 07:54:41,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:54:41,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 07:54:41,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:41,021 INFO L225 Difference]: With dead ends: 119 [2025-03-04 07:54:41,021 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 07:54:41,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:54:41,022 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 78 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:41,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 104 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:54:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 07:54:41,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 93. [2025-03-04 07:54:41,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 92 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2025-03-04 07:54:41,031 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 3 [2025-03-04 07:54:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:41,032 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2025-03-04 07:54:41,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:41,033 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2025-03-04 07:54:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:54:41,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:41,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:41,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:54:41,233 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 [2025-03-04 07:54:41,234 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:41,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:41,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1814068694, now seen corresponding path program 1 times [2025-03-04 07:54:41,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:41,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2016282490] [2025-03-04 07:54:41,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:41,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:41,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:41,239 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:41,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:54:41,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:54:41,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:54:41,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:41,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:41,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:54:41,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:41,299 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 7 [2025-03-04 07:54:41,344 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-04 07:54:41,345 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 21 treesize of output 20 [2025-03-04 07:54:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:41,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:41,351 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:41,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016282490] [2025-03-04 07:54:41,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016282490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:41,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:41,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:54:41,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050261909] [2025-03-04 07:54:41,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:41,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:54:41,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:41,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:54:41,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:54:41,352 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-04 07:54:41,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:41,592 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2025-03-04 07:54:41,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:54:41,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-03-04 07:54:41,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:41,593 INFO L225 Difference]: With dead ends: 90 [2025-03-04 07:54:41,593 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 07:54:41,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:54:41,594 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 98 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:41,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 40 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:54:41,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 07:54:41,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-03-04 07:54:41,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 87 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:41,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2025-03-04 07:54:41,598 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 8 [2025-03-04 07:54:41,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:41,598 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2025-03-04 07:54:41,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-04 07:54:41,598 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2025-03-04 07:54:41,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:54:41,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:41,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:41,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:54:41,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:41,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:41,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:41,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1814068695, now seen corresponding path program 1 times [2025-03-04 07:54:41,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:41,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [529543000] [2025-03-04 07:54:41,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:41,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:41,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:41,802 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:41,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:54:41,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:54:41,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:54:41,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:41,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:41,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:54:41,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:41,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:54:41,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:54:41,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:54:41,961 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:54:41,961 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 13 treesize of output 13 [2025-03-04 07:54:41,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:41,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:41,975 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:41,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529543000] [2025-03-04 07:54:41,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529543000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:41,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:41,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:54:41,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115878664] [2025-03-04 07:54:41,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:41,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:54:41,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:41,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:54:41,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:54:41,976 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-04 07:54:42,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:42,285 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2025-03-04 07:54:42,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:54:42,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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 8 [2025-03-04 07:54:42,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:42,286 INFO L225 Difference]: With dead ends: 105 [2025-03-04 07:54:42,286 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 07:54:42,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-04 07:54:42,286 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 191 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:42,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 80 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:54:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 07:54:42,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2025-03-04 07:54:42,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 102 states have internal predecessors, (115), 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-04 07:54:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2025-03-04 07:54:42,295 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 8 [2025-03-04 07:54:42,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:42,295 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2025-03-04 07:54:42,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-04 07:54:42,295 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2025-03-04 07:54:42,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:54:42,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:42,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:42,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:54:42,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:42,497 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:42,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:42,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1233287312, now seen corresponding path program 1 times [2025-03-04 07:54:42,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:42,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [868253492] [2025-03-04 07:54:42,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:42,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:42,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:42,500 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:42,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:54:42,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:54:42,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:54:42,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:42,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:42,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:54:42,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:42,579 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 7 [2025-03-04 07:54:42,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:54:42,620 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 19 treesize of output 11 [2025-03-04 07:54:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:42,639 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:42,639 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:42,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868253492] [2025-03-04 07:54:42,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868253492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:42,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:42,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:54:42,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777110169] [2025-03-04 07:54:42,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:42,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:54:42,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:42,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:54:42,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:54:42,640 INFO L87 Difference]: Start difference. First operand 103 states and 115 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-04 07:54:42,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:42,983 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2025-03-04 07:54:42,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:54:42,983 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-04 07:54:42,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:42,984 INFO L225 Difference]: With dead ends: 104 [2025-03-04 07:54:42,984 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 07:54:42,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:54:42,985 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 24 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:42,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 170 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:54:42,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 07:54:42,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2025-03-04 07:54:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4805194805194806) internal successors, (114), 101 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2025-03-04 07:54:42,990 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 12 [2025-03-04 07:54:42,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:42,990 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2025-03-04 07:54:42,990 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-04 07:54:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2025-03-04 07:54:42,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:54:42,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:42,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:43,000 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-04 07:54:43,191 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 [2025-03-04 07:54:43,191 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:43,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:43,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1233287313, now seen corresponding path program 1 times [2025-03-04 07:54:43,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:43,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [757953999] [2025-03-04 07:54:43,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:43,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:43,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:43,193 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:43,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:54:43,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:54:43,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:54:43,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:43,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:43,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 07:54:43,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:43,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:54:43,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:54:43,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:54:43,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 07:54:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:43,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:43,351 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:43,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757953999] [2025-03-04 07:54:43,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757953999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:43,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:43,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:54:43,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617108060] [2025-03-04 07:54:43,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:43,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:54:43,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:43,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:54:43,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:54:43,353 INFO L87 Difference]: Start difference. First operand 102 states and 114 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-04 07:54:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:43,660 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2025-03-04 07:54:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:54:43,661 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-04 07:54:43,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:43,661 INFO L225 Difference]: With dead ends: 100 [2025-03-04 07:54:43,661 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 07:54:43,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:54:43,662 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 9 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:43,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 214 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:54:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 07:54:43,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2025-03-04 07:54:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 92 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-04 07:54:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2025-03-04 07:54:43,665 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 12 [2025-03-04 07:54:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:43,665 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2025-03-04 07:54:43,665 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-04 07:54:43,666 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2025-03-04 07:54:43,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:54:43,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:43,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:43,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:54:43,869 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 [2025-03-04 07:54:43,869 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:43,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:43,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1635962004, now seen corresponding path program 1 times [2025-03-04 07:54:43,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:43,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37238536] [2025-03-04 07:54:43,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:43,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:43,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:43,872 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:43,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:54:43,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:54:43,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:54:43,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:43,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:43,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 07:54:43,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:43,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:54:43,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:54:43,954 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 27 treesize of output 11 [2025-03-04 07:54:43,962 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-04 07:54:44,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:44,019 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:44,019 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:44,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37238536] [2025-03-04 07:54:44,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37238536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:44,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:44,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:54:44,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928008758] [2025-03-04 07:54:44,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:44,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:54:44,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:44,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:54:44,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:54:44,020 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-04 07:54:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:44,238 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2025-03-04 07:54:44,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:54:44,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2025-03-04 07:54:44,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:44,239 INFO L225 Difference]: With dead ends: 104 [2025-03-04 07:54:44,239 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 07:54:44,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:54:44,240 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 19 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:44,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 209 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:54:44,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 07:54:44,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2025-03-04 07:54:44,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.435897435897436) internal successors, (112), 98 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-04 07:54:44,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2025-03-04 07:54:44,248 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 15 [2025-03-04 07:54:44,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:44,248 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2025-03-04 07:54:44,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-04 07:54:44,248 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2025-03-04 07:54:44,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:54:44,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:44,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:44,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 07:54:44,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:44,449 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:44,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:44,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2116582951, now seen corresponding path program 1 times [2025-03-04 07:54:44,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:44,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1698582971] [2025-03-04 07:54:44,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:44,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:44,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:44,452 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:44,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:54:44,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:54:44,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:54:44,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:44,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:44,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:54:44,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:44,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:54:44,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:54:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:44,568 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:44,568 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:44,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698582971] [2025-03-04 07:54:44,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698582971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:44,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:44,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:54:44,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377231217] [2025-03-04 07:54:44,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:44,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:54:44,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:44,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:54:44,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:54:44,569 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-04 07:54:44,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:44,772 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2025-03-04 07:54:44,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:54:44,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-04 07:54:44,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:44,773 INFO L225 Difference]: With dead ends: 120 [2025-03-04 07:54:44,773 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 07:54:44,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:54:44,774 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 22 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:44,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 241 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:54:44,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 07:54:44,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2025-03-04 07:54:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 101 states have internal predecessors, (115), 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-04 07:54:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2025-03-04 07:54:44,777 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 18 [2025-03-04 07:54:44,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:44,777 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2025-03-04 07:54:44,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-04 07:54:44,777 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2025-03-04 07:54:44,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:54:44,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:44,777 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:44,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:54:44,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:44,982 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:44,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:44,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1190362184, now seen corresponding path program 1 times [2025-03-04 07:54:44,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:44,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2017504806] [2025-03-04 07:54:44,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:44,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:44,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:44,984 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:44,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:54:45,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:54:45,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:54:45,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:45,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:45,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:54:45,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:45,072 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-04 07:54:45,072 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 21 treesize of output 20 [2025-03-04 07:54:45,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:54:45,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 27 treesize of output 15 [2025-03-04 07:54:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:45,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:45,171 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:45,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017504806] [2025-03-04 07:54:45,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017504806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:45,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:45,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:54:45,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820511916] [2025-03-04 07:54:45,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:45,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:54:45,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:45,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:54:45,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:54:45,173 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:45,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:45,621 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2025-03-04 07:54:45,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:54:45,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 07:54:45,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:45,625 INFO L225 Difference]: With dead ends: 122 [2025-03-04 07:54:45,625 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 07:54:45,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:54:45,625 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 138 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:45,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 127 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:54:45,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 07:54:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 106. [2025-03-04 07:54:45,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.423529411764706) internal successors, (121), 105 states have internal predecessors, (121), 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-04 07:54:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2025-03-04 07:54:45,628 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 19 [2025-03-04 07:54:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:45,628 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2025-03-04 07:54:45,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2025-03-04 07:54:45,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:54:45,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:45,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:45,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 07:54:45,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:45,829 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:45,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:45,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1190362185, now seen corresponding path program 1 times [2025-03-04 07:54:45,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:45,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1552062689] [2025-03-04 07:54:45,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:45,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:45,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:45,831 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:45,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:54:45,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:54:45,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:54:45,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:45,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:45,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 07:54:45,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:45,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:54:45,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:54:45,974 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:54:45,974 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 13 treesize of output 13 [2025-03-04 07:54:45,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:54:46,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:54:46,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:54:46,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:54:46,099 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 7 treesize of output 3 [2025-03-04 07:54:46,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:46,130 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:46,131 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:46,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552062689] [2025-03-04 07:54:46,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552062689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:46,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:46,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:54:46,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220760271] [2025-03-04 07:54:46,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:46,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:54:46,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:46,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:54:46,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:54:46,132 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:46,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:46,713 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2025-03-04 07:54:46,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:54:46,713 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 07:54:46,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:46,714 INFO L225 Difference]: With dead ends: 131 [2025-03-04 07:54:46,714 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 07:54:46,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:54:46,714 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 126 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:46,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 195 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:54:46,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 07:54:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 108. [2025-03-04 07:54:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 107 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2025-03-04 07:54:46,723 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 19 [2025-03-04 07:54:46,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:46,723 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2025-03-04 07:54:46,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:46,723 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2025-03-04 07:54:46,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:54:46,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:46,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:46,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 07:54:46,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:46,925 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:46,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:46,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1753498109, now seen corresponding path program 1 times [2025-03-04 07:54:46,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:46,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [950641103] [2025-03-04 07:54:46,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:46,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:46,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:46,928 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:46,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:54:46,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:54:46,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:54:46,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:46,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:46,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:54:46,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:47,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:47,007 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:47,007 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:47,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950641103] [2025-03-04 07:54:47,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950641103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:47,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:47,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:54:47,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641638084] [2025-03-04 07:54:47,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:47,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:54:47,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:47,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:54:47,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:54:47,008 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:47,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:47,139 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2025-03-04 07:54:47,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:54:47,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 07:54:47,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:47,140 INFO L225 Difference]: With dead ends: 111 [2025-03-04 07:54:47,140 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 07:54:47,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:54:47,140 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 103 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:47,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 87 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:54:47,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 07:54:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2025-03-04 07:54:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 107 states have internal predecessors, (122), 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-04 07:54:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2025-03-04 07:54:47,143 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 20 [2025-03-04 07:54:47,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:47,143 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2025-03-04 07:54:47,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:47,143 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2025-03-04 07:54:47,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:54:47,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:47,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:47,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:54:47,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:47,344 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:47,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:47,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1825311874, now seen corresponding path program 1 times [2025-03-04 07:54:47,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:47,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [560339133] [2025-03-04 07:54:47,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:47,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:47,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:47,347 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:47,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:54:47,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:54:47,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:54:47,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:47,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:47,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 07:54:47,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:47,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:54:47,478 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:54:47,479 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 13 treesize of output 13 [2025-03-04 07:54:47,509 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 16 treesize of output 11 [2025-03-04 07:54:47,528 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-04 07:54:47,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:54:47,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:54:47,593 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-04 07:54:47,601 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 7 treesize of output 3 [2025-03-04 07:54:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:47,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:47,647 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:47,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560339133] [2025-03-04 07:54:47,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560339133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:47,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:47,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 07:54:47,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415608409] [2025-03-04 07:54:47,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:47,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:54:47,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:47,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:54:47,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:54:47,649 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-04 07:54:48,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:48,254 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2025-03-04 07:54:48,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:54:48,255 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 07:54:48,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:48,256 INFO L225 Difference]: With dead ends: 159 [2025-03-04 07:54:48,256 INFO L226 Difference]: Without dead ends: 159 [2025-03-04 07:54:48,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:54:48,257 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 174 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:48,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 334 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:54:48,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-04 07:54:48,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 119. [2025-03-04 07:54:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 118 states have internal predecessors, (134), 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-04 07:54:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2025-03-04 07:54:48,260 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 23 [2025-03-04 07:54:48,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:48,260 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2025-03-04 07:54:48,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-04 07:54:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2025-03-04 07:54:48,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:54:48,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:48,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:48,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 07:54:48,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:48,464 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:48,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:48,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1235522535, now seen corresponding path program 1 times [2025-03-04 07:54:48,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:48,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1020779158] [2025-03-04 07:54:48,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:48,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:48,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:48,466 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:48,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:54:48,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:54:48,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:54:48,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:48,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:48,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:54:48,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:48,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:54:48,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-04 07:54:48,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:48,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:48,587 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:48,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020779158] [2025-03-04 07:54:48,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020779158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:48,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:48,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:54:48,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428008995] [2025-03-04 07:54:48,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:48,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:54:48,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:48,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:54:48,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:54:48,587 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:48,922 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2025-03-04 07:54:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:54:48,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 07:54:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:48,923 INFO L225 Difference]: With dead ends: 142 [2025-03-04 07:54:48,923 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 07:54:48,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:54:48,924 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 159 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:48,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 211 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:54:48,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 07:54:48,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 119. [2025-03-04 07:54:48,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 98 states have (on average 1.346938775510204) internal successors, (132), 118 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-04 07:54:48,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2025-03-04 07:54:48,926 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 23 [2025-03-04 07:54:48,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:48,927 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2025-03-04 07:54:48,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:48,927 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2025-03-04 07:54:48,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:54:48,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:48,927 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:48,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 07:54:49,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:49,128 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:54:49,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:49,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1328621166, now seen corresponding path program 1 times [2025-03-04 07:54:49,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:49,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [482894528] [2025-03-04 07:54:49,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:49,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:49,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:49,134 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:49,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:54:49,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:54:49,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:54:49,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:49,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:49,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:54:49,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:49,206 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 7 [2025-03-04 07:54:49,253 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-03-04 07:54:49,253 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 27 [2025-03-04 07:54:49,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:54:49,379 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:54:49,379 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 35 treesize of output 26 [2025-03-04 07:54:49,400 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:54:49,400 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 36 treesize of output 35 [2025-03-04 07:54:49,477 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-04 07:54:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:49,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:54:49,608 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2025-03-04 07:54:49,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:49,695 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 22 treesize of output 23 [2025-03-04 07:54:49,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:49,705 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 38 treesize of output 41 [2025-03-04 07:54:49,712 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-04 07:55:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:55:09,439 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:55:09,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482894528] [2025-03-04 07:55:09,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482894528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:55:09,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:55:09,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2025-03-04 07:55:09,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968638403] [2025-03-04 07:55:09,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:55:09,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 07:55:09,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:55:09,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 07:55:09,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=325, Unknown=15, NotChecked=38, Total=462 [2025-03-04 07:55:09,441 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 22 states have internal predecessors, (45), 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-04 07:55:10,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:55:10,717 INFO L93 Difference]: Finished difference Result 184 states and 209 transitions. [2025-03-04 07:55:10,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:55:10,717 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 07:55:10,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:55:10,718 INFO L225 Difference]: With dead ends: 184 [2025-03-04 07:55:10,718 INFO L226 Difference]: Without dead ends: 184 [2025-03-04 07:55:10,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=185, Invalid=728, Unknown=21, NotChecked=58, Total=992 [2025-03-04 07:55:10,719 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 307 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:55:10,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 328 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 767 Invalid, 0 Unknown, 189 Unchecked, 1.0s Time] [2025-03-04 07:55:10,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-04 07:55:10,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 135. [2025-03-04 07:55:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 114 states have (on average 1.3421052631578947) internal successors, (153), 134 states have internal predecessors, (153), 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-04 07:55:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 153 transitions. [2025-03-04 07:55:10,722 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 153 transitions. Word has length 23 [2025-03-04 07:55:10,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:55:10,722 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 153 transitions. [2025-03-04 07:55:10,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 22 states have internal predecessors, (45), 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-04 07:55:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 153 transitions. [2025-03-04 07:55:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:55:10,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:55:10,723 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:55:10,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 07:55:10,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:55:10,923 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 42 more)] === [2025-03-04 07:55:10,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:55:10,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1328621167, now seen corresponding path program 1 times [2025-03-04 07:55:10,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:55:10,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434922437] [2025-03-04 07:55:10,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:55:10,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:55:10,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:55:10,927 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:55:10,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 07:55:10,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:55:10,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:55:10,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:55:10,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:55:10,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 07:55:10,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:55:11,002 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 7 [2025-03-04 07:55:11,043 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:55:11,043 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 13 treesize of output 13 [2025-03-04 07:55:11,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:55:11,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:55:11,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:55:11,174 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:55:11,174 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 16 treesize of output 15 [2025-03-04 07:55:11,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 5 treesize of output 3 [2025-03-04 07:55:11,192 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:55:11,193 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 33 treesize of output 24 [2025-03-04 07:55:11,223 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:55:11,223 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-04 07:55:11,228 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-04 07:55:11,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:55:11,319 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 7 treesize of output 3 [2025-03-04 07:55:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:55:11,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:55:11,875 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_380) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_380) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_381) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2025-03-04 07:55:11,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:55:11,894 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 37 treesize of output 38 [2025-03-04 07:55:11,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:55:11,906 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 29 treesize of output 30 [2025-03-04 07:55:11,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:55:11,917 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 52 treesize of output 55 [2025-03-04 07:55:11,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:55:11,932 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 82 treesize of output 81 [2025-03-04 07:55:11,937 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 11 treesize of output 9 [2025-03-04 07:55:11,939 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-04 07:55:12,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:55:12,002 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 35 treesize of output 28 [2025-03-04 07:55:12,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:55:12,014 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 40 treesize of output 39 [2025-03-04 07:55:12,022 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 5 [2025-03-04 07:55:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:55:12,197 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:55:12,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434922437] [2025-03-04 07:55:12,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434922437] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:55:12,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:55:12,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2025-03-04 07:55:12,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331363970] [2025-03-04 07:55:12,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:55:12,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 07:55:12,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:55:12,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 07:55:12,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=306, Unknown=21, NotChecked=36, Total=420 [2025-03-04 07:55:12,198 INFO L87 Difference]: Start difference. First operand 135 states and 153 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 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-04 07:55:13,804 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse0 (bvadd (_ bv4 32) .cse2))) (and (bvule .cse0 (select |c_#length| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (_ bv8 32) (select |c_#length| |c_ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_380) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))) (bvule .cse2 .cse0) (= (_ bv0 32) |c_ULTIMATE.start_main_~x~0#1.offset|) (forall ((v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_380) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_381) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false