./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/termination-memory-alloca/cstrncpy-alloca-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/cstrncpy-alloca-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 1c4390c201109e5dfa22b495838f4d916d815af86354d765dc56c30a1aeccfb3 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:28:13,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:28:13,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-04-29 11:28:13,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:28:13,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:28:13,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:28:13,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:28:13,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:28:13,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:28:13,547 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:28:13,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:28:13,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:28:13,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:28:13,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:28:13,549 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:28:13,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:28:13,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:28:13,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:28:13,549 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:28:13,549 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:28:13,549 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:28:13,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:28:13,549 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:28:13,549 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:28:13,549 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:28:13,549 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:28:13,549 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:28:13,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:28:13,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:28:13,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:28:13,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:28:13,550 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:28:13,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:28:13,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:28:13,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:28:13,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:28:13,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:28:13,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:28:13,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:28:13,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:28:13,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:28:13,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:28:13,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:28:13,550 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c4390c201109e5dfa22b495838f4d916d815af86354d765dc56c30a1aeccfb3 [2025-04-29 11:28:13,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:28:13,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:28:13,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:28:13,778 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:28:13,778 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:28:13,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/termination-memory-alloca/cstrncpy-alloca-1.c [2025-04-29 11:28:15,084 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dd18b0c9/a2da6f7f25be497389c720497ad40bc1/FLAG8e2f208ee [2025-04-29 11:28:15,275 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:28:15,276 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/termination-memory-alloca/cstrncpy-alloca-1.c [2025-04-29 11:28:15,281 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:28:15,281 WARN L117 ultiparseSymbolTable]: System include alloca.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:28:15,291 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dd18b0c9/a2da6f7f25be497389c720497ad40bc1/FLAG8e2f208ee [2025-04-29 11:28:16,133 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dd18b0c9/a2da6f7f25be497389c720497ad40bc1 [2025-04-29 11:28:16,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:28:16,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:28:16,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:28:16,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:28:16,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:28:16,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:28:16" (1/1) ... [2025-04-29 11:28:16,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70de98d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:28:16, skipping insertion in model container [2025-04-29 11:28:16,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:28:16" (1/1) ... [2025-04-29 11:28:16,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:28:16,310 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-29 11:28:16,313 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-29 11:28:16,316 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:28:16,325 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:28:16,353 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:28:16,365 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:28:16,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:28:16 WrapperNode [2025-04-29 11:28:16,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:28:16,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:28:16,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:28:16,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:28:16,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:28:16" (1/1) ... [2025-04-29 11:28:16,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:28:16" (1/1) ... [2025-04-29 11:28:16,397 INFO L138 Inliner]: procedures = 9, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2025-04-29 11:28:16,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:28:16,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:28:16,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:28:16,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:28:16,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:28:16" (1/1) ... [2025-04-29 11:28:16,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:28:16" (1/1) ... [2025-04-29 11:28:16,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:28:16" (1/1) ... [2025-04-29 11:28:16,423 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [2, 1]. [2025-04-29 11:28:16,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:28:16" (1/1) ... [2025-04-29 11:28:16,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:28:16" (1/1) ... [2025-04-29 11:28:16,429 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:28:16" (1/1) ... [2025-04-29 11:28:16,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:28:16" (1/1) ... [2025-04-29 11:28:16,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:28:16" (1/1) ... [2025-04-29 11:28:16,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:28:16" (1/1) ... [2025-04-29 11:28:16,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:28:16" (1/1) ... [2025-04-29 11:28:16,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:28:16,442 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:28:16,443 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:28:16,443 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:28:16,443 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:28:16" (1/1) ... [2025-04-29 11:28:16,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:28:16,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:28:16,469 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-29 11:28:16,471 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-29 11:28:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:28:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:28:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:28:16,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:28:16,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:28:16,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:28:16,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:28:16,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:28:16,546 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:28:16,547 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:28:16,673 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-04-29 11:28:16,673 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:28:16,679 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:28:16,679 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 11:28:16,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:28:16 BoogieIcfgContainer [2025-04-29 11:28:16,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:28:16,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:28:16,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:28:16,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:28:16,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:28:16" (1/3) ... [2025-04-29 11:28:16,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e77c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:28:16, skipping insertion in model container [2025-04-29 11:28:16,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:28:16" (2/3) ... [2025-04-29 11:28:16,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e77c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:28:16, skipping insertion in model container [2025-04-29 11:28:16,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:28:16" (3/3) ... [2025-04-29 11:28:16,686 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca-1.c [2025-04-29 11:28:16,695 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:28:16,696 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrncpy-alloca-1.c that has 1 procedures, 29 locations, 34 edges, 1 initial locations, 2 loop locations, and 9 error locations. [2025-04-29 11:28:16,724 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:28:16,735 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;@20382ab0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:28:16,736 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-29 11:28:16,739 INFO L278 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 28 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-29 11:28:16,743 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:28:16,743 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:16,744 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:28:16,744 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:16,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:16,749 INFO L85 PathProgramCache]: Analyzing trace with hash 889510731, now seen corresponding path program 1 times [2025-04-29 11:28:16,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:16,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151444592] [2025-04-29 11:28:16,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:16,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:16,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:28:16,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:28:16,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:16,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:16,943 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-29 11:28:16,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:16,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151444592] [2025-04-29 11:28:16,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151444592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:28:16,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:28:16,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:28:16,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448436408] [2025-04-29 11:28:16,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:28:16,948 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:28:16,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:16,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:28:16,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:28:16,968 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 28 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-29 11:28:17,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:17,007 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-04-29 11:28:17,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:28:17,010 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-04-29 11:28:17,010 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:17,014 INFO L225 Difference]: With dead ends: 28 [2025-04-29 11:28:17,014 INFO L226 Difference]: Without dead ends: 26 [2025-04-29 11:28:17,015 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-29 11:28:17,018 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:17,019 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:28:17,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-04-29 11:28:17,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-04-29 11:28:17,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-29 11:28:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-04-29 11:28:17,040 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 6 [2025-04-29 11:28:17,040 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:17,040 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-04-29 11:28:17,040 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-29 11:28:17,040 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-04-29 11:28:17,040 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:28:17,040 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:17,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:28:17,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:28:17,041 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:17,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:17,042 INFO L85 PathProgramCache]: Analyzing trace with hash 889510732, now seen corresponding path program 1 times [2025-04-29 11:28:17,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:17,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960470160] [2025-04-29 11:28:17,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:17,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:17,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:28:17,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:28:17,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:17,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:17,219 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-29 11:28:17,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:17,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960470160] [2025-04-29 11:28:17,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960470160] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:28:17,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:28:17,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:28:17,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565081542] [2025-04-29 11:28:17,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:28:17,221 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:28:17,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:17,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:28:17,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:28:17,221 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-29 11:28:17,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:17,239 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2025-04-29 11:28:17,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:28:17,240 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-04-29 11:28:17,240 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:17,240 INFO L225 Difference]: With dead ends: 29 [2025-04-29 11:28:17,240 INFO L226 Difference]: Without dead ends: 29 [2025-04-29 11:28:17,240 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-29 11:28:17,241 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:17,241 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:28:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-04-29 11:28:17,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-04-29 11:28:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.619047619047619) internal successors, (34), 28 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-29 11:28:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-04-29 11:28:17,244 INFO L79 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 6 [2025-04-29 11:28:17,244 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:17,244 INFO L485 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-04-29 11:28:17,244 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-29 11:28:17,244 INFO L278 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-04-29 11:28:17,245 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:28:17,245 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:17,245 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:28:17,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:28:17,245 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:17,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:17,245 INFO L85 PathProgramCache]: Analyzing trace with hash 889570314, now seen corresponding path program 1 times [2025-04-29 11:28:17,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:17,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811219832] [2025-04-29 11:28:17,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:17,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:17,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:28:17,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:28:17,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:17,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:17,373 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-29 11:28:17,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:17,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811219832] [2025-04-29 11:28:17,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811219832] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:28:17,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:28:17,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:28:17,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54930359] [2025-04-29 11:28:17,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:28:17,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:28:17,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:17,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:28:17,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:28:17,375 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-29 11:28:17,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:17,387 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2025-04-29 11:28:17,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:28:17,387 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-04-29 11:28:17,387 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:17,387 INFO L225 Difference]: With dead ends: 28 [2025-04-29 11:28:17,388 INFO L226 Difference]: Without dead ends: 28 [2025-04-29 11:28:17,388 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:28:17,388 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:17,388 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:28:17,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-29 11:28:17,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-04-29 11:28:17,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-04-29 11:28:17,390 INFO L79 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 6 [2025-04-29 11:28:17,390 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:17,390 INFO L485 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-04-29 11:28:17,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-29 11:28:17,390 INFO L278 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-04-29 11:28:17,391 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:28:17,391 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:17,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:17,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:28:17,391 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:17,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:17,391 INFO L85 PathProgramCache]: Analyzing trace with hash -534039893, now seen corresponding path program 1 times [2025-04-29 11:28:17,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:17,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084474923] [2025-04-29 11:28:17,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:17,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:17,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:28:17,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:28:17,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:17,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:17,470 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-29 11:28:17,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:17,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084474923] [2025-04-29 11:28:17,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084474923] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:28:17,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:28:17,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:28:17,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011268745] [2025-04-29 11:28:17,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:28:17,471 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:28:17,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:17,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:28:17,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:28:17,472 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:17,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:17,525 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-04-29 11:28:17,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:28:17,526 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:28:17,526 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:17,526 INFO L225 Difference]: With dead ends: 24 [2025-04-29 11:28:17,526 INFO L226 Difference]: Without dead ends: 24 [2025-04-29 11:28:17,526 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-29 11:28:17,527 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:17,527 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 48 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:28:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-04-29 11:28:17,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-04-29 11:28:17,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:17,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-04-29 11:28:17,530 INFO L79 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 9 [2025-04-29 11:28:17,530 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:17,530 INFO L485 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-04-29 11:28:17,531 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:17,531 INFO L278 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-04-29 11:28:17,531 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:28:17,531 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:17,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:17,531 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:28:17,531 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:17,532 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:17,532 INFO L85 PathProgramCache]: Analyzing trace with hash -534039892, now seen corresponding path program 1 times [2025-04-29 11:28:17,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:17,532 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069469634] [2025-04-29 11:28:17,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:17,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:17,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:28:17,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:28:17,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:17,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:17,664 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-29 11:28:17,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:17,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069469634] [2025-04-29 11:28:17,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069469634] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:28:17,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:28:17,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:28:17,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034387676] [2025-04-29 11:28:17,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:28:17,664 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:28:17,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:17,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:28:17,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:28:17,665 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:17,713 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2025-04-29 11:28:17,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:28:17,713 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:28:17,713 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:17,714 INFO L225 Difference]: With dead ends: 28 [2025-04-29 11:28:17,714 INFO L226 Difference]: Without dead ends: 28 [2025-04-29 11:28:17,714 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:28:17,714 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:17,714 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 92 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:28:17,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-29 11:28:17,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-04-29 11:28:17,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.55) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-29 11:28:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-04-29 11:28:17,716 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 9 [2025-04-29 11:28:17,716 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:17,716 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-04-29 11:28:17,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:17,716 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-04-29 11:28:17,717 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:28:17,717 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:17,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:17,717 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:28:17,717 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:17,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:17,717 INFO L85 PathProgramCache]: Analyzing trace with hash 624632498, now seen corresponding path program 1 times [2025-04-29 11:28:17,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:17,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553175082] [2025-04-29 11:28:17,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:17,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:17,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:28:17,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:28:17,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:17,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:17,886 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-29 11:28:17,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:17,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553175082] [2025-04-29 11:28:17,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553175082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:28:17,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:28:17,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:28:17,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864132642] [2025-04-29 11:28:17,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:28:17,887 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:28:17,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:17,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:28:17,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:28:17,888 INFO L87 Difference]: Start difference. First operand 26 states and 31 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-29 11:28:17,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:17,952 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-04-29 11:28:17,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:28:17,953 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-29 11:28:17,953 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:17,953 INFO L225 Difference]: With dead ends: 30 [2025-04-29 11:28:17,953 INFO L226 Difference]: Without dead ends: 30 [2025-04-29 11:28:17,953 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:28:17,954 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:17,954 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 76 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:28:17,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-04-29 11:28:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2025-04-29 11:28:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-29 11:28:17,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-04-29 11:28:17,956 INFO L79 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 10 [2025-04-29 11:28:17,956 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:17,956 INFO L485 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-04-29 11:28:17,956 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-29 11:28:17,956 INFO L278 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-04-29 11:28:17,956 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:28:17,956 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:17,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:17,956 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:28:17,956 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:17,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:17,956 INFO L85 PathProgramCache]: Analyzing trace with hash 624632499, now seen corresponding path program 1 times [2025-04-29 11:28:17,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:17,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132145701] [2025-04-29 11:28:17,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:17,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:17,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:28:17,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:28:17,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:17,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:18,083 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-29 11:28:18,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:18,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132145701] [2025-04-29 11:28:18,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132145701] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:28:18,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:28:18,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:28:18,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071247641] [2025-04-29 11:28:18,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:28:18,084 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:28:18,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:18,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:28:18,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:28:18,085 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-29 11:28:18,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:18,121 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-04-29 11:28:18,121 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:28:18,121 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-29 11:28:18,121 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:18,122 INFO L225 Difference]: With dead ends: 33 [2025-04-29 11:28:18,122 INFO L226 Difference]: Without dead ends: 33 [2025-04-29 11:28:18,122 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-29 11:28:18,122 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:18,122 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 83 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:28:18,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-29 11:28:18,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-04-29 11:28:18,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-29 11:28:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-04-29 11:28:18,125 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 10 [2025-04-29 11:28:18,125 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:18,125 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-04-29 11:28:18,125 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-29 11:28:18,125 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-04-29 11:28:18,125 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:28:18,125 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:18,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:18,125 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:28:18,125 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:18,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:18,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1895327435, now seen corresponding path program 1 times [2025-04-29 11:28:18,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:18,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347105761] [2025-04-29 11:28:18,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:18,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:18,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:28:18,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:28:18,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:18,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:18,282 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-29 11:28:18,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:18,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347105761] [2025-04-29 11:28:18,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347105761] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:28:18,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:28:18,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:28:18,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297400694] [2025-04-29 11:28:18,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:28:18,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:28:18,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:18,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:28:18,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:28:18,284 INFO L87 Difference]: Start difference. First operand 31 states and 37 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-29 11:28:18,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:18,317 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2025-04-29 11:28:18,317 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:28:18,317 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-29 11:28:18,317 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:18,317 INFO L225 Difference]: With dead ends: 34 [2025-04-29 11:28:18,317 INFO L226 Difference]: Without dead ends: 34 [2025-04-29 11:28:18,318 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-29 11:28:18,318 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:18,318 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 62 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:28:18,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-04-29 11:28:18,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2025-04-29 11:28:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-29 11:28:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-04-29 11:28:18,320 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 10 [2025-04-29 11:28:18,320 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:18,320 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-04-29 11:28:18,320 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-29 11:28:18,321 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-04-29 11:28:18,321 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:28:18,321 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:18,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:18,321 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:28:18,321 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:18,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:18,322 INFO L85 PathProgramCache]: Analyzing trace with hash -2110304563, now seen corresponding path program 1 times [2025-04-29 11:28:18,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:18,322 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95078570] [2025-04-29 11:28:18,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:18,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:18,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:28:18,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:28:18,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:18,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:18,348 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-29 11:28:18,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:18,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95078570] [2025-04-29 11:28:18,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95078570] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:28:18,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:28:18,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:28:18,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58728314] [2025-04-29 11:28:18,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:28:18,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:28:18,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:18,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:28:18,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:28:18,350 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-29 11:28:18,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:18,364 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2025-04-29 11:28:18,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:28:18,365 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-29 11:28:18,365 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:18,365 INFO L225 Difference]: With dead ends: 26 [2025-04-29 11:28:18,365 INFO L226 Difference]: Without dead ends: 26 [2025-04-29 11:28:18,365 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-29 11:28:18,365 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 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-29 11:28:18,366 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:28:18,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-04-29 11:28:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-04-29 11:28:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-29 11:28:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-04-29 11:28:18,367 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 11 [2025-04-29 11:28:18,367 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:18,367 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-04-29 11:28:18,367 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-29 11:28:18,367 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-04-29 11:28:18,367 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:28:18,367 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:18,367 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:18,368 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:28:18,368 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:18,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:18,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1666525691, now seen corresponding path program 1 times [2025-04-29 11:28:18,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:18,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377917028] [2025-04-29 11:28:18,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:18,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:18,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:28:18,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:28:18,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:18,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:18,410 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-29 11:28:18,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:18,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377917028] [2025-04-29 11:28:18,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377917028] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:28:18,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:28:18,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:28:18,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027072718] [2025-04-29 11:28:18,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:28:18,411 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:28:18,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:18,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:28:18,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:28:18,411 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-29 11:28:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:18,428 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2025-04-29 11:28:18,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:28:18,429 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-04-29 11:28:18,429 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:18,429 INFO L225 Difference]: With dead ends: 34 [2025-04-29 11:28:18,429 INFO L226 Difference]: Without dead ends: 34 [2025-04-29 11:28:18,429 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-29 11:28:18,430 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 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-29 11:28:18,430 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:28:18,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-04-29 11:28:18,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-04-29 11:28:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 33 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-29 11:28:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-04-29 11:28:18,432 INFO L79 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 13 [2025-04-29 11:28:18,432 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:18,432 INFO L485 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-04-29 11:28:18,432 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-29 11:28:18,432 INFO L278 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-04-29 11:28:18,432 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:28:18,432 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:18,433 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:18,433 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:28:18,433 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:18,433 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:18,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2059552701, now seen corresponding path program 1 times [2025-04-29 11:28:18,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:18,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208052095] [2025-04-29 11:28:18,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:18,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:18,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:28:18,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:28:18,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:18,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:18,577 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-29 11:28:18,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:18,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208052095] [2025-04-29 11:28:18,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208052095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:28:18,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:28:18,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:28:18,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518551209] [2025-04-29 11:28:18,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:28:18,577 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:28:18,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:18,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:28:18,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:28:18,578 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-29 11:28:18,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:18,615 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2025-04-29 11:28:18,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:28:18,615 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-04-29 11:28:18,615 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:18,616 INFO L225 Difference]: With dead ends: 49 [2025-04-29 11:28:18,616 INFO L226 Difference]: Without dead ends: 49 [2025-04-29 11:28:18,617 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-29 11:28:18,617 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:18,617 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 112 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:28:18,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-29 11:28:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2025-04-29 11:28:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 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-29 11:28:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2025-04-29 11:28:18,620 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 13 [2025-04-29 11:28:18,620 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:18,620 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2025-04-29 11:28:18,620 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-29 11:28:18,620 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2025-04-29 11:28:18,620 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:28:18,620 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:18,620 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:18,621 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:28:18,621 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:18,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:18,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1358488123, now seen corresponding path program 1 times [2025-04-29 11:28:18,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:18,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410138579] [2025-04-29 11:28:18,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:18,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:18,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:28:18,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:28:18,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:18,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:18,850 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-29 11:28:18,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:18,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410138579] [2025-04-29 11:28:18,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410138579] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:28:18,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930007560] [2025-04-29 11:28:18,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:18,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:28:18,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:28:18,853 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-29 11:28:18,855 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-29 11:28:18,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:28:18,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:28:18,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:18,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:18,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-29 11:28:18,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:28:18,964 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-29 11:28:19,131 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:28:19,131 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2025-04-29 11:28:19,203 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-29 11:28:19,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:28:19,444 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 13 treesize of output 11 [2025-04-29 11:28:19,447 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 15 treesize of output 11 [2025-04-29 11:28:19,453 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 22 treesize of output 20 [2025-04-29 11:28:19,463 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-29 11:28:19,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930007560] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:28:19,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:28:19,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-04-29 11:28:19,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035645175] [2025-04-29 11:28:19,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:28:19,463 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:28:19,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:19,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:28:19,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:28:19,464 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:19,663 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2025-04-29 11:28:19,663 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:28:19,663 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-29 11:28:19,663 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:19,664 INFO L225 Difference]: With dead ends: 47 [2025-04-29 11:28:19,664 INFO L226 Difference]: Without dead ends: 47 [2025-04-29 11:28:19,664 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:28:19,665 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:19,665 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 165 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:28:19,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-04-29 11:28:19,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2025-04-29 11:28:19,667 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-29 11:28:19,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-04-29 11:28:19,667 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 13 [2025-04-29 11:28:19,667 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:19,667 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-04-29 11:28:19,667 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:19,667 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-04-29 11:28:19,668 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:28:19,668 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:19,668 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:19,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:28:19,868 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-29 11:28:19,869 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:19,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:19,869 INFO L85 PathProgramCache]: Analyzing trace with hash 836541114, now seen corresponding path program 1 times [2025-04-29 11:28:19,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:19,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283535526] [2025-04-29 11:28:19,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:19,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:19,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:28:19,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:28:19,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:19,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:20,107 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-29 11:28:20,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:20,107 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283535526] [2025-04-29 11:28:20,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283535526] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:28:20,107 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158418099] [2025-04-29 11:28:20,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:20,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:28:20,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:28:20,110 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-29 11:28:20,111 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-29 11:28:20,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:28:20,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:28:20,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:20,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:20,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-29 11:28:20,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:28:20,198 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 1 [2025-04-29 11:28:20,201 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:28:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:28:20,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:28:20,787 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-29 11:28:20,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158418099] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:28:20,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:28:20,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 23 [2025-04-29 11:28:20,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280072504] [2025-04-29 11:28:20,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:28:20,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 11:28:20,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:20,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 11:28:20,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:28:20,788 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 24 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 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-29 11:28:21,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:21,110 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-04-29 11:28:21,110 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:28:21,110 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 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 14 [2025-04-29 11:28:21,111 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:21,111 INFO L225 Difference]: With dead ends: 46 [2025-04-29 11:28:21,111 INFO L226 Difference]: Without dead ends: 46 [2025-04-29 11:28:21,112 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=890, Unknown=0, NotChecked=0, Total=1056 [2025-04-29 11:28:21,113 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:21,113 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 156 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:28:21,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-04-29 11:28:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2025-04-29 11:28:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.3) internal successors, (52), 43 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-29 11:28:21,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-04-29 11:28:21,117 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 14 [2025-04-29 11:28:21,117 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:21,119 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-04-29 11:28:21,119 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 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-29 11:28:21,119 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-04-29 11:28:21,119 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:28:21,119 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:21,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:21,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:28:21,319 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,SelfDestructingSolverStorable12 [2025-04-29 11:28:21,320 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:21,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:21,320 INFO L85 PathProgramCache]: Analyzing trace with hash 474466612, now seen corresponding path program 1 times [2025-04-29 11:28:21,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:21,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595623803] [2025-04-29 11:28:21,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:21,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:21,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:28:21,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:28:21,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:21,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:21,382 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-29 11:28:21,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:21,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595623803] [2025-04-29 11:28:21,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595623803] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:28:21,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:28:21,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:28:21,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303578795] [2025-04-29 11:28:21,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:28:21,383 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:28:21,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:21,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:28:21,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:28:21,383 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:21,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:21,435 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-04-29 11:28:21,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:28:21,435 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-29 11:28:21,435 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:21,435 INFO L225 Difference]: With dead ends: 45 [2025-04-29 11:28:21,435 INFO L226 Difference]: Without dead ends: 45 [2025-04-29 11:28:21,435 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-29 11:28:21,436 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:21,436 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 65 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:28:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-29 11:28:21,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-04-29 11:28:21,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.275) internal successors, (51), 42 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-29 11:28:21,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-04-29 11:28:21,438 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 15 [2025-04-29 11:28:21,438 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:21,438 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-04-29 11:28:21,438 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:21,438 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-04-29 11:28:21,438 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:28:21,438 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:21,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:21,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:28:21,438 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:21,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:21,438 INFO L85 PathProgramCache]: Analyzing trace with hash 474466613, now seen corresponding path program 1 times [2025-04-29 11:28:21,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:21,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256417963] [2025-04-29 11:28:21,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:21,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:21,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:28:21,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:28:21,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:21,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:21,491 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-29 11:28:21,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:21,491 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256417963] [2025-04-29 11:28:21,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256417963] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:28:21,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:28:21,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:28:21,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488408049] [2025-04-29 11:28:21,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:28:21,492 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:28:21,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:21,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:28:21,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:28:21,492 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:21,516 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2025-04-29 11:28:21,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:28:21,517 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-29 11:28:21,517 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:21,517 INFO L225 Difference]: With dead ends: 52 [2025-04-29 11:28:21,517 INFO L226 Difference]: Without dead ends: 52 [2025-04-29 11:28:21,517 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-29 11:28:21,517 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 100 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-29 11:28:21,517 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 100 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:28:21,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-29 11:28:21,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-04-29 11:28:21,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 51 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-29 11:28:21,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2025-04-29 11:28:21,519 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 15 [2025-04-29 11:28:21,519 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:21,519 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2025-04-29 11:28:21,519 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:21,519 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2025-04-29 11:28:21,520 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:28:21,520 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:21,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:21,520 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:28:21,520 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:21,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:21,520 INFO L85 PathProgramCache]: Analyzing trace with hash 732632051, now seen corresponding path program 1 times [2025-04-29 11:28:21,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:21,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474702208] [2025-04-29 11:28:21,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:21,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:21,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:28:21,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:28:21,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:21,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:21,799 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-29 11:28:21,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:21,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474702208] [2025-04-29 11:28:21,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474702208] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:28:21,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:28:21,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 11:28:21,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180485544] [2025-04-29 11:28:21,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:28:21,800 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:28:21,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:21,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:28:21,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:28:21,801 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:21,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:21,928 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2025-04-29 11:28:21,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:28:21,928 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-29 11:28:21,928 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:21,929 INFO L225 Difference]: With dead ends: 56 [2025-04-29 11:28:21,929 INFO L226 Difference]: Without dead ends: 56 [2025-04-29 11:28:21,929 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:28:21,929 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:21,930 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 72 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:28:21,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-29 11:28:21,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-29 11:28:21,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 55 states have internal predecessors, (65), 0 states have call successors, (0), 0 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-29 11:28:21,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2025-04-29 11:28:21,933 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 15 [2025-04-29 11:28:21,933 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:21,933 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2025-04-29 11:28:21,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:21,933 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2025-04-29 11:28:21,933 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:28:21,933 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:21,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:21,934 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:28:21,934 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:21,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:21,934 INFO L85 PathProgramCache]: Analyzing trace with hash -94270232, now seen corresponding path program 1 times [2025-04-29 11:28:21,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:21,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63940074] [2025-04-29 11:28:21,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:21,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:21,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:28:21,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:28:21,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:21,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:28:22,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:22,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63940074] [2025-04-29 11:28:22,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63940074] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:28:22,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:28:22,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:28:22,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119071248] [2025-04-29 11:28:22,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:28:22,023 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:28:22,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:22,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:28:22,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:28:22,023 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:22,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:22,036 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2025-04-29 11:28:22,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:28:22,037 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-29 11:28:22,037 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:22,037 INFO L225 Difference]: With dead ends: 55 [2025-04-29 11:28:22,037 INFO L226 Difference]: Without dead ends: 35 [2025-04-29 11:28:22,037 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-29 11:28:22,038 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:22,038 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 34 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:28:22,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-29 11:28:22,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-04-29 11:28:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 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-29 11:28:22,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-04-29 11:28:22,040 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 15 [2025-04-29 11:28:22,040 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:22,040 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-04-29 11:28:22,040 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:22,040 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-04-29 11:28:22,040 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:28:22,040 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:22,040 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:22,040 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:28:22,040 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:22,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:22,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1996065950, now seen corresponding path program 2 times [2025-04-29 11:28:22,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:22,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280746783] [2025-04-29 11:28:22,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:28:22,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:22,050 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-29 11:28:22,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:28:22,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:28:22,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:28:22,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:22,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280746783] [2025-04-29 11:28:22,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280746783] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:28:22,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585650916] [2025-04-29 11:28:22,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:28:22,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:28:22,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:28:22,416 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-29 11:28:22,417 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-29 11:28:22,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-29 11:28:22,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:28:22,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:28:22,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:22,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-29 11:28:22,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:28:22,491 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-29 11:28:22,804 INFO L325 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2025-04-29 11:28:22,804 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 28 [2025-04-29 11:28:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:28:22,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:28:23,214 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 29 treesize of output 25 [2025-04-29 11:28:23,221 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2025-04-29 11:28:23,228 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-29 11:28:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:28:23,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585650916] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:28:23,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:28:23,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-04-29 11:28:23,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366198885] [2025-04-29 11:28:23,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:28:23,251 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-29 11:28:23,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:23,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-29 11:28:23,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2025-04-29 11:28:23,251 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 29 states, 28 states have (on average 1.5) internal successors, (42), 29 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-29 11:28:23,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:23,686 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2025-04-29 11:28:23,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:28:23,687 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 29 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) Word has length 17 [2025-04-29 11:28:23,687 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:23,687 INFO L225 Difference]: With dead ends: 43 [2025-04-29 11:28:23,687 INFO L226 Difference]: Without dead ends: 43 [2025-04-29 11:28:23,688 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=1177, Unknown=0, NotChecked=0, Total=1332 [2025-04-29 11:28:23,688 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:23,688 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 153 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:28:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-29 11:28:23,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2025-04-29 11:28:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-29 11:28:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-04-29 11:28:23,690 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 17 [2025-04-29 11:28:23,690 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:23,690 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-04-29 11:28:23,690 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 29 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-29 11:28:23,690 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-04-29 11:28:23,690 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:28:23,691 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:23,691 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:23,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:28:23,895 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-29 11:28:23,895 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:23,895 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:23,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2000595095, now seen corresponding path program 1 times [2025-04-29 11:28:23,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:23,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610796676] [2025-04-29 11:28:23,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:23,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:23,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:28:23,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:28:23,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:23,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:24,338 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-29 11:28:24,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:24,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610796676] [2025-04-29 11:28:24,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610796676] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:28:24,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914206193] [2025-04-29 11:28:24,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:24,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:28:24,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:28:24,341 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-29 11:28:24,342 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-29 11:28:24,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:28:24,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:28:24,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:24,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:24,402 WARN L254 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-04-29 11:28:24,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:28:24,437 INFO L325 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-04-29 11:28:24,437 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 11 [2025-04-29 11:28:24,444 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-29 11:28:25,067 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-29 11:28:25,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:28:25,555 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:28:25,602 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-29 11:28:25,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914206193] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:28:25,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:28:25,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2025-04-29 11:28:25,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550297356] [2025-04-29 11:28:25,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:28:25,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-29 11:28:25,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:25,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-29 11:28:25,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1477, Unknown=0, NotChecked=0, Total=1640 [2025-04-29 11:28:25,603 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 41 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-29 11:28:26,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:26,540 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2025-04-29 11:28:26,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-29 11:28:26,541 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.375) internal successors, (55), 41 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 19 [2025-04-29 11:28:26,541 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:26,541 INFO L225 Difference]: With dead ends: 73 [2025-04-29 11:28:26,542 INFO L226 Difference]: Without dead ends: 73 [2025-04-29 11:28:26,543 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 11 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-29 11:28:26,544 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 21 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:26,544 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 96 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:28:26,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-04-29 11:28:26,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 60. [2025-04-29 11:28:26,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-29 11:28:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2025-04-29 11:28:26,548 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 19 [2025-04-29 11:28:26,548 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:26,548 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2025-04-29 11:28:26,548 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.375) internal successors, (55), 41 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-29 11:28:26,548 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2025-04-29 11:28:26,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 11:28:26,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:26,549 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:26,557 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-29 11:28:26,749 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:28:26,749 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:26,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash -134376198, now seen corresponding path program 1 times [2025-04-29 11:28:26,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:26,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309949866] [2025-04-29 11:28:26,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:26,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:26,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:28:26,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:28:26,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:26,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:28:27,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:27,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309949866] [2025-04-29 11:28:27,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309949866] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:28:27,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472487645] [2025-04-29 11:28:27,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:28:27,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:28:27,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:28:27,368 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-29 11:28:27,368 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-29 11:28:27,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:28:27,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:28:27,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:28:27,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:27,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-04-29 11:28:27,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:28:27,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:28:27,467 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-29 11:28:27,470 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-29 11:28:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:28:28,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:28:28,923 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:28:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:28:28,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472487645] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:28:28,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:28:28,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 57 [2025-04-29 11:28:28,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045592136] [2025-04-29 11:28:28,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:28:28,987 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-04-29 11:28:28,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:28,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-04-29 11:28:28,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=3052, Unknown=0, NotChecked=0, Total=3306 [2025-04-29 11:28:28,989 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 58 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 58 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-29 11:28:31,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:31,363 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2025-04-29 11:28:31,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-04-29 11:28:31,364 INFO L79 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 58 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-29 11:28:31,364 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:31,364 INFO L225 Difference]: With dead ends: 126 [2025-04-29 11:28:31,364 INFO L226 Difference]: Without dead ends: 126 [2025-04-29 11:28:31,366 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2657 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1025, Invalid=10105, Unknown=0, NotChecked=0, Total=11130 [2025-04-29 11:28:31,366 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 23 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:31,367 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 185 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 11:28:31,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-04-29 11:28:31,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 104. [2025-04-29 11:28:31,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.087378640776699) internal successors, (112), 103 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2025-04-29 11:28:31,369 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 31 [2025-04-29 11:28:31,369 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:31,369 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2025-04-29 11:28:31,369 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 58 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-29 11:28:31,369 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2025-04-29 11:28:31,369 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 11:28:31,370 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:31,370 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:31,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 11:28:31,574 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:28:31,574 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:31,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash -262887185, now seen corresponding path program 2 times [2025-04-29 11:28:31,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:31,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554429479] [2025-04-29 11:28:31,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:28:31,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:31,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-29 11:28:31,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:28:31,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:28:31,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:28:32,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:32,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554429479] [2025-04-29 11:28:32,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554429479] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:28:32,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891213237] [2025-04-29 11:28:32,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:28:32,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:28:32,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:28:32,166 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-29 11:28:32,167 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-29 11:28:32,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-29 11:28:32,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:28:32,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:28:32,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:32,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-04-29 11:28:32,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:28:32,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:28:32,253 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-29 11:28:32,259 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-29 11:28:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:28:32,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:28:33,276 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:28:33,324 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:28:33,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891213237] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:28:33,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:28:33,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 52 [2025-04-29 11:28:33,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412428608] [2025-04-29 11:28:33,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:28:33,325 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-29 11:28:33,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:33,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-29 11:28:33,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2536, Unknown=0, NotChecked=0, Total=2756 [2025-04-29 11:28:33,326 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 53 states, 52 states have (on average 1.75) internal successors, (91), 53 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-29 11:28:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:34,528 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2025-04-29 11:28:34,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-29 11:28:34,528 INFO L79 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.75) internal successors, (91), 53 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-29 11:28:34,528 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:34,528 INFO L225 Difference]: With dead ends: 149 [2025-04-29 11:28:34,528 INFO L226 Difference]: Without dead ends: 105 [2025-04-29 11:28:34,530 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1995 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=632, Invalid=6340, Unknown=0, NotChecked=0, Total=6972 [2025-04-29 11:28:34,530 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:34,530 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 199 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:28:34,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-04-29 11:28:34,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 92. [2025-04-29 11:28:34,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2025-04-29 11:28:34,532 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 31 [2025-04-29 11:28:34,532 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:34,532 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2025-04-29 11:28:34,532 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.75) internal successors, (91), 53 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-29 11:28:34,532 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2025-04-29 11:28:34,533 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 11:28:34,533 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:34,533 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:34,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:28:34,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:28:34,733 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:34,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:34,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1040811815, now seen corresponding path program 2 times [2025-04-29 11:28:34,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:34,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804666269] [2025-04-29 11:28:34,734 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:28:34,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:34,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-29 11:28:34,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:28:34,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:28:34,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:35,459 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-29 11:28:35,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:35,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804666269] [2025-04-29 11:28:35,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804666269] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:28:35,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079144856] [2025-04-29 11:28:35,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:28:35,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:28:35,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:28:35,461 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-29 11:28:35,462 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-29 11:28:35,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-29 11:28:35,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:28:35,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:28:35,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:35,529 WARN L254 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 121 conjuncts are in the unsatisfiable core [2025-04-29 11:28:35,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:28:35,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:28:35,581 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-29 11:28:35,583 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-29 11:28:36,533 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-29 11:28:36,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:28:37,713 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:28:37,815 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-29 11:28:37,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079144856] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:28:37,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:28:37,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26, 26] total 73 [2025-04-29 11:28:37,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288002173] [2025-04-29 11:28:37,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:28:37,815 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2025-04-29 11:28:37,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:37,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2025-04-29 11:28:37,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=4789, Unknown=0, NotChecked=0, Total=5402 [2025-04-29 11:28:37,817 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 74 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 74 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-29 11:28:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:41,176 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2025-04-29 11:28:41,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-04-29 11:28:41,177 INFO L79 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 74 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-29 11:28:41,177 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:41,177 INFO L225 Difference]: With dead ends: 161 [2025-04-29 11:28:41,177 INFO L226 Difference]: Without dead ends: 161 [2025-04-29 11:28:41,180 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5559 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2395, Invalid=17065, Unknown=0, NotChecked=0, Total=19460 [2025-04-29 11:28:41,181 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:41,182 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 160 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 11:28:41,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-04-29 11:28:41,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 116. [2025-04-29 11:28:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 0 states have call successors, (0), 0 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-29 11:28:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2025-04-29 11:28:41,186 INFO L79 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 35 [2025-04-29 11:28:41,186 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:41,186 INFO L485 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2025-04-29 11:28:41,186 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 74 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-29 11:28:41,186 INFO L278 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2025-04-29 11:28:41,187 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 11:28:41,187 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:28:41,187 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:41,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:28:41,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:28:41,391 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-04-29 11:28:41,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:28:41,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1236650493, now seen corresponding path program 3 times [2025-04-29 11:28:41,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:28:41,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656979769] [2025-04-29 11:28:41,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:28:41,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:28:41,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 5 equivalence classes. [2025-04-29 11:28:41,407 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:28:41,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-29 11:28:41,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:41,973 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 11:28:41,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:28:41,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656979769] [2025-04-29 11:28:41,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656979769] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:28:41,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141236377] [2025-04-29 11:28:41,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:28:41,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:28:41,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:28:41,976 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-29 11:28:41,977 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-29 11:28:42,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 5 equivalence classes. [2025-04-29 11:28:42,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:28:42,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-29 11:28:42,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:28:42,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 110 conjuncts are in the unsatisfiable core [2025-04-29 11:28:42,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:28:42,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:28:42,108 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-29 11:28:42,110 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-29 11:28:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:28:42,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:28:43,223 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:28:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:28:43,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141236377] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:28:43,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:28:43,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2025-04-29 11:28:43,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961813871] [2025-04-29 11:28:43,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:28:43,265 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-29 11:28:43,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:28:43,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-29 11:28:43,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2572, Unknown=0, NotChecked=0, Total=2862 [2025-04-29 11:28:43,266 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand has 54 states, 53 states have (on average 1.830188679245283) internal successors, (97), 54 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:28:44,014 INFO L93 Difference]: Finished difference Result 128 states and 131 transitions. [2025-04-29 11:28:44,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-29 11:28:44,015 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.830188679245283) internal successors, (97), 54 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-29 11:28:44,015 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:28:44,015 INFO L225 Difference]: With dead ends: 128 [2025-04-29 11:28:44,015 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 11:28:44,016 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1603 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=549, Invalid=4853, Unknown=0, NotChecked=0, Total=5402 [2025-04-29 11:28:44,016 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:28:44,016 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 194 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:28:44,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 11:28:44,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 11:28:44,016 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-29 11:28:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 11:28:44,016 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2025-04-29 11:28:44,016 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:28:44,017 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 11:28:44,017 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.830188679245283) internal successors, (97), 54 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:28:44,017 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 11:28:44,017 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 11:28:44,018 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 9 remaining) [2025-04-29 11:28:44,019 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2025-04-29 11:28:44,019 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2025-04-29 11:28:44,019 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2025-04-29 11:28:44,019 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2025-04-29 11:28:44,019 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2025-04-29 11:28:44,019 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2025-04-29 11:28:44,019 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2025-04-29 11:28:44,019 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2025-04-29 11:28:44,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-29 11:28:44,219 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,SelfDestructingSolverStorable22 [2025-04-29 11:28:44,221 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:28:44,223 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:28:44,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:28:44 BoogieIcfgContainer [2025-04-29 11:28:44,225 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:28:44,225 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:28:44,225 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:28:44,225 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:28:44,226 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:28:16" (3/4) ... [2025-04-29 11:28:44,227 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:28:44,233 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-04-29 11:28:44,233 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-29 11:28:44,233 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:28:44,233 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-29 11:28:44,292 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:28:44,292 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:28:44,292 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:28:44,293 INFO L158 Benchmark]: Toolchain (without parser) took 28156.24ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 113.7MB in the beginning and 118.0MB in the end (delta: -4.3MB). Peak memory consumption was 117.1MB. Max. memory is 16.1GB. [2025-04-29 11:28:44,293 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 201.3MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:28:44,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.65ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 99.4MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:28:44,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.62ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 98.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:28:44,294 INFO L158 Benchmark]: Boogie Preprocessor took 44.31ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:28:44,294 INFO L158 Benchmark]: RCFGBuilder took 237.09ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 82.7MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:28:44,294 INFO L158 Benchmark]: TraceAbstraction took 27543.73ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 81.8MB in the beginning and 123.9MB in the end (delta: -42.1MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2025-04-29 11:28:44,295 INFO L158 Benchmark]: Witness Printer took 67.08ms. Allocated memory is still 268.4MB. Free memory was 123.9MB in the beginning and 118.0MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:28:44,296 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.40ms. Allocated memory is still 201.3MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.65ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 99.4MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.62ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 98.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.31ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 237.09ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 82.7MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 27543.73ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 81.8MB in the beginning and 123.9MB in the end (delta: -42.1MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. * Witness Printer took 67.08ms. Allocated memory is still 268.4MB. Free memory was 123.9MB in the beginning and 118.0MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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: 29]: 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, 29 locations, 34 edges, 9 error locations. Started 1 CEGAR loops. OverallTime: 27.5s, OverallIterations: 23, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 2371 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1982 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6005 IncrementalHoareTripleChecker+Invalid, 6129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 389 mSDtfsCounter, 6005 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 793 GetRequests, 179 SyntacticMatches, 4 SemanticMatches, 610 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13028 ImplicationChecksByTransitivity, 15.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=22, InterpolantAutomatonStates: 417, 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, 23 MinimizatonAttempts, 141 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 553 NumberOfCodeBlocks, 553 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 709 ConstructedInterpolants, 14 QuantifiedInterpolants, 12217 SizeOfPredicates, 89 NumberOfNonLiveVariables, 1595 ConjunctsInSsa, 643 ConjunctsInUnsatCore, 39 InterpolantComputations, 15 PerfectInterpolantSequences, 35/524 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 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 11:28:44,315 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