./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/array-memsafety/cstrncpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/array-memsafety/cstrncpy-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:32:59,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:32:59,911 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:32:59,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:32:59,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:32:59,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:32:59,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:32:59,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:32:59,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:32:59,938 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:32:59,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:32:59,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:32:59,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:32:59,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:32:59,939 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:32:59,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:32:59,940 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:32:59,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:32:59,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:32:59,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:32:59,940 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:32:59,940 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:32:59,940 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:32:59,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:32:59,940 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:32:59,940 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:32:59,941 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:32:59,941 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:32:59,941 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:32:59,941 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:32:59,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:32:59,941 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:32:59,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:32:59,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:32:59,941 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:32:59,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:32:59,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:32:59,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:32:59,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:32:59,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:32:59,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:32:59,942 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:32:59,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:32:59,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:32:59,942 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:32:59,942 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:32:59,943 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 -> 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 [2025-04-30 10:33:00,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:33:00,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:33:00,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:33:00,189 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:33:00,190 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:33:00,191 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncpy-alloca-2.i [2025-04-30 10:33:01,442 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03ff89460/62910b3e019143a19c6c4fd7c95b8f58/FLAGf8b255bb7 [2025-04-30 10:33:01,659 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:33:01,662 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/cstrncpy-alloca-2.i [2025-04-30 10:33:01,670 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03ff89460/62910b3e019143a19c6c4fd7c95b8f58/FLAGf8b255bb7 [2025-04-30 10:33:02,492 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03ff89460/62910b3e019143a19c6c4fd7c95b8f58 [2025-04-30 10:33:02,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:33:02,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:33:02,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:33:02,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:33:02,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:33:02,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:33:02" (1/1) ... [2025-04-30 10:33:02,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ceac5b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:02, skipping insertion in model container [2025-04-30 10:33:02,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:33:02" (1/1) ... [2025-04-30 10:33:02,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:33:02,780 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-30 10:33:02,781 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-30 10:33:02,785 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:33:02,801 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:33:02,851 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:33:02,870 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:33:02,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:02 WrapperNode [2025-04-30 10:33:02,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:33:02,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:33:02,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:33:02,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:33:02,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:02" (1/1) ... [2025-04-30 10:33:02,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:02" (1/1) ... [2025-04-30 10:33:02,912 INFO L138 Inliner]: procedures = 117, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2025-04-30 10:33:02,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:33:02,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:33:02,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:33:02,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:33:02,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:02" (1/1) ... [2025-04-30 10:33:02,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:02" (1/1) ... [2025-04-30 10:33:02,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:02" (1/1) ... [2025-04-30 10:33:02,937 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [3, 2]. 60 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-04-30 10:33:02,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:02" (1/1) ... [2025-04-30 10:33:02,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:02" (1/1) ... [2025-04-30 10:33:02,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:02" (1/1) ... [2025-04-30 10:33:02,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:02" (1/1) ... [2025-04-30 10:33:02,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:02" (1/1) ... [2025-04-30 10:33:02,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:02" (1/1) ... [2025-04-30 10:33:02,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:02" (1/1) ... [2025-04-30 10:33:02,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:33:02,955 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:33:02,955 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:33:02,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:33:02,956 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:02" (1/1) ... [2025-04-30 10:33:02,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:33:02,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:02,982 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-04-30 10:33:02,984 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-04-30 10:33:03,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:33:03,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:33:03,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:33:03,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:33:03,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:33:03,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:33:03,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:33:03,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:33:03,079 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:33:03,080 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:33:03,198 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-04-30 10:33:03,198 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:33:03,205 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:33:03,206 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:33:03,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:33:03 BoogieIcfgContainer [2025-04-30 10:33:03,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:33:03,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:33:03,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:33:03,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:33:03,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:33:02" (1/3) ... [2025-04-30 10:33:03,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2679b78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:33:03, skipping insertion in model container [2025-04-30 10:33:03,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:02" (2/3) ... [2025-04-30 10:33:03,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2679b78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:33:03, skipping insertion in model container [2025-04-30 10:33:03,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:33:03" (3/3) ... [2025-04-30 10:33:03,214 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca-2.i [2025-04-30 10:33:03,224 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:33:03,225 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrncpy-alloca-2.i that has 1 procedures, 34 locations, 40 edges, 1 initial locations, 3 loop locations, and 11 error locations. [2025-04-30 10:33:03,256 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:33:03,265 INFO L340 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;@1fee5efc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:33:03,265 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-30 10:33:03,269 INFO L278 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:03,272 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:33:03,272 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:03,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:03,273 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:03,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:03,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028968, now seen corresponding path program 1 times [2025-04-30 10:33:03,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:03,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3867276] [2025-04-30 10:33:03,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:03,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:03,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:33:03,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:33:03,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:03,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:03,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:03,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:03,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3867276] [2025-04-30 10:33:03,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3867276] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:03,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:03,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:33:03,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091046139] [2025-04-30 10:33:03,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:03,487 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:33:03,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:03,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:33:03,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:03,503 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:03,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:03,540 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2025-04-30 10:33:03,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:33:03,542 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:33:03,542 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:03,546 INFO L225 Difference]: With dead ends: 39 [2025-04-30 10:33:03,546 INFO L226 Difference]: Without dead ends: 37 [2025-04-30 10:33:03,547 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:03,550 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:03,552 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 92 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-30 10:33:03,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-04-30 10:33:03,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-04-30 10:33:03,579 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 7 [2025-04-30 10:33:03,579 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:03,579 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-04-30 10:33:03,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:03,579 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-04-30 10:33:03,579 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:33:03,579 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:03,582 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:03,582 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:33:03,582 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:03,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:03,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029160, now seen corresponding path program 1 times [2025-04-30 10:33:03,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:03,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925476941] [2025-04-30 10:33:03,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:03,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:03,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:33:03,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:33:03,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:03,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:03,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:03,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:03,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925476941] [2025-04-30 10:33:03,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925476941] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:03,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:03,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:33:03,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925344969] [2025-04-30 10:33:03,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:03,696 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:33:03,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:03,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:33:03,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:33:03,697 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:03,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:03,719 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-04-30 10:33:03,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:33:03,720 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:33:03,720 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:03,720 INFO L225 Difference]: With dead ends: 33 [2025-04-30 10:33:03,720 INFO L226 Difference]: Without dead ends: 33 [2025-04-30 10:33:03,721 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:33:03,721 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:03,722 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 46 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-30 10:33:03,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-04-30 10:33:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.625) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-04-30 10:33:03,724 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2025-04-30 10:33:03,724 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:03,725 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-04-30 10:33:03,725 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:03,725 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-04-30 10:33:03,725 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:33:03,725 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:03,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:03,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:33:03,726 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:03,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:03,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029161, now seen corresponding path program 1 times [2025-04-30 10:33:03,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:03,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238400628] [2025-04-30 10:33:03,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:03,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:03,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:33:03,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:33:03,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:03,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:03,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:03,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238400628] [2025-04-30 10:33:03,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238400628] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:03,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:03,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:33:03,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746565262] [2025-04-30 10:33:03,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:03,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:33:03,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:03,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:33:03,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:03,923 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:03,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:03,937 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2025-04-30 10:33:03,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:33:03,938 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:33:03,938 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:03,938 INFO L225 Difference]: With dead ends: 34 [2025-04-30 10:33:03,938 INFO L226 Difference]: Without dead ends: 34 [2025-04-30 10:33:03,938 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:03,939 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:03,939 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:03,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-04-30 10:33:03,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-04-30 10:33:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.6) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2025-04-30 10:33:03,943 INFO L79 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 7 [2025-04-30 10:33:03,943 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:03,943 INFO L485 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-04-30 10:33:03,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:03,943 INFO L278 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2025-04-30 10:33:03,943 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:33:03,943 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:03,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:03,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:33:03,943 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:03,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:03,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876011, now seen corresponding path program 1 times [2025-04-30 10:33:03,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:03,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358762884] [2025-04-30 10:33:03,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:03,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:03,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:33:03,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:33:03,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:03,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:04,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:04,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358762884] [2025-04-30 10:33:04,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358762884] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:04,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:04,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:33:04,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763452231] [2025-04-30 10:33:04,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:04,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:33:04,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:04,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:33:04,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:04,077 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:04,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:04,137 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2025-04-30 10:33:04,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:04,138 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:33:04,138 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:04,138 INFO L225 Difference]: With dead ends: 37 [2025-04-30 10:33:04,138 INFO L226 Difference]: Without dead ends: 37 [2025-04-30 10:33:04,138 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:33:04,139 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:04,139 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 82 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-30 10:33:04,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2025-04-30 10:33:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-04-30 10:33:04,141 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 7 [2025-04-30 10:33:04,141 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:04,141 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-04-30 10:33:04,141 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:04,141 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-04-30 10:33:04,141 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:33:04,141 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:04,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:04,141 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:33:04,141 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:04,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:04,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876203, now seen corresponding path program 1 times [2025-04-30 10:33:04,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:04,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776267005] [2025-04-30 10:33:04,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:04,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:04,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:33:04,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:33:04,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:04,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:04,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:04,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:04,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776267005] [2025-04-30 10:33:04,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776267005] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:04,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:04,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:33:04,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321525161] [2025-04-30 10:33:04,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:04,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:33:04,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:04,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:33:04,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:04,276 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:04,300 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2025-04-30 10:33:04,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:04,300 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:33:04,300 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:04,301 INFO L225 Difference]: With dead ends: 38 [2025-04-30 10:33:04,301 INFO L226 Difference]: Without dead ends: 38 [2025-04-30 10:33:04,301 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:04,302 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:04,302 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 54 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:04,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-30 10:33:04,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-04-30 10:33:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-04-30 10:33:04,308 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 7 [2025-04-30 10:33:04,308 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:04,308 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-04-30 10:33:04,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:04,309 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-04-30 10:33:04,309 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:33:04,309 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:04,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:04,310 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:33:04,311 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:04,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:04,311 INFO L85 PathProgramCache]: Analyzing trace with hash 633158776, now seen corresponding path program 1 times [2025-04-30 10:33:04,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:04,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966227517] [2025-04-30 10:33:04,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:04,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:04,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:33:04,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:33:04,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:04,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:04,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:04,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966227517] [2025-04-30 10:33:04,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966227517] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:04,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:04,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:33:04,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755264124] [2025-04-30 10:33:04,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:04,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:33:04,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:04,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:33:04,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:04,394 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:04,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:04,439 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2025-04-30 10:33:04,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:04,440 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:33:04,440 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:04,440 INFO L225 Difference]: With dead ends: 35 [2025-04-30 10:33:04,440 INFO L226 Difference]: Without dead ends: 35 [2025-04-30 10:33:04,440 INFO L436 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-04-30 10:33:04,441 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:04,441 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 57 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:04,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-30 10:33:04,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-04-30 10:33:04,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-04-30 10:33:04,443 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 10 [2025-04-30 10:33:04,443 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:04,444 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-04-30 10:33:04,444 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:04,444 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-04-30 10:33:04,444 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:33:04,444 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:04,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:04,444 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:33:04,444 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:04,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:04,445 INFO L85 PathProgramCache]: Analyzing trace with hash 633158777, now seen corresponding path program 1 times [2025-04-30 10:33:04,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:04,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713393410] [2025-04-30 10:33:04,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:04,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:04,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:33:04,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:33:04,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:04,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:04,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:04,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713393410] [2025-04-30 10:33:04,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713393410] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:04,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:04,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:33:04,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864481172] [2025-04-30 10:33:04,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:04,567 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:33:04,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:04,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:33:04,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:04,568 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:04,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:04,629 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2025-04-30 10:33:04,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:33:04,629 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:33:04,629 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:04,629 INFO L225 Difference]: With dead ends: 39 [2025-04-30 10:33:04,629 INFO L226 Difference]: Without dead ends: 39 [2025-04-30 10:33:04,630 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:33:04,631 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:04,631 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 113 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-04-30 10:33:04,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2025-04-30 10:33:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:04,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-04-30 10:33:04,637 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 10 [2025-04-30 10:33:04,637 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:04,637 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-04-30 10:33:04,637 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:04,637 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-04-30 10:33:04,637 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:33:04,637 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:04,637 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:04,637 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:33:04,637 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:04,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:04,638 INFO L85 PathProgramCache]: Analyzing trace with hash -181913935, now seen corresponding path program 1 times [2025-04-30 10:33:04,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:04,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531007056] [2025-04-30 10:33:04,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:04,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:04,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:33:04,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:33:04,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:04,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:04,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:04,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531007056] [2025-04-30 10:33:04,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531007056] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:04,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818280925] [2025-04-30 10:33:04,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:04,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:04,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:04,797 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-04-30 10:33:04,815 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-04-30 10:33:04,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:33:04,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:33:04,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:04,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:04,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-30 10:33:04,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:04,914 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-04-30 10:33:04,925 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:33:05,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:05,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:05,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:05,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818280925] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:05,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:05,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-30 10:33:05,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384265428] [2025-04-30 10:33:05,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:05,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:33:05,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:05,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:33:05,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:33:05,161 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:05,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:05,293 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2025-04-30 10:33:05,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:33:05,293 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:33:05,293 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:05,293 INFO L225 Difference]: With dead ends: 38 [2025-04-30 10:33:05,293 INFO L226 Difference]: Without dead ends: 38 [2025-04-30 10:33:05,294 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:33:05,294 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:05,294 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 111 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:05,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-30 10:33:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2025-04-30 10:33:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2025-04-30 10:33:05,296 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 10 [2025-04-30 10:33:05,296 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:05,296 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-04-30 10:33:05,296 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:05,296 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2025-04-30 10:33:05,296 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:33:05,296 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:05,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:05,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:33:05,501 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:05,501 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:05,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:05,501 INFO L85 PathProgramCache]: Analyzing trace with hash -181913743, now seen corresponding path program 1 times [2025-04-30 10:33:05,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:05,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590178] [2025-04-30 10:33:05,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:05,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:05,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:33:05,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:33:05,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:05,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:05,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:05,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:05,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590178] [2025-04-30 10:33:05,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590178] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:05,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:05,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:33:05,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589190915] [2025-04-30 10:33:05,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:05,698 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:33:05,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:05,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:33:05,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:05,698 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:05,735 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2025-04-30 10:33:05,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:33:05,735 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:33:05,735 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:05,736 INFO L225 Difference]: With dead ends: 34 [2025-04-30 10:33:05,736 INFO L226 Difference]: Without dead ends: 34 [2025-04-30 10:33:05,737 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:05,737 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:05,737 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:05,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-04-30 10:33:05,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-04-30 10:33:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.5) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-04-30 10:33:05,739 INFO L79 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 10 [2025-04-30 10:33:05,739 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:05,739 INFO L485 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-04-30 10:33:05,739 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:05,739 INFO L278 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-04-30 10:33:05,739 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:33:05,739 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:05,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:05,739 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:33:05,739 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:05,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:05,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1846914417, now seen corresponding path program 1 times [2025-04-30 10:33:05,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:05,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319438573] [2025-04-30 10:33:05,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:05,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:05,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:33:05,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:33:05,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:05,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:05,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:05,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:05,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319438573] [2025-04-30 10:33:05,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319438573] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:05,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:05,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:33:05,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135554388] [2025-04-30 10:33:05,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:05,823 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:33:05,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:05,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:33:05,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:33:05,824 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:05,866 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2025-04-30 10:33:05,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:05,867 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-30 10:33:05,867 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:05,867 INFO L225 Difference]: With dead ends: 33 [2025-04-30 10:33:05,867 INFO L226 Difference]: Without dead ends: 33 [2025-04-30 10:33:05,867 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:05,869 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:05,869 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 75 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-30 10:33:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-04-30 10:33:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-04-30 10:33:05,870 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 11 [2025-04-30 10:33:05,870 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:05,870 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-04-30 10:33:05,871 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:05,871 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-04-30 10:33:05,872 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:33:05,872 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:05,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:05,872 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:33:05,872 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:05,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:05,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1846914416, now seen corresponding path program 1 times [2025-04-30 10:33:05,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:05,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852851227] [2025-04-30 10:33:05,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:05,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:05,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:33:05,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:33:05,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:05,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:06,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:06,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852851227] [2025-04-30 10:33:06,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852851227] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:06,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:06,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:33:06,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266178379] [2025-04-30 10:33:06,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:06,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:33:06,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:06,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:33:06,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:33:06,003 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:06,038 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2025-04-30 10:33:06,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:33:06,038 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-30 10:33:06,039 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:06,039 INFO L225 Difference]: With dead ends: 44 [2025-04-30 10:33:06,039 INFO L226 Difference]: Without dead ends: 44 [2025-04-30 10:33:06,039 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:33:06,039 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:06,039 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:06,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-30 10:33:06,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-04-30 10:33:06,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-04-30 10:33:06,041 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 11 [2025-04-30 10:33:06,041 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:06,041 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-04-30 10:33:06,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,041 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-04-30 10:33:06,043 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:33:06,043 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:06,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:06,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:33:06,044 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:06,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:06,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1638706254, now seen corresponding path program 1 times [2025-04-30 10:33:06,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:06,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145503339] [2025-04-30 10:33:06,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:06,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:06,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:33:06,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:33:06,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:06,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:06,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:06,204 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145503339] [2025-04-30 10:33:06,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145503339] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:06,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:06,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:33:06,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689911983] [2025-04-30 10:33:06,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:06,204 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:33:06,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:06,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:33:06,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:06,205 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:06,240 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2025-04-30 10:33:06,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:33:06,240 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-30 10:33:06,241 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:06,241 INFO L225 Difference]: With dead ends: 45 [2025-04-30 10:33:06,241 INFO L226 Difference]: Without dead ends: 45 [2025-04-30 10:33:06,241 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:06,241 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:06,241 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 73 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:06,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-30 10:33:06,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2025-04-30 10:33:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-04-30 10:33:06,243 INFO L79 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 11 [2025-04-30 10:33:06,243 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:06,243 INFO L485 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-04-30 10:33:06,243 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,243 INFO L278 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-04-30 10:33:06,243 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:33:06,243 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:06,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:06,243 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:33:06,243 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:06,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:06,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1418847590, now seen corresponding path program 1 times [2025-04-30 10:33:06,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:06,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818362938] [2025-04-30 10:33:06,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:06,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:06,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:33:06,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:33:06,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:06,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:06,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:06,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818362938] [2025-04-30 10:33:06,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818362938] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:06,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:06,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:33:06,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212227199] [2025-04-30 10:33:06,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:06,276 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:33:06,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:06,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:33:06,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:06,277 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:06,287 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-04-30 10:33:06,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:33:06,287 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-30 10:33:06,287 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:06,287 INFO L225 Difference]: With dead ends: 32 [2025-04-30 10:33:06,287 INFO L226 Difference]: Without dead ends: 32 [2025-04-30 10:33:06,288 INFO L436 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-04-30 10:33:06,288 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:06,289 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 73 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:06,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-30 10:33:06,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-04-30 10:33:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-04-30 10:33:06,291 INFO L79 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 12 [2025-04-30 10:33:06,291 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:06,291 INFO L485 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-04-30 10:33:06,291 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,291 INFO L278 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-04-30 10:33:06,292 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:33:06,292 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:06,292 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:06,292 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:33:06,292 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:06,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:06,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1398662098, now seen corresponding path program 1 times [2025-04-30 10:33:06,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:06,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249846483] [2025-04-30 10:33:06,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:06,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:06,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:33:06,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:33:06,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:06,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:06,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:06,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:06,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249846483] [2025-04-30 10:33:06,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249846483] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:06,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:06,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:33:06,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968935585] [2025-04-30 10:33:06,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:06,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:33:06,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:06,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:33:06,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:06,341 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:06,354 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-04-30 10:33:06,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:06,355 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-30 10:33:06,355 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:06,355 INFO L225 Difference]: With dead ends: 45 [2025-04-30 10:33:06,355 INFO L226 Difference]: Without dead ends: 45 [2025-04-30 10:33:06,355 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:06,356 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:06,357 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 74 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:06,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-30 10:33:06,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-04-30 10:33:06,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-04-30 10:33:06,361 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 14 [2025-04-30 10:33:06,361 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:06,361 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-04-30 10:33:06,361 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,361 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-04-30 10:33:06,361 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:33:06,361 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:06,361 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:06,362 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:33:06,362 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:06,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:06,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2099726676, now seen corresponding path program 1 times [2025-04-30 10:33:06,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:06,362 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466581235] [2025-04-30 10:33:06,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:06,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:06,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:33:06,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:33:06,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:06,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:06,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:06,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:06,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466581235] [2025-04-30 10:33:06,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466581235] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:06,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:06,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:33:06,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838294721] [2025-04-30 10:33:06,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:06,490 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:33:06,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:06,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:33:06,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:33:06,490 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:06,525 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2025-04-30 10:33:06,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:33:06,526 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-30 10:33:06,526 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:06,527 INFO L225 Difference]: With dead ends: 57 [2025-04-30 10:33:06,527 INFO L226 Difference]: Without dead ends: 57 [2025-04-30 10:33:06,527 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:33:06,528 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:06,528 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 126 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:06,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-30 10:33:06,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2025-04-30 10:33:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-04-30 10:33:06,531 INFO L79 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 14 [2025-04-30 10:33:06,531 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:06,531 INFO L485 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-04-30 10:33:06,531 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,531 INFO L278 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-04-30 10:33:06,532 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:33:06,532 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:06,532 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:06,532 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:33:06,532 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:06,532 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:06,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1937075182, now seen corresponding path program 1 times [2025-04-30 10:33:06,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:06,533 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423974947] [2025-04-30 10:33:06,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:06,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:06,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:33:06,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:33:06,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:06,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:06,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:06,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423974947] [2025-04-30 10:33:06,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423974947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:06,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:06,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:33:06,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009098008] [2025-04-30 10:33:06,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:06,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:33:06,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:06,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:33:06,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:33:06,681 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:06,732 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2025-04-30 10:33:06,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:33:06,733 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-30 10:33:06,733 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:06,733 INFO L225 Difference]: With dead ends: 67 [2025-04-30 10:33:06,733 INFO L226 Difference]: Without dead ends: 67 [2025-04-30 10:33:06,733 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:33:06,734 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:06,734 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 127 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:06,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-30 10:33:06,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2025-04-30 10:33:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.326086956521739) internal successors, (61), 50 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2025-04-30 10:33:06,736 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 14 [2025-04-30 10:33:06,736 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:06,736 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-04-30 10:33:06,736 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,736 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2025-04-30 10:33:06,736 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:33:06,736 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:06,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:06,736 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:33:06,736 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:06,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:06,737 INFO L85 PathProgramCache]: Analyzing trace with hash -227632895, now seen corresponding path program 1 times [2025-04-30 10:33:06,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:06,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313782193] [2025-04-30 10:33:06,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:06,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:06,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:33:06,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:33:06,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:06,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:06,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:06,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313782193] [2025-04-30 10:33:06,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313782193] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:06,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:06,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:33:06,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208317119] [2025-04-30 10:33:06,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:06,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:33:06,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:06,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:33:06,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:33:06,796 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:06,842 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2025-04-30 10:33:06,842 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:33:06,842 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-30 10:33:06,842 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:06,842 INFO L225 Difference]: With dead ends: 52 [2025-04-30 10:33:06,842 INFO L226 Difference]: Without dead ends: 52 [2025-04-30 10:33:06,843 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:33:06,843 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:06,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 82 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:06,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-30 10:33:06,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2025-04-30 10:33:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2025-04-30 10:33:06,845 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 16 [2025-04-30 10:33:06,845 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:06,845 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2025-04-30 10:33:06,845 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,845 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2025-04-30 10:33:06,846 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:33:06,846 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:06,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:06,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:33:06,846 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:06,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:06,846 INFO L85 PathProgramCache]: Analyzing trace with hash -227632894, now seen corresponding path program 1 times [2025-04-30 10:33:06,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:06,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226562720] [2025-04-30 10:33:06,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:06,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:06,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:33:06,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:33:06,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:06,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:06,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:06,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226562720] [2025-04-30 10:33:06,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226562720] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:06,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:06,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:33:06,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778133563] [2025-04-30 10:33:06,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:06,906 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:33:06,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:06,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:33:06,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:06,907 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:06,933 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2025-04-30 10:33:06,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:33:06,933 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-30 10:33:06,933 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:06,933 INFO L225 Difference]: With dead ends: 60 [2025-04-30 10:33:06,933 INFO L226 Difference]: Without dead ends: 60 [2025-04-30 10:33:06,934 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:06,934 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:06,934 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:06,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-30 10:33:06,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-04-30 10:33:06,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2025-04-30 10:33:06,936 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 16 [2025-04-30 10:33:06,936 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:06,936 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2025-04-30 10:33:06,936 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,936 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2025-04-30 10:33:06,937 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:33:06,937 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:06,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:06,937 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:33:06,937 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:06,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash -814438908, now seen corresponding path program 1 times [2025-04-30 10:33:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:06,938 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893387616] [2025-04-30 10:33:06,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:06,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:06,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:33:06,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:33:06,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:06,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:07,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:07,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:07,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893387616] [2025-04-30 10:33:07,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893387616] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:07,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:07,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-30 10:33:07,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771420934] [2025-04-30 10:33:07,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:07,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:33:07,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:07,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:33:07,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:33:07,258 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:07,368 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2025-04-30 10:33:07,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:33:07,368 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-30 10:33:07,368 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:07,369 INFO L225 Difference]: With dead ends: 64 [2025-04-30 10:33:07,369 INFO L226 Difference]: Without dead ends: 64 [2025-04-30 10:33:07,369 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:33:07,370 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:07,371 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 95 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:07,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-04-30 10:33:07,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-04-30 10:33:07,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 60 states have (on average 1.25) internal successors, (75), 63 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:07,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2025-04-30 10:33:07,377 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 16 [2025-04-30 10:33:07,377 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:07,377 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2025-04-30 10:33:07,377 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:07,377 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2025-04-30 10:33:07,377 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:33:07,377 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:07,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:07,378 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:33:07,378 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:07,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:07,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1533386402, now seen corresponding path program 1 times [2025-04-30 10:33:07,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:07,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604891956] [2025-04-30 10:33:07,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:07,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:07,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:33:07,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:33:07,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:07,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:07,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:07,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604891956] [2025-04-30 10:33:07,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604891956] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:07,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:07,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:33:07,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390945685] [2025-04-30 10:33:07,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:07,456 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:33:07,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:07,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:33:07,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:07,456 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:07,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:07,469 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2025-04-30 10:33:07,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:33:07,470 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-30 10:33:07,470 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:07,470 INFO L225 Difference]: With dead ends: 63 [2025-04-30 10:33:07,470 INFO L226 Difference]: Without dead ends: 38 [2025-04-30 10:33:07,470 INFO L436 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-04-30 10:33:07,471 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:07,471 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-30 10:33:07,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-04-30 10:33:07,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-04-30 10:33:07,472 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 17 [2025-04-30 10:33:07,472 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:07,472 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-04-30 10:33:07,472 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:07,472 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-04-30 10:33:07,473 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:33:07,473 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:07,473 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:07,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:33:07,473 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:07,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:07,473 INFO L85 PathProgramCache]: Analyzing trace with hash -718311992, now seen corresponding path program 1 times [2025-04-30 10:33:07,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:07,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263059129] [2025-04-30 10:33:07,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:07,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:07,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:33:07,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:33:07,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:07,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:07,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:07,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:07,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263059129] [2025-04-30 10:33:07,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263059129] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:07,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587560269] [2025-04-30 10:33:07,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:07,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:07,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:07,652 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-04-30 10:33:07,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-04-30 10:33:07,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:33:07,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:33:07,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:07,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:07,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-30 10:33:07,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:07,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:07,895 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:33:07,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:07,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587560269] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:07,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:07,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-04-30 10:33:07,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958964815] [2025-04-30 10:33:07,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:07,917 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-30 10:33:07,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:07,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-30 10:33:07,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:33:07,919 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:08,070 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-04-30 10:33:08,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:33:08,070 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-30 10:33:08,070 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:08,071 INFO L225 Difference]: With dead ends: 52 [2025-04-30 10:33:08,071 INFO L226 Difference]: Without dead ends: 52 [2025-04-30 10:33:08,071 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:33:08,072 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 17 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:08,072 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 189 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:08,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-30 10:33:08,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2025-04-30 10:33:08,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:08,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-04-30 10:33:08,074 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 17 [2025-04-30 10:33:08,074 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:08,074 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-04-30 10:33:08,074 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:08,074 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-04-30 10:33:08,074 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:33:08,074 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:08,074 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:08,085 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-04-30 10:33:08,275 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-30 10:33:08,275 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:08,275 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:08,275 INFO L85 PathProgramCache]: Analyzing trace with hash -792835295, now seen corresponding path program 1 times [2025-04-30 10:33:08,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:08,275 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159426170] [2025-04-30 10:33:08,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:08,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:08,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:33:08,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:33:08,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:08,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:08,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:08,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159426170] [2025-04-30 10:33:08,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159426170] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:08,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099917750] [2025-04-30 10:33:08,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:08,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:08,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:08,483 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-04-30 10:33:08,485 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-04-30 10:33:08,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:33:08,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:33:08,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:08,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:08,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-30 10:33:08,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:08,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:33:08,580 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-04-30 10:33:08,586 INFO L354 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 10 treesize of output 8 [2025-04-30 10:33:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:08,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:08,929 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:33:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:08,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099917750] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:08,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:08,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-04-30 10:33:08,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599326896] [2025-04-30 10:33:08,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:08,958 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-30 10:33:08,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:08,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-30 10:33:08,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:33:08,958 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:09,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:09,087 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2025-04-30 10:33:09,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:33:09,090 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-30 10:33:09,091 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:09,091 INFO L225 Difference]: With dead ends: 41 [2025-04-30 10:33:09,091 INFO L226 Difference]: Without dead ends: 41 [2025-04-30 10:33:09,091 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:33:09,092 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:09,092 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 114 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:09,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-04-30 10:33:09,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2025-04-30 10:33:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2025-04-30 10:33:09,095 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 18 [2025-04-30 10:33:09,095 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:09,096 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-04-30 10:33:09,096 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:09,096 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2025-04-30 10:33:09,096 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-30 10:33:09,096 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:09,096 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:09,102 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-04-30 10:33:09,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:09,297 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:09,297 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:09,297 INFO L85 PathProgramCache]: Analyzing trace with hash 417561768, now seen corresponding path program 1 times [2025-04-30 10:33:09,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:09,297 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939121016] [2025-04-30 10:33:09,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:09,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:09,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:33:09,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:33:09,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:09,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:09,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:09,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939121016] [2025-04-30 10:33:09,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939121016] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:09,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194539141] [2025-04-30 10:33:09,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:09,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:09,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:09,768 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-04-30 10:33:09,769 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-04-30 10:33:09,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:33:09,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:33:09,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:09,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:09,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-04-30 10:33:09,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:09,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:33:09,854 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-04-30 10:33:09,858 INFO L354 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 10 treesize of output 8 [2025-04-30 10:33:10,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:10,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:10,910 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:33:10,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:10,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194539141] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:10,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:10,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2025-04-30 10:33:10,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361458334] [2025-04-30 10:33:10,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:10,973 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-30 10:33:10,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:10,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-30 10:33:10,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1477, Unknown=0, NotChecked=0, Total=1640 [2025-04-30 10:33:10,974 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 41 states, 40 states have (on average 1.45) internal successors, (58), 41 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:11,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:11,919 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2025-04-30 10:33:11,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-30 10:33:11,919 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.45) internal successors, (58), 41 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-30 10:33:11,919 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:11,920 INFO L225 Difference]: With dead ends: 81 [2025-04-30 10:33:11,920 INFO L226 Difference]: Without dead ends: 81 [2025-04-30 10:33:11,921 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=374, Invalid=3532, Unknown=0, NotChecked=0, Total=3906 [2025-04-30 10:33:11,922 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 39 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:11,922 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 125 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:33:11,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-04-30 10:33:11,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 66. [2025-04-30 10:33:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 64 states have (on average 1.1875) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2025-04-30 10:33:11,925 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 20 [2025-04-30 10:33:11,925 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:11,925 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2025-04-30 10:33:11,925 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.45) internal successors, (58), 41 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:11,925 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2025-04-30 10:33:11,925 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:33:11,925 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:11,925 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:11,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:33:12,126 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:12,127 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:12,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:12,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1331112543, now seen corresponding path program 2 times [2025-04-30 10:33:12,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:12,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232702818] [2025-04-30 10:33:12,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:12,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:12,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-30 10:33:12,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:33:12,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:12,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:12,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:12,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232702818] [2025-04-30 10:33:12,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232702818] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:12,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788148220] [2025-04-30 10:33:12,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:12,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:12,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:12,367 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-04-30 10:33:12,369 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-04-30 10:33:12,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-30 10:33:12,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:33:12,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:12,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:12,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-30 10:33:12,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:12,484 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:33:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:12,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:12,557 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-30 10:33:12,558 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-04-30 10:33:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:12,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788148220] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:12,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:12,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 23 [2025-04-30 10:33:12,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044052821] [2025-04-30 10:33:12,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:12,594 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:33:12,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:12,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:33:12,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:33:12,595 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:12,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:12,803 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2025-04-30 10:33:12,804 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:33:12,804 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-30 10:33:12,804 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:12,804 INFO L225 Difference]: With dead ends: 106 [2025-04-30 10:33:12,804 INFO L226 Difference]: Without dead ends: 106 [2025-04-30 10:33:12,805 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2025-04-30 10:33:12,805 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:12,805 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 264 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:12,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-30 10:33:12,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2025-04-30 10:33:12,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 78 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:12,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2025-04-30 10:33:12,807 INFO L79 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 21 [2025-04-30 10:33:12,807 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:12,807 INFO L485 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2025-04-30 10:33:12,807 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:12,807 INFO L278 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2025-04-30 10:33:12,807 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:33:12,807 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:12,807 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:12,815 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-04-30 10:33:13,007 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-30 10:33:13,008 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:13,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:13,008 INFO L85 PathProgramCache]: Analyzing trace with hash -526138581, now seen corresponding path program 3 times [2025-04-30 10:33:13,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:13,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981916532] [2025-04-30 10:33:13,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:33:13,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:13,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-04-30 10:33:13,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:33:13,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:33:13,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:13,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:13,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981916532] [2025-04-30 10:33:13,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981916532] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:13,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672534351] [2025-04-30 10:33:13,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:33:13,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:13,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:13,246 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-04-30 10:33:13,247 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-04-30 10:33:13,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-04-30 10:33:13,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:33:13,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:33:13,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:13,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-30 10:33:13,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:13,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:13,545 INFO L354 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 21 treesize of output 17 [2025-04-30 10:33:13,618 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:13,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672534351] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:13,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:13,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2025-04-30 10:33:13,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816203984] [2025-04-30 10:33:13,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:13,619 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-30 10:33:13,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:13,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-30 10:33:13,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:33:13,619 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:13,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:13,827 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2025-04-30 10:33:13,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:33:13,827 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-30 10:33:13,827 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:13,827 INFO L225 Difference]: With dead ends: 121 [2025-04-30 10:33:13,828 INFO L226 Difference]: Without dead ends: 121 [2025-04-30 10:33:13,828 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2025-04-30 10:33:13,828 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 20 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:13,828 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 341 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:33:13,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-04-30 10:33:13,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 79. [2025-04-30 10:33:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 78 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:13,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2025-04-30 10:33:13,830 INFO L79 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 24 [2025-04-30 10:33:13,830 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:13,830 INFO L485 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2025-04-30 10:33:13,830 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:13,830 INFO L278 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2025-04-30 10:33:13,830 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:33:13,831 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:13,831 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:13,837 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-04-30 10:33:14,031 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:14,031 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:14,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:14,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1789017724, now seen corresponding path program 4 times [2025-04-30 10:33:14,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:14,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307671848] [2025-04-30 10:33:14,032 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:33:14,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:14,038 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-30 10:33:14,050 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-04-30 10:33:14,050 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:33:14,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:33:14,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:14,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307671848] [2025-04-30 10:33:14,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307671848] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:14,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949400265] [2025-04-30 10:33:14,513 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:33:14,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:14,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:14,515 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-04-30 10:33:14,516 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-04-30 10:33:14,566 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-30 10:33:14,585 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-04-30 10:33:14,585 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:33:14,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:14,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-30 10:33:14,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:14,613 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-04-30 10:33:15,271 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:33:15,272 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 122 [2025-04-30 10:33:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:33:15,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:15,875 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-04-30 10:33:15,881 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2025-04-30 10:33:15,888 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:33:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:33:15,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949400265] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:15,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:15,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 36 [2025-04-30 10:33:15,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222321248] [2025-04-30 10:33:15,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:15,917 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-30 10:33:15,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:15,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-30 10:33:15,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2025-04-30 10:33:15,918 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:16,277 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2025-04-30 10:33:16,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:33:16,277 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-30 10:33:16,277 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:16,278 INFO L225 Difference]: With dead ends: 78 [2025-04-30 10:33:16,278 INFO L226 Difference]: Without dead ends: 78 [2025-04-30 10:33:16,278 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=227, Invalid=1333, Unknown=0, NotChecked=0, Total=1560 [2025-04-30 10:33:16,278 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:16,278 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:33:16,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-30 10:33:16,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-04-30 10:33:16,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 77 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:16,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2025-04-30 10:33:16,280 INFO L79 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 28 [2025-04-30 10:33:16,280 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:16,280 INFO L485 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2025-04-30 10:33:16,280 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:16,280 INFO L278 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2025-04-30 10:33:16,280 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:33:16,280 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:16,280 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:16,288 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-04-30 10:33:16,480 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:16,481 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:16,481 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:16,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2062144893, now seen corresponding path program 1 times [2025-04-30 10:33:16,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:16,481 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81435797] [2025-04-30 10:33:16,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:16,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:16,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:33:16,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:33:16,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:16,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:17,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:17,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81435797] [2025-04-30 10:33:17,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81435797] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:17,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478133355] [2025-04-30 10:33:17,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:17,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:17,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:17,065 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-04-30 10:33:17,066 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-04-30 10:33:17,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:33:17,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:33:17,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:17,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:17,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-04-30 10:33:17,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:17,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:33:17,157 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-04-30 10:33:17,167 INFO L354 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 10 treesize of output 8 [2025-04-30 10:33:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:17,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:18,719 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:33:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:18,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478133355] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:18,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:18,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 59 [2025-04-30 10:33:18,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68862707] [2025-04-30 10:33:18,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:18,769 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-04-30 10:33:18,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:18,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-04-30 10:33:18,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=3183, Unknown=0, NotChecked=0, Total=3540 [2025-04-30 10:33:18,770 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 60 states, 59 states have (on average 1.7457627118644068) internal successors, (103), 60 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:20,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:20,507 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2025-04-30 10:33:20,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-04-30 10:33:20,507 INFO L79 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.7457627118644068) internal successors, (103), 60 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-30 10:33:20,507 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:20,508 INFO L225 Difference]: With dead ends: 142 [2025-04-30 10:33:20,508 INFO L226 Difference]: Without dead ends: 142 [2025-04-30 10:33:20,510 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2711 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1104, Invalid=9198, Unknown=0, NotChecked=0, Total=10302 [2025-04-30 10:33:20,510 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:20,510 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 219 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:33:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-04-30 10:33:20,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 94. [2025-04-30 10:33:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.096774193548387) internal successors, (102), 93 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:20,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2025-04-30 10:33:20,513 INFO L79 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 35 [2025-04-30 10:33:20,513 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:20,513 INFO L485 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2025-04-30 10:33:20,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 1.7457627118644068) internal successors, (103), 60 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:20,513 INFO L278 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2025-04-30 10:33:20,513 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-30 10:33:20,513 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:20,513 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:20,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-30 10:33:20,714 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-30 10:33:20,714 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:33:20,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:20,714 INFO L85 PathProgramCache]: Analyzing trace with hash 967926584, now seen corresponding path program 2 times [2025-04-30 10:33:20,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:20,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518268202] [2025-04-30 10:33:20,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:20,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:20,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-30 10:33:20,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:33:20,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:20,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 38 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:21,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:21,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518268202] [2025-04-30 10:33:21,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518268202] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:21,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249936375] [2025-04-30 10:33:21,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:21,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:21,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:21,654 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-04-30 10:33:21,654 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-04-30 10:33:21,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-30 10:33:21,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:33:21,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:21,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:21,731 WARN L254 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 123 conjuncts are in the unsatisfiable core [2025-04-30 10:33:21,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:21,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:33:21,757 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-04-30 10:33:21,761 INFO L354 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 10 treesize of output 8 [2025-04-30 10:33:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:22,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:23,825 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:33:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:23,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249936375] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:23,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:23,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 25] total 76 [2025-04-30 10:33:23,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085023856] [2025-04-30 10:33:23,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:23,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-04-30 10:33:23,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:23,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-04-30 10:33:23,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=694, Invalid=5158, Unknown=0, NotChecked=0, Total=5852 [2025-04-30 10:33:23,898 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 77 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:25,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:25,235 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2025-04-30 10:33:25,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-30 10:33:25,235 INFO L79 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-30 10:33:25,235 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:25,235 INFO L225 Difference]: With dead ends: 137 [2025-04-30 10:33:25,235 INFO L226 Difference]: Without dead ends: 0 [2025-04-30 10:33:25,237 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3603 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1385, Invalid=10171, Unknown=0, NotChecked=0, Total=11556 [2025-04-30 10:33:25,238 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:25,238 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 219 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:33:25,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-30 10:33:25,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-30 10:33:25,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:25,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-30 10:33:25,238 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2025-04-30 10:33:25,238 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:25,238 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-30 10:33:25,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:25,239 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-30 10:33:25,239 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-30 10:33:25,241 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 11 remaining) [2025-04-30 10:33:25,241 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2025-04-30 10:33:25,241 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2025-04-30 10:33:25,241 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2025-04-30 10:33:25,241 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 11 remaining) [2025-04-30 10:33:25,241 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2025-04-30 10:33:25,241 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2025-04-30 10:33:25,242 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 11 remaining) [2025-04-30 10:33:25,242 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2025-04-30 10:33:25,242 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2025-04-30 10:33:25,242 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2025-04-30 10:33:25,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-30 10:33:25,443 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-30 10:33:25,446 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:25,447 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:33:25,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:33:25 BoogieIcfgContainer [2025-04-30 10:33:25,449 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:33:25,449 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:33:25,449 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:33:25,449 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:33:25,450 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:33:03" (3/4) ... [2025-04-30 10:33:25,451 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:33:25,457 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-04-30 10:33:25,457 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-30 10:33:25,457 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-30 10:33:25,457 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-30 10:33:25,506 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:33:25,506 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:33:25,507 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:33:25,507 INFO L158 Benchmark]: Toolchain (without parser) took 23011.76ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 111.4MB in the beginning and 263.2MB in the end (delta: -151.8MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2025-04-30 10:33:25,507 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:33:25,508 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.93ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 91.7MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:33:25,508 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.73ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:33:25,508 INFO L158 Benchmark]: Boogie Preprocessor took 35.30ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 87.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:33:25,508 INFO L158 Benchmark]: RCFGBuilder took 252.11ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 73.0MB in the end (delta: 14.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:33:25,509 INFO L158 Benchmark]: TraceAbstraction took 22240.43ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 72.5MB in the beginning and 267.1MB in the end (delta: -194.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:33:25,509 INFO L158 Benchmark]: Witness Printer took 57.38ms. Allocated memory is still 335.5MB. Free memory was 267.1MB in the beginning and 263.2MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:33:25,510 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.93ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 91.7MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.73ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.30ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 87.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 252.11ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 73.0MB in the end (delta: 14.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 22240.43ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 72.5MB in the beginning and 267.1MB in the end (delta: -194.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 57.38ms. Allocated memory is still 335.5MB. Free memory was 267.1MB in the beginning and 263.2MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 40 edges, 11 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 28, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 305 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 305 mSDsluCounter, 3352 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2736 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5265 IncrementalHoareTripleChecker+Invalid, 5343 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 616 mSDtfsCounter, 5265 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 748 GetRequests, 244 SyntacticMatches, 6 SemanticMatches, 498 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8057 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=27, InterpolantAutomatonStates: 362, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 199 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 635 NumberOfCodeBlocks, 627 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 798 ConstructedInterpolants, 13 QuantifiedInterpolants, 11706 SizeOfPredicates, 76 NumberOfNonLiveVariables, 1576 ConjunctsInSsa, 525 ConjunctsInUnsatCore, 46 InterpolantComputations, 19 PerfectInterpolantSequences, 91/448 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-30 10:33:25,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE