./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/prefixsum_rec.c --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/verifythis/prefixsum_rec.c -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 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:32:50,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:32:50,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:32:50,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:32:50,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:32:50,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:32:50,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:32:50,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:32:50,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:32:50,502 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:32:50,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:32:50,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:32:50,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:32:50,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:32:50,503 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:32:50,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:32:50,503 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:32:50,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:32:50,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:32:50,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:32:50,503 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:32:50,503 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:32:50,503 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:32:50,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:32:50,503 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:32:50,503 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:32:50,503 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:32:50,504 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:32:50,504 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:32:50,504 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:32:50,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:32:50,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:32:50,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:32:50,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:32:50,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:32:50,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:32:50,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:32:50,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:32:50,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:32:50,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:32:50,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:32:50,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:32:50,505 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 -> 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab [2025-03-04 07:32:50,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:32:50,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:32:50,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:32:50,736 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:32:50,737 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:32:50,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_rec.c [2025-03-04 07:32:51,848 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a6dced38/59cc3fcde506416e9852707d0784b2d6/FLAGf9f430f19 [2025-03-04 07:32:52,070 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:32:52,072 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c [2025-03-04 07:32:52,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a6dced38/59cc3fcde506416e9852707d0784b2d6/FLAGf9f430f19 [2025-03-04 07:32:52,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a6dced38/59cc3fcde506416e9852707d0784b2d6 [2025-03-04 07:32:52,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:32:52,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:32:52,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:32:52,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:32:52,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:32:52,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:32:52" (1/1) ... [2025-03-04 07:32:52,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19b1cbd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:52, skipping insertion in model container [2025-03-04 07:32:52,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:32:52" (1/1) ... [2025-03-04 07:32:52,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:32:52,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:32:52,276 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:32:52,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:32:52,308 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:32:52,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:52 WrapperNode [2025-03-04 07:32:52,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:32:52,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:32:52,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:32:52,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:32:52,316 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:32:52" (1/1) ... [2025-03-04 07:32:52,324 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:32:52" (1/1) ... [2025-03-04 07:32:52,340 INFO L138 Inliner]: procedures = 22, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 74 [2025-03-04 07:32:52,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:32:52,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:32:52,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:32:52,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:32:52,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:52" (1/1) ... [2025-03-04 07:32:52,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:52" (1/1) ... [2025-03-04 07:32:52,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:52" (1/1) ... [2025-03-04 07:32:52,370 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2025-03-04 07:32:52,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:52" (1/1) ... [2025-03-04 07:32:52,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:52" (1/1) ... [2025-03-04 07:32:52,376 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:52" (1/1) ... [2025-03-04 07:32:52,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:52" (1/1) ... [2025-03-04 07:32:52,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:52" (1/1) ... [2025-03-04 07:32:52,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:52" (1/1) ... [2025-03-04 07:32:52,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:32:52,382 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:32:52,382 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:32:52,382 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:32:52,383 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:52" (1/1) ... [2025-03-04 07:32:52,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:32:52,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:52,411 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:32:52,418 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:32:52,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:32:52,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 07:32:52,434 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 07:32:52,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:32:52,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:32:52,434 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2025-03-04 07:32:52,434 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2025-03-04 07:32:52,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:32:52,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:32:52,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:32:52,434 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2025-03-04 07:32:52,434 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2025-03-04 07:32:52,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:32:52,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:32:52,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:32:52,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:32:52,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 07:32:52,435 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 07:32:52,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:32:52,516 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:32:52,518 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:32:52,795 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-03-04 07:32:52,796 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:32:52,804 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:32:52,804 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:32:52,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:32:52 BoogieIcfgContainer [2025-03-04 07:32:52,804 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:32:52,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:32:52,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:32:52,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:32:52,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:32:52" (1/3) ... [2025-03-04 07:32:52,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f23f363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:32:52, skipping insertion in model container [2025-03-04 07:32:52,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:52" (2/3) ... [2025-03-04 07:32:52,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f23f363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:32:52, skipping insertion in model container [2025-03-04 07:32:52,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:32:52" (3/3) ... [2025-03-04 07:32:52,813 INFO L128 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2025-03-04 07:32:52,824 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:32:52,825 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG prefixsum_rec.c that has 5 procedures, 105 locations, 1 initial locations, 3 loop locations, and 34 error locations. [2025-03-04 07:32:52,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:32:52,857 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;@57327d24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:32:52,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-03-04 07:32:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 56 states have (on average 1.7321428571428572) internal successors, (97), 90 states have internal predecessors, (97), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:32:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:32:52,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:52,866 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:52,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:32:52,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:52,870 INFO L85 PathProgramCache]: Analyzing trace with hash 2126653616, now seen corresponding path program 1 times [2025-03-04 07:32:52,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:52,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049970038] [2025-03-04 07:32:52,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:52,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:52,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:32:52,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:32:52,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:52,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:32:53,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:53,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049970038] [2025-03-04 07:32:53,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049970038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:53,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598003276] [2025-03-04 07:32:53,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:53,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:53,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:53,010 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:32:53,012 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:32:53,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:32:53,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:32:53,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:53,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:53,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 07:32:53,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:32:53,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:32:53,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598003276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:53,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:32:53,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 07:32:53,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604942768] [2025-03-04 07:32:53,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:53,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 07:32:53,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:53,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 07:32:53,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:32:53,123 INFO L87 Difference]: Start difference. First operand has 105 states, 56 states have (on average 1.7321428571428572) internal successors, (97), 90 states have internal predecessors, (97), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:32:53,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:53,141 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2025-03-04 07:32:53,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 07:32:53,143 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2025-03-04 07:32:53,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:53,148 INFO L225 Difference]: With dead ends: 104 [2025-03-04 07:32:53,148 INFO L226 Difference]: Without dead ends: 102 [2025-03-04 07:32:53,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:32:53,152 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:53,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:53,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-04 07:32:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-04 07:32:53,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 54 states have (on average 1.7037037037037037) internal successors, (92), 87 states have internal predecessors, (92), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:32:53,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2025-03-04 07:32:53,186 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 28 [2025-03-04 07:32:53,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:53,186 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2025-03-04 07:32:53,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:32:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2025-03-04 07:32:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:32:53,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:53,188 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:53,194 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:32:53,392 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,SelfDestructingSolverStorable0 [2025-03-04 07:32:53,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:32:53,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:53,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1549112686, now seen corresponding path program 1 times [2025-03-04 07:32:53,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:53,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227990917] [2025-03-04 07:32:53,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:53,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:53,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:32:53,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:32:53,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:53,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:53,639 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:32:53,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:53,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227990917] [2025-03-04 07:32:53,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227990917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:53,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:53,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:32:53,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104895249] [2025-03-04 07:32:53,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:53,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:32:53,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:53,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:32:53,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:32:53,641 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:32:53,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:53,754 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2025-03-04 07:32:53,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:32:53,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2025-03-04 07:32:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:53,759 INFO L225 Difference]: With dead ends: 99 [2025-03-04 07:32:53,759 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 07:32:53,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:32:53,760 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 26 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:53,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 204 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:53,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 07:32:53,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-04 07:32:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 84 states have internal predecessors, (89), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:32:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2025-03-04 07:32:53,766 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 28 [2025-03-04 07:32:53,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:53,767 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2025-03-04 07:32:53,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:32:53,767 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2025-03-04 07:32:53,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:32:53,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:53,768 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:53,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:32:53,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:32:53,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:53,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1549112687, now seen corresponding path program 1 times [2025-03-04 07:32:53,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:53,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984807433] [2025-03-04 07:32:53,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:53,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:53,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:32:53,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:32:53,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:53,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:32:54,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:54,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984807433] [2025-03-04 07:32:54,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984807433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:54,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:54,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:32:54,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498235750] [2025-03-04 07:32:54,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:54,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:32:54,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:54,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:32:54,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:32:54,217 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:32:54,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:54,565 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2025-03-04 07:32:54,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:32:54,565 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 28 [2025-03-04 07:32:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:54,566 INFO L225 Difference]: With dead ends: 123 [2025-03-04 07:32:54,566 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 07:32:54,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:32:54,566 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 63 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:54,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 546 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:32:54,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 07:32:54,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2025-03-04 07:32:54,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 91 states have internal predecessors, (98), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 07:32:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2025-03-04 07:32:54,576 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 28 [2025-03-04 07:32:54,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:54,579 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2025-03-04 07:32:54,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:32:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2025-03-04 07:32:54,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:32:54,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:54,580 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:54,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:32:54,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:32:54,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:54,582 INFO L85 PathProgramCache]: Analyzing trace with hash 777853064, now seen corresponding path program 1 times [2025-03-04 07:32:54,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:54,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549252414] [2025-03-04 07:32:54,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:54,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:54,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:32:54,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:32:54,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:54,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:32:54,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:54,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549252414] [2025-03-04 07:32:54,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549252414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:54,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:54,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:32:54,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286191650] [2025-03-04 07:32:54,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:54,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:32:54,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:54,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:32:54,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:32:54,634 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:32:54,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:54,707 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2025-03-04 07:32:54,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:32:54,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2025-03-04 07:32:54,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:54,708 INFO L225 Difference]: With dead ends: 108 [2025-03-04 07:32:54,708 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 07:32:54,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:32:54,709 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 26 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:54,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 211 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:54,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 07:32:54,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-04 07:32:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 61 states have (on average 1.5901639344262295) internal successors, (97), 90 states have internal predecessors, (97), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 07:32:54,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2025-03-04 07:32:54,714 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 29 [2025-03-04 07:32:54,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:54,714 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2025-03-04 07:32:54,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:32:54,714 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2025-03-04 07:32:54,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:32:54,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:54,714 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:54,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:32:54,715 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:32:54,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:54,715 INFO L85 PathProgramCache]: Analyzing trace with hash 777853065, now seen corresponding path program 1 times [2025-03-04 07:32:54,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:54,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971430873] [2025-03-04 07:32:54,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:54,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:54,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:32:54,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:32:54,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:54,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:32:54,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:54,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971430873] [2025-03-04 07:32:54,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971430873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:54,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:54,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:32:54,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392781202] [2025-03-04 07:32:54,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:54,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:32:54,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:54,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:32:54,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:32:54,989 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:32:55,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:55,200 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2025-03-04 07:32:55,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:32:55,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2025-03-04 07:32:55,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:55,202 INFO L225 Difference]: With dead ends: 112 [2025-03-04 07:32:55,204 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 07:32:55,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:32:55,205 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 4 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:55,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 395 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:32:55,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 07:32:55,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-03-04 07:32:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 64 states have (on average 1.59375) internal successors, (102), 93 states have internal predecessors, (102), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 07:32:55,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 128 transitions. [2025-03-04 07:32:55,211 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 128 transitions. Word has length 29 [2025-03-04 07:32:55,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:55,211 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 128 transitions. [2025-03-04 07:32:55,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:32:55,211 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2025-03-04 07:32:55,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:32:55,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:55,214 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:55,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:32:55,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:32:55,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:55,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1806546206, now seen corresponding path program 1 times [2025-03-04 07:32:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:55,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269144330] [2025-03-04 07:32:55,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:55,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:32:55,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:32:55,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:55,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:32:55,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:55,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269144330] [2025-03-04 07:32:55,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269144330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:55,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363811996] [2025-03-04 07:32:55,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:55,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:55,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:55,653 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:32:55,654 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:32:55,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:32:55,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:32:55,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:55,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:55,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:32:55,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:55,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:32:55,807 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 7 [2025-03-04 07:32:56,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:32:56,008 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 43 treesize of output 32 [2025-03-04 07:32:56,015 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:32:56,016 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:32:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:32:56,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:56,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363811996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:56,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:32:56,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-04 07:32:56,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501910275] [2025-03-04 07:32:56,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:56,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 07:32:56,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:56,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 07:32:56,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:32:56,385 INFO L87 Difference]: Start difference. First operand 111 states and 128 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 07:32:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:57,053 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2025-03-04 07:32:57,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:32:57,053 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 29 [2025-03-04 07:32:57,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:57,054 INFO L225 Difference]: With dead ends: 111 [2025-03-04 07:32:57,054 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 07:32:57,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:32:57,055 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 182 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:57,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 423 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:32:57,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 07:32:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2025-03-04 07:32:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 85 states have internal predecessors, (90), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:32:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2025-03-04 07:32:57,063 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 29 [2025-03-04 07:32:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:57,063 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2025-03-04 07:32:57,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 07:32:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2025-03-04 07:32:57,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:32:57,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:57,065 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, 1, 1, 1, 1] [2025-03-04 07:32:57,071 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:32:57,265 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,SelfDestructingSolverStorable5 [2025-03-04 07:32:57,265 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:32:57,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:57,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1672120555, now seen corresponding path program 1 times [2025-03-04 07:32:57,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:57,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117923050] [2025-03-04 07:32:57,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:57,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:57,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:32:57,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:32:57,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:57,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:32:57,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:57,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117923050] [2025-03-04 07:32:57,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117923050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:57,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491921072] [2025-03-04 07:32:57,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:57,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:57,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:57,419 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:32:57,420 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:32:57,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:32:57,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:32:57,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:57,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:57,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 07:32:57,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:32:57,556 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:32:57,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491921072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:57,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:32:57,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 15 [2025-03-04 07:32:57,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428436878] [2025-03-04 07:32:57,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:57,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:32:57,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:57,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:32:57,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:32:57,558 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:32:57,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:57,624 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2025-03-04 07:32:57,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:32:57,626 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2025-03-04 07:32:57,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:57,627 INFO L225 Difference]: With dead ends: 103 [2025-03-04 07:32:57,627 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 07:32:57,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:32:57,627 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 15 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:57,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 618 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 07:32:57,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-04 07:32:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 86 states have internal predecessors, (91), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:32:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2025-03-04 07:32:57,634 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 32 [2025-03-04 07:32:57,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:57,634 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2025-03-04 07:32:57,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:32:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2025-03-04 07:32:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:32:57,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:57,635 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, 1, 1, 1, 1, 1] [2025-03-04 07:32:57,644 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:32:57,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:57,838 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:32:57,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:57,839 INFO L85 PathProgramCache]: Analyzing trace with hash -981649126, now seen corresponding path program 1 times [2025-03-04 07:32:57,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:57,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95806922] [2025-03-04 07:32:57,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:57,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:57,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:32:57,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:32:57,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:57,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:58,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:32:58,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:58,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95806922] [2025-03-04 07:32:58,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95806922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:58,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44848064] [2025-03-04 07:32:58,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:58,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:58,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:58,103 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:32:58,104 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:32:58,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:32:58,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:32:58,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:58,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:58,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 07:32:58,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:58,238 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:32:58,247 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:32:58,324 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:32:58,325 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:32:58,331 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 16 treesize of output 11 [2025-03-04 07:32:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:32:58,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:58,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44848064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:58,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:32:58,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2025-03-04 07:32:58,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792437677] [2025-03-04 07:32:58,723 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:58,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 07:32:58,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:58,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 07:32:58,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:32:58,725 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 20 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 07:32:59,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:59,258 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2025-03-04 07:32:59,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:32:59,258 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 20 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 33 [2025-03-04 07:32:59,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:59,259 INFO L225 Difference]: With dead ends: 106 [2025-03-04 07:32:59,259 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 07:32:59,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 07:32:59,260 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 149 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:59,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 452 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:32:59,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 07:32:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2025-03-04 07:32:59,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 61 states have (on average 1.540983606557377) internal successors, (94), 89 states have internal predecessors, (94), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:32:59,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2025-03-04 07:32:59,263 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 33 [2025-03-04 07:32:59,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:59,263 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2025-03-04 07:32:59,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 20 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 07:32:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2025-03-04 07:32:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 07:32:59,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:59,264 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:59,270 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:32:59,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:59,464 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:32:59,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:59,465 INFO L85 PathProgramCache]: Analyzing trace with hash -366351810, now seen corresponding path program 1 times [2025-03-04 07:32:59,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:59,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622936342] [2025-03-04 07:32:59,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:59,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:59,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:32:59,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:32:59,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:59,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:32:59,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:59,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622936342] [2025-03-04 07:32:59,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622936342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:59,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716097601] [2025-03-04 07:32:59,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:59,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:59,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:59,673 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:32:59,674 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:32:59,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:32:59,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:32:59,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:59,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:59,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 07:32:59,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:59,734 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 10 treesize of output 9 [2025-03-04 07:32:59,847 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:32:59,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2025-03-04 07:33:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:33:00,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:00,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716097601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:00,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:33:00,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-03-04 07:33:00,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508326789] [2025-03-04 07:33:00,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:00,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:33:00,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:00,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:33:00,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:33:00,325 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 07:33:00,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:00,855 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2025-03-04 07:33:00,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:33:00,856 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 34 [2025-03-04 07:33:00,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:00,857 INFO L225 Difference]: With dead ends: 103 [2025-03-04 07:33:00,857 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 07:33:00,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:33:00,857 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 96 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:00,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 570 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:33:00,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 07:33:00,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-04 07:33:00,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 88 states have internal predecessors, (93), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:33:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2025-03-04 07:33:00,861 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 34 [2025-03-04 07:33:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:00,861 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2025-03-04 07:33:00,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 07:33:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2025-03-04 07:33:00,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:33:00,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:00,862 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:00,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 07:33:01,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:01,062 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:33:01,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:01,063 INFO L85 PathProgramCache]: Analyzing trace with hash -474849514, now seen corresponding path program 2 times [2025-03-04 07:33:01,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:01,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821453966] [2025-03-04 07:33:01,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:33:01,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:01,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 07:33:01,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:33:01,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:33:01,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:33:01,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:01,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821453966] [2025-03-04 07:33:01,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821453966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:01,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648032624] [2025-03-04 07:33:01,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:33:01,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:01,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:01,533 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:33:01,539 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:33:01,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 07:33:01,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:33:01,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:33:01,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:01,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 07:33:01,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:01,674 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 10 treesize of output 9 [2025-03-04 07:33:02,273 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:33:02,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2025-03-04 07:33:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:33:02,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:02,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648032624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:02,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:33:02,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2025-03-04 07:33:02,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590786970] [2025-03-04 07:33:02,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:02,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 07:33:02,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:02,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 07:33:02,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=642, Unknown=1, NotChecked=0, Total=756 [2025-03-04 07:33:02,859 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 07:33:03,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:03,780 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2025-03-04 07:33:03,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:33:03,781 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 37 [2025-03-04 07:33:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:03,781 INFO L225 Difference]: With dead ends: 109 [2025-03-04 07:33:03,781 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 07:33:03,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=249, Invalid=1310, Unknown=1, NotChecked=0, Total=1560 [2025-03-04 07:33:03,782 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 133 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:03,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 903 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:33:03,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 07:33:03,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2025-03-04 07:33:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 92 states have internal predecessors, (98), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:33:03,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2025-03-04 07:33:03,786 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 37 [2025-03-04 07:33:03,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:03,786 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2025-03-04 07:33:03,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 07:33:03,786 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2025-03-04 07:33:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:33:03,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:03,787 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:03,793 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:33:03,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:03,988 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting upsweepErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:33:03,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:03,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1382261362, now seen corresponding path program 1 times [2025-03-04 07:33:03,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:03,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753012014] [2025-03-04 07:33:03,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:03,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:03,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:33:04,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:33:04,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:04,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:04,035 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:33:04,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:04,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753012014] [2025-03-04 07:33:04,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753012014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:33:04,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:33:04,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:33:04,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382358825] [2025-03-04 07:33:04,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:33:04,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:33:04,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:04,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:33:04,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:33:04,037 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:33:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:04,115 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2025-03-04 07:33:04,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:33:04,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2025-03-04 07:33:04,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:04,117 INFO L225 Difference]: With dead ends: 104 [2025-03-04 07:33:04,117 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 07:33:04,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:33:04,117 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 35 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:04,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 236 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:33:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 07:33:04,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-04 07:33:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 89 states have internal predecessors, (95), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:33:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2025-03-04 07:33:04,122 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 40 [2025-03-04 07:33:04,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:04,122 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2025-03-04 07:33:04,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:33:04,122 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2025-03-04 07:33:04,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:33:04,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:04,124 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:04,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:33:04,124 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting upsweepErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:33:04,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:04,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1382261363, now seen corresponding path program 1 times [2025-03-04 07:33:04,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:04,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962912834] [2025-03-04 07:33:04,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:04,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:04,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:33:04,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:33:04,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:04,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:04,346 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:33:04,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:04,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962912834] [2025-03-04 07:33:04,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962912834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:04,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101780352] [2025-03-04 07:33:04,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:04,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:04,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:04,348 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:33:04,350 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:33:04,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:33:04,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:33:04,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:04,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:04,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 07:33:04,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:04,592 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:33:04,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:04,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2025-03-04 07:33:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:33:05,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101780352] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:33:05,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:33:05,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2025-03-04 07:33:05,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513241136] [2025-03-04 07:33:05,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:05,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 07:33:05,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:05,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 07:33:05,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 07:33:05,117 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 35 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 32 states have internal predecessors, (56), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 07:33:05,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:05,715 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2025-03-04 07:33:05,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:33:05,716 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 32 states have internal predecessors, (56), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 40 [2025-03-04 07:33:05,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:05,717 INFO L225 Difference]: With dead ends: 141 [2025-03-04 07:33:05,717 INFO L226 Difference]: Without dead ends: 141 [2025-03-04 07:33:05,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=2001, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 07:33:05,718 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 131 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:05,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1031 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:33:05,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-04 07:33:05,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2025-03-04 07:33:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 108 states have internal predecessors, (122), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 07:33:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2025-03-04 07:33:05,721 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 40 [2025-03-04 07:33:05,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:05,722 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2025-03-04 07:33:05,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 32 states have internal predecessors, (56), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 07:33:05,722 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2025-03-04 07:33:05,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:33:05,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:05,723 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:05,729 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:33:05,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:05,923 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting upsweepErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:33:05,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:05,923 INFO L85 PathProgramCache]: Analyzing trace with hash -99570735, now seen corresponding path program 1 times [2025-03-04 07:33:05,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:05,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120451130] [2025-03-04 07:33:05,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:05,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:05,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:33:05,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:33:05,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:05,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:33:06,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:06,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120451130] [2025-03-04 07:33:06,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120451130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:06,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85217561] [2025-03-04 07:33:06,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:06,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:06,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:06,094 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:33:06,094 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:33:06,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:33:06,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:33:06,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:06,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:06,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:33:06,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:33:06,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:06,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-03-04 07:33:06,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:33:06,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85217561] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:33:06,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:33:06,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-03-04 07:33:06,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950756697] [2025-03-04 07:33:06,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:06,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 07:33:06,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:06,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 07:33:06,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:33:06,499 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand has 32 states, 28 states have (on average 2.107142857142857) internal successors, (59), 29 states have internal predecessors, (59), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 07:33:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:06,835 INFO L93 Difference]: Finished difference Result 140 states and 160 transitions. [2025-03-04 07:33:06,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:33:06,836 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 2.107142857142857) internal successors, (59), 29 states have internal predecessors, (59), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 41 [2025-03-04 07:33:06,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:06,837 INFO L225 Difference]: With dead ends: 140 [2025-03-04 07:33:06,837 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 07:33:06,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1286, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 07:33:06,837 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 71 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:06,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1087 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:33:06,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 07:33:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 125. [2025-03-04 07:33:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 104 states have internal predecessors, (114), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:33:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2025-03-04 07:33:06,843 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 41 [2025-03-04 07:33:06,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:06,843 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2025-03-04 07:33:06,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 2.107142857142857) internal successors, (59), 29 states have internal predecessors, (59), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 07:33:06,843 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2025-03-04 07:33:06,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:33:06,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:06,843 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:06,850 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:33:07,044 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,SelfDestructingSolverStorable12 [2025-03-04 07:33:07,044 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:33:07,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:07,044 INFO L85 PathProgramCache]: Analyzing trace with hash -156489966, now seen corresponding path program 3 times [2025-03-04 07:33:07,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:07,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117787064] [2025-03-04 07:33:07,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:33:07,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:07,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-03-04 07:33:07,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 41 statements. [2025-03-04 07:33:07,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 07:33:07,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 07:33:07,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:07,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117787064] [2025-03-04 07:33:07,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117787064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:07,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608178899] [2025-03-04 07:33:07,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:33:07,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:07,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:07,339 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:33:07,341 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:33:07,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-03-04 07:33:07,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 41 statements. [2025-03-04 07:33:07,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 07:33:07,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:07,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 07:33:07,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:07,430 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:33:07,433 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:33:07,532 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:33:07,532 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:33:07,543 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 16 treesize of output 11 [2025-03-04 07:33:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 07:33:07,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:08,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608178899] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:08,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:33:08,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2025-03-04 07:33:08,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418880027] [2025-03-04 07:33:08,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:08,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 07:33:08,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:08,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 07:33:08,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2025-03-04 07:33:08,222 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 07:33:08,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:08,909 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2025-03-04 07:33:08,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:33:08,909 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 41 [2025-03-04 07:33:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:08,910 INFO L225 Difference]: With dead ends: 124 [2025-03-04 07:33:08,910 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 07:33:08,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=252, Invalid=1230, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 07:33:08,910 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 161 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:08,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 342 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:33:08,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 07:33:08,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2025-03-04 07:33:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 98 states have internal predecessors, (107), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:33:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2025-03-04 07:33:08,917 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 41 [2025-03-04 07:33:08,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:08,917 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2025-03-04 07:33:08,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 07:33:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2025-03-04 07:33:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 07:33:08,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:08,917 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:08,923 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:33:09,122 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,SelfDestructingSolverStorable13 [2025-03-04 07:33:09,122 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting upsweepErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:33:09,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:09,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1196726076, now seen corresponding path program 1 times [2025-03-04 07:33:09,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:09,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865810003] [2025-03-04 07:33:09,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:09,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:09,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:33:09,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:33:09,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:09,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:09,196 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:33:09,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:09,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865810003] [2025-03-04 07:33:09,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865810003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:09,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122729135] [2025-03-04 07:33:09,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:09,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:09,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:09,199 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:33:09,201 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:33:09,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:33:09,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:33:09,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:09,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:09,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:33:09,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:09,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:33:09,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:33:09,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122729135] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:33:09,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:33:09,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2025-03-04 07:33:09,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855973633] [2025-03-04 07:33:09,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:09,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:33:09,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:09,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:33:09,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:33:09,383 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:33:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:09,457 INFO L93 Difference]: Finished difference Result 140 states and 160 transitions. [2025-03-04 07:33:09,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:33:09,457 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2025-03-04 07:33:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:09,458 INFO L225 Difference]: With dead ends: 140 [2025-03-04 07:33:09,458 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 07:33:09,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:33:09,459 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 26 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:09,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 685 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:33:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 07:33:09,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2025-03-04 07:33:09,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 110 states have internal predecessors, (119), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 07:33:09,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2025-03-04 07:33:09,462 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 43 [2025-03-04 07:33:09,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:09,462 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2025-03-04 07:33:09,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:33:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2025-03-04 07:33:09,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 07:33:09,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:09,463 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:09,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 07:33:09,667 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,SelfDestructingSolverStorable14 [2025-03-04 07:33:09,667 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting upsweepErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:33:09,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:09,667 INFO L85 PathProgramCache]: Analyzing trace with hash -141147200, now seen corresponding path program 2 times [2025-03-04 07:33:09,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:09,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351475432] [2025-03-04 07:33:09,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:33:09,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:09,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-04 07:33:09,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:33:09,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:33:09,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:33:09,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:09,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351475432] [2025-03-04 07:33:09,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351475432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:09,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862392976] [2025-03-04 07:33:09,787 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:33:09,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:09,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:09,790 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:33:09,791 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:33:09,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-04 07:33:09,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:33:09,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:33:09,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:09,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:33:09,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:33:09,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:33:10,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862392976] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:33:10,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:33:10,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 12] total 24 [2025-03-04 07:33:10,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454443277] [2025-03-04 07:33:10,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:10,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 07:33:10,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:10,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 07:33:10,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:33:10,132 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 07:33:10,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:10,362 INFO L93 Difference]: Finished difference Result 149 states and 170 transitions. [2025-03-04 07:33:10,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:33:10,362 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 47 [2025-03-04 07:33:10,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:10,363 INFO L225 Difference]: With dead ends: 149 [2025-03-04 07:33:10,363 INFO L226 Difference]: Without dead ends: 149 [2025-03-04 07:33:10,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:33:10,364 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 41 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:10,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1117 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:33:10,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-04 07:33:10,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2025-03-04 07:33:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 100 states have (on average 1.32) internal successors, (132), 122 states have internal predecessors, (132), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 07:33:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 162 transitions. [2025-03-04 07:33:10,367 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 162 transitions. Word has length 47 [2025-03-04 07:33:10,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:10,367 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 162 transitions. [2025-03-04 07:33:10,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 07:33:10,367 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 162 transitions. [2025-03-04 07:33:10,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 07:33:10,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:10,367 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:10,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 07:33:10,572 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,SelfDestructingSolverStorable15 [2025-03-04 07:33:10,572 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting downsweepErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:33:10,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1662116030, now seen corresponding path program 1 times [2025-03-04 07:33:10,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:10,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700445529] [2025-03-04 07:33:10,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:10,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:10,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 07:33:10,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 07:33:10,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:10,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:33:10,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:10,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700445529] [2025-03-04 07:33:10,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700445529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:33:10,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:33:10,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:33:10,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384817318] [2025-03-04 07:33:10,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:33:10,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:33:10,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:10,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:33:10,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:33:10,613 INFO L87 Difference]: Start difference. First operand 144 states and 162 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 07:33:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:10,681 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2025-03-04 07:33:10,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:33:10,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-03-04 07:33:10,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:10,683 INFO L225 Difference]: With dead ends: 139 [2025-03-04 07:33:10,683 INFO L226 Difference]: Without dead ends: 139 [2025-03-04 07:33:10,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:33:10,683 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 46 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:10,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 213 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:33:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-04 07:33:10,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-03-04 07:33:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 100 states have (on average 1.27) internal successors, (127), 117 states have internal predecessors, (127), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 07:33:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2025-03-04 07:33:10,688 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 49 [2025-03-04 07:33:10,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:10,688 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2025-03-04 07:33:10,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 07:33:10,688 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2025-03-04 07:33:10,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 07:33:10,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:10,688 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:10,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:33:10,688 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting downsweepErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:33:10,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:10,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1662116031, now seen corresponding path program 1 times [2025-03-04 07:33:10,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:10,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899994026] [2025-03-04 07:33:10,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:10,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:10,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 07:33:10,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 07:33:10,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:10,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:10,889 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:33:10,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:10,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899994026] [2025-03-04 07:33:10,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899994026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:10,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757063559] [2025-03-04 07:33:10,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:10,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:10,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:10,891 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:33:10,892 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:33:10,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 07:33:10,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 07:33:10,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:10,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:10,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 07:33:10,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:10,967 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:33:11,016 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:33:11,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-03-04 07:33:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:33:11,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:12,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757063559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:12,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:33:12,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2025-03-04 07:33:12,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208413647] [2025-03-04 07:33:12,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:12,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 07:33:12,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:12,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 07:33:12,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 07:33:12,183 INFO L87 Difference]: Start difference. First operand 139 states and 157 transitions. Second operand has 26 states, 25 states have (on average 2.36) internal successors, (59), 24 states have internal predecessors, (59), 8 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 07:33:14,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:14,647 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2025-03-04 07:33:14,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:33:14,648 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.36) internal successors, (59), 24 states have internal predecessors, (59), 8 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 49 [2025-03-04 07:33:14,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:14,648 INFO L225 Difference]: With dead ends: 163 [2025-03-04 07:33:14,649 INFO L226 Difference]: Without dead ends: 163 [2025-03-04 07:33:14,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=331, Invalid=2119, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 07:33:14,649 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 251 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:14,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 458 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:33:14,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-04 07:33:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 153. [2025-03-04 07:33:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 111 states have (on average 1.2702702702702702) internal successors, (141), 128 states have internal predecessors, (141), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 07:33:14,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 175 transitions. [2025-03-04 07:33:14,653 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 175 transitions. Word has length 49 [2025-03-04 07:33:14,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:14,654 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 175 transitions. [2025-03-04 07:33:14,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.36) internal successors, (59), 24 states have internal predecessors, (59), 8 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 07:33:14,654 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 175 transitions. [2025-03-04 07:33:14,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:33:14,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:14,654 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:14,661 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:33:14,859 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,SelfDestructingSolverStorable17 [2025-03-04 07:33:14,859 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting upsweepErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:33:14,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:14,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1084014404, now seen corresponding path program 3 times [2025-03-04 07:33:14,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:14,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91323863] [2025-03-04 07:33:14,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:33:14,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:14,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 5 equivalence classes. [2025-03-04 07:33:14,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 43 of 51 statements. [2025-03-04 07:33:14,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:33:14,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 07:33:15,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:15,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91323863] [2025-03-04 07:33:15,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91323863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:15,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355369288] [2025-03-04 07:33:15,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:33:15,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:15,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:15,160 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:33:15,161 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:33:15,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 5 equivalence classes. [2025-03-04 07:33:15,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 43 of 51 statements. [2025-03-04 07:33:15,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:33:15,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:15,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 07:33:15,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:33:15,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:16,141 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 50 treesize of output 46 [2025-03-04 07:33:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:33:16,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355369288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:33:16,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:33:16,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 41 [2025-03-04 07:33:16,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936957634] [2025-03-04 07:33:16,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:16,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 07:33:16,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:16,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 07:33:16,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1523, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 07:33:16,292 INFO L87 Difference]: Start difference. First operand 153 states and 175 transitions. Second operand has 42 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 15 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 07:33:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:17,015 INFO L93 Difference]: Finished difference Result 169 states and 194 transitions. [2025-03-04 07:33:17,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:33:17,016 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 15 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 51 [2025-03-04 07:33:17,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:17,017 INFO L225 Difference]: With dead ends: 169 [2025-03-04 07:33:17,017 INFO L226 Difference]: Without dead ends: 169 [2025-03-04 07:33:17,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=372, Invalid=2598, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 07:33:17,017 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 72 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:17,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1307 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:33:17,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-04 07:33:17,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2025-03-04 07:33:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 119 states have (on average 1.26890756302521) internal successors, (151), 136 states have internal predecessors, (151), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 07:33:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 189 transitions. [2025-03-04 07:33:17,021 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 189 transitions. Word has length 51 [2025-03-04 07:33:17,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:17,022 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 189 transitions. [2025-03-04 07:33:17,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 15 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 07:33:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 189 transitions. [2025-03-04 07:33:17,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 07:33:17,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:17,022 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:17,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 07:33:17,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:17,224 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting upsweepErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-04 07:33:17,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:17,224 INFO L85 PathProgramCache]: Analyzing trace with hash 755291816, now seen corresponding path program 1 times [2025-03-04 07:33:17,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:17,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283721167] [2025-03-04 07:33:17,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:17,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:17,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:33:17,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:33:17,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:17,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:17,496 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:33:17,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:17,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283721167] [2025-03-04 07:33:17,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283721167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:17,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69455331] [2025-03-04 07:33:17,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:17,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:17,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:17,498 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:33:17,500 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:33:17,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:33:17,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:33:17,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:17,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:17,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-04 07:33:17,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:17,599 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:33:17,603 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:33:17,673 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:33:17,673 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:33:17,678 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 18 treesize of output 13 [2025-03-04 07:33:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:33:47,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:48,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69455331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:48,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:33:48,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 34 [2025-03-04 07:33:48,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559120703] [2025-03-04 07:33:48,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:48,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 07:33:48,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:48,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 07:33:48,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2075, Unknown=7, NotChecked=0, Total=2352 [2025-03-04 07:33:48,182 INFO L87 Difference]: Start difference. First operand 164 states and 189 transitions. Second operand has 35 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 30 states have internal predecessors, (71), 10 states have call successors, (11), 7 states have call predecessors, (11), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 07:33:52,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:33:56,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:34:00,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:34:04,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]