./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-simple/sll2n_update_all.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/list-simple/sll2n_update_all.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f99aa5fd03ca5c00d7a972ed12be6649d688145eadeca69fa5b97f6f4a2041e9 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:21:52,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:21:52,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:21:52,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:21:52,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:21:52,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:21:52,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:21:52,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:21:52,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:21:52,912 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:21:52,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:21:52,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:21:52,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:21:52,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:21:52,913 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:21:52,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:21:52,914 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:21:52,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:21:52,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:21:52,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:21:52,914 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:21:52,914 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:21:52,914 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:21:52,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:21:52,914 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:21:52,915 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:21:52,915 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:21:52,915 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:21:52,915 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:21:52,915 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:21:52,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:21:52,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:21:52,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:21:52,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:21:52,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:21:52,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:21:52,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:21:52,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:21:52,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:21:52,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:21:52,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:21:52,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:21:52,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:21:52,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:21:52,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:21:52,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:21:52,917 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f99aa5fd03ca5c00d7a972ed12be6649d688145eadeca69fa5b97f6f4a2041e9 [2025-04-29 11:21:53,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:21:53,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:21:53,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:21:53,144 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:21:53,145 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:21:53,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_update_all.c [2025-04-29 11:21:54,446 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b893dfef7/c680259ef5f845e6abcfa41fbaa1dd8e/FLAG4e45c539b [2025-04-29 11:21:54,634 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:21:54,634 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all.c [2025-04-29 11:21:54,635 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:21:54,635 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:21:54,639 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b893dfef7/c680259ef5f845e6abcfa41fbaa1dd8e/FLAG4e45c539b [2025-04-29 11:21:55,497 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b893dfef7/c680259ef5f845e6abcfa41fbaa1dd8e [2025-04-29 11:21:55,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:21:55,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:21:55,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:21:55,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:21:55,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:21:55,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:21:55" (1/1) ... [2025-04-29 11:21:55,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4615606c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:55, skipping insertion in model container [2025-04-29 11:21:55,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:21:55" (1/1) ... [2025-04-29 11:21:55,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:21:55,670 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:21:55,676 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:21:55,704 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:21:55,716 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:21:55,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:55 WrapperNode [2025-04-29 11:21:55,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:21:55,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:21:55,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:21:55,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:21:55,721 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:21:55" (1/1) ... [2025-04-29 11:21:55,727 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:21:55" (1/1) ... [2025-04-29 11:21:55,741 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 104 [2025-04-29 11:21:55,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:21:55,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:21:55,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:21:55,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:21:55,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:55" (1/1) ... [2025-04-29 11:21:55,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:55" (1/1) ... [2025-04-29 11:21:55,750 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:55" (1/1) ... [2025-04-29 11:21:55,766 INFO L175 MemorySlicer]: Split 8 memory accesses to 1 slices as follows [8]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 4 writes are split as follows [4]. [2025-04-29 11:21:55,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:55" (1/1) ... [2025-04-29 11:21:55,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:55" (1/1) ... [2025-04-29 11:21:55,773 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:55" (1/1) ... [2025-04-29 11:21:55,774 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:55" (1/1) ... [2025-04-29 11:21:55,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:55" (1/1) ... [2025-04-29 11:21:55,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:55" (1/1) ... [2025-04-29 11:21:55,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:55" (1/1) ... [2025-04-29 11:21:55,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:21:55,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:21:55,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:21:55,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:21:55,783 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:55" (1/1) ... [2025-04-29 11:21:55,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:21:55,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:21:55,808 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:21:55,810 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:21:55,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:21:55,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:21:55,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:21:55,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:21:55,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:21:55,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:21:55,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:21:55,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:21:55,881 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:21:55,882 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:21:56,115 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2025-04-29 11:21:56,115 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:21:56,123 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:21:56,123 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:21:56,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:21:56 BoogieIcfgContainer [2025-04-29 11:21:56,124 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:21:56,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:21:56,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:21:56,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:21:56,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:21:55" (1/3) ... [2025-04-29 11:21:56,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc6c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:21:56, skipping insertion in model container [2025-04-29 11:21:56,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:55" (2/3) ... [2025-04-29 11:21:56,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc6c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:21:56, skipping insertion in model container [2025-04-29 11:21:56,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:21:56" (3/3) ... [2025-04-29 11:21:56,132 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.c [2025-04-29 11:21:56,142 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:21:56,144 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_update_all.c that has 1 procedures, 58 locations, 65 edges, 1 initial locations, 6 loop locations, and 20 error locations. [2025-04-29 11:21:56,175 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:21:56,184 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;@9d65d3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:21:56,185 INFO L341 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-04-29 11:21:56,188 INFO L278 IsEmpty]: Start isEmpty. Operand has 58 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 57 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:21:56,191 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:21:56,191 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:56,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:21:56,192 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:21:56,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:56,196 INFO L85 PathProgramCache]: Analyzing trace with hash 28694887, now seen corresponding path program 1 times [2025-04-29 11:21:56,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:56,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21052171] [2025-04-29 11:21:56,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:56,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:56,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:21:56,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:21:56,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:56,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:56,397 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:21:56,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:56,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21052171] [2025-04-29 11:21:56,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21052171] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:21:56,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:21:56,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:21:56,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873149372] [2025-04-29 11:21:56,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:21:56,401 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:21:56,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:56,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:21:56,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:21:56,416 INFO L87 Difference]: Start difference. First operand has 58 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 57 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 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:21:56,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:56,466 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2025-04-29 11:21:56,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:21:56,468 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-04-29 11:21:56,468 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:56,472 INFO L225 Difference]: With dead ends: 55 [2025-04-29 11:21:56,472 INFO L226 Difference]: Without dead ends: 51 [2025-04-29 11:21:56,473 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:21:56,475 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:56,475 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 94 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:21:56,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-29 11:21:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-04-29 11:21:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.696969696969697) internal successors, (56), 50 states have internal predecessors, (56), 0 states have call successors, (0), 0 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:21:56,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-04-29 11:21:56,499 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 5 [2025-04-29 11:21:56,499 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:56,499 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-04-29 11:21:56,499 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 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:21:56,500 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-04-29 11:21:56,500 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:21:56,500 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:56,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:21:56,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:21:56,501 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:21:56,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:56,502 INFO L85 PathProgramCache]: Analyzing trace with hash 28694886, now seen corresponding path program 1 times [2025-04-29 11:21:56,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:56,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622377415] [2025-04-29 11:21:56,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:56,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:56,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:21:56,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:21:56,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:56,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:56,543 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:21:56,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:56,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622377415] [2025-04-29 11:21:56,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622377415] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:21:56,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:21:56,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:21:56,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125842959] [2025-04-29 11:21:56,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:21:56,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:21:56,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:56,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:21:56,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:21:56,545 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 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:21:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:56,597 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-04-29 11:21:56,597 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:21:56,597 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-04-29 11:21:56,597 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:56,598 INFO L225 Difference]: With dead ends: 49 [2025-04-29 11:21:56,598 INFO L226 Difference]: Without dead ends: 49 [2025-04-29 11:21:56,598 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:21:56,598 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:56,598 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:21:56,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-29 11:21:56,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-04-29 11:21:56,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:21:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2025-04-29 11:21:56,605 INFO L79 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 5 [2025-04-29 11:21:56,605 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:56,605 INFO L485 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2025-04-29 11:21:56,606 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 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:21:56,606 INFO L278 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2025-04-29 11:21:56,606 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:21:56,606 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:56,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:56,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:21:56,606 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:21:56,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:56,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1826854847, now seen corresponding path program 1 times [2025-04-29 11:21:56,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:56,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221649671] [2025-04-29 11:21:56,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:56,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:56,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:21:56,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:21:56,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:56,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:56,647 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:21:56,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:56,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221649671] [2025-04-29 11:21:56,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221649671] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:21:56,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:21:56,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:21:56,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931216037] [2025-04-29 11:21:56,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:21:56,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:21:56,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:56,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:21:56,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:21:56,648 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:21:56,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:56,664 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2025-04-29 11:21:56,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:21:56,664 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:21:56,664 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:56,665 INFO L225 Difference]: With dead ends: 59 [2025-04-29 11:21:56,666 INFO L226 Difference]: Without dead ends: 59 [2025-04-29 11:21:56,666 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:21:56,666 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 9 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:56,667 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 101 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:21:56,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-29 11:21:56,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2025-04-29 11:21:56,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 49 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:21:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-04-29 11:21:56,673 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 7 [2025-04-29 11:21:56,673 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:56,673 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-04-29 11:21:56,673 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:21:56,673 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-04-29 11:21:56,673 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:21:56,673 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:56,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:56,674 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:21:56,674 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:21:56,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:56,674 INFO L85 PathProgramCache]: Analyzing trace with hash 381200138, now seen corresponding path program 1 times [2025-04-29 11:21:56,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:56,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681000952] [2025-04-29 11:21:56,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:56,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:56,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:21:56,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:21:56,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:56,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:56,757 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:21:56,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:56,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681000952] [2025-04-29 11:21:56,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681000952] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:21:56,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:21:56,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:21:56,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857033529] [2025-04-29 11:21:56,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:21:56,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:21:56,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:56,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:21:56,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:21:56,760 INFO L87 Difference]: Start difference. First operand 50 states and 55 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:21:56,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:56,826 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-04-29 11:21:56,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:21:56,827 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:21:56,828 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:56,829 INFO L225 Difference]: With dead ends: 49 [2025-04-29 11:21:56,829 INFO L226 Difference]: Without dead ends: 49 [2025-04-29 11:21:56,830 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:21:56,831 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:56,831 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:21:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-29 11:21:56,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-04-29 11:21:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.588235294117647) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:21:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2025-04-29 11:21:56,836 INFO L79 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 9 [2025-04-29 11:21:56,836 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:56,836 INFO L485 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2025-04-29 11:21:56,836 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:21:56,836 INFO L278 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2025-04-29 11:21:56,836 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:21:56,836 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:56,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:56,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:21:56,837 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:21:56,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:56,837 INFO L85 PathProgramCache]: Analyzing trace with hash 381200139, now seen corresponding path program 1 times [2025-04-29 11:21:56,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:56,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248840875] [2025-04-29 11:21:56,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:56,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:56,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:21:56,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:21:56,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:56,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:56,973 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:21:56,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:56,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248840875] [2025-04-29 11:21:56,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248840875] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:21:56,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:21:56,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:21:56,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611745771] [2025-04-29 11:21:56,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:21:56,975 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:21:56,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:56,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:21:56,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:21:56,976 INFO L87 Difference]: Start difference. First operand 49 states and 54 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:21:57,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:57,030 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-04-29 11:21:57,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:21:57,030 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:21:57,031 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:57,031 INFO L225 Difference]: With dead ends: 48 [2025-04-29 11:21:57,032 INFO L226 Difference]: Without dead ends: 48 [2025-04-29 11:21:57,032 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:21:57,032 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:57,033 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 145 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:21:57,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-29 11:21:57,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-04-29 11:21:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 47 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:21:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-04-29 11:21:57,037 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 9 [2025-04-29 11:21:57,037 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:57,037 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-04-29 11:21:57,037 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:21:57,037 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-04-29 11:21:57,037 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:21:57,037 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:57,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:57,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:21:57,038 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:21:57,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:57,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1735276049, now seen corresponding path program 1 times [2025-04-29 11:21:57,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:57,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410812205] [2025-04-29 11:21:57,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:57,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:57,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:21:57,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:21:57,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:57,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:21:57,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:57,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410812205] [2025-04-29 11:21:57,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410812205] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:21:57,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112320414] [2025-04-29 11:21:57,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:57,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:21:57,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:21:57,105 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:21:57,107 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:21:57,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:21:57,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:21:57,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:57,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:57,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:21:57,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:21:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:21:57,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:21:57,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:21:57,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112320414] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:21:57,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:21:57,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-29 11:21:57,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211854450] [2025-04-29 11:21:57,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:21:57,241 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:21:57,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:57,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:21:57,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:21:57,242 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:21:57,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:57,261 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2025-04-29 11:21:57,262 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:21:57,262 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-29 11:21:57,262 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:57,262 INFO L225 Difference]: With dead ends: 56 [2025-04-29 11:21:57,263 INFO L226 Difference]: Without dead ends: 56 [2025-04-29 11:21:57,263 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:21:57,263 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 7 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:57,263 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 97 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:21:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-29 11:21:57,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-29 11:21:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:21:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2025-04-29 11:21:57,268 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 15 [2025-04-29 11:21:57,268 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:57,268 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2025-04-29 11:21:57,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:21:57,268 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2025-04-29 11:21:57,269 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:21:57,269 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:57,269 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:57,276 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:21:57,472 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,SelfDestructingSolverStorable5 [2025-04-29 11:21:57,472 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:21:57,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:57,472 INFO L85 PathProgramCache]: Analyzing trace with hash -228171165, now seen corresponding path program 2 times [2025-04-29 11:21:57,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:57,472 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656620082] [2025-04-29 11:21:57,472 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:21:57,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:57,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-29 11:21:57,487 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 23 statements. [2025-04-29 11:21:57,487 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:21:57,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:21:57,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:57,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656620082] [2025-04-29 11:21:57,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656620082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:21:57,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:21:57,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:21:57,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36286107] [2025-04-29 11:21:57,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:21:57,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:21:57,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:57,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:21:57,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:21:57,512 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 4 states, 4 states have (on average 3.75) 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:21:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:57,537 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2025-04-29 11:21:57,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:21:57,540 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) 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 23 [2025-04-29 11:21:57,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:57,540 INFO L225 Difference]: With dead ends: 74 [2025-04-29 11:21:57,540 INFO L226 Difference]: Without dead ends: 74 [2025-04-29 11:21:57,540 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:21:57,541 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:57,541 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 132 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:21:57,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-04-29 11:21:57,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2025-04-29 11:21:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 57 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:21:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2025-04-29 11:21:57,543 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 23 [2025-04-29 11:21:57,543 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:57,543 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2025-04-29 11:21:57,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) 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:21:57,546 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2025-04-29 11:21:57,547 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:21:57,547 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:57,547 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:57,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:21:57,547 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:21:57,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:57,548 INFO L85 PathProgramCache]: Analyzing trace with hash -228170973, now seen corresponding path program 1 times [2025-04-29 11:21:57,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:57,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54131009] [2025-04-29 11:21:57,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:57,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:57,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:21:57,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:21:57,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:57,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:21:57,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:57,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54131009] [2025-04-29 11:21:57,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54131009] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:21:57,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:21:57,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:21:57,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031363146] [2025-04-29 11:21:57,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:21:57,684 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:21:57,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:57,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:21:57,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:21:57,685 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:21:57,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:57,844 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2025-04-29 11:21:57,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:21:57,845 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-29 11:21:57,847 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:57,848 INFO L225 Difference]: With dead ends: 61 [2025-04-29 11:21:57,848 INFO L226 Difference]: Without dead ends: 61 [2025-04-29 11:21:57,848 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:21:57,849 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 38 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:57,849 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 169 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:21:57,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-04-29 11:21:57,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-04-29 11:21:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 60 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:21:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2025-04-29 11:21:57,851 INFO L79 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 23 [2025-04-29 11:21:57,851 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:57,851 INFO L485 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2025-04-29 11:21:57,852 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:21:57,852 INFO L278 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2025-04-29 11:21:57,852 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:21:57,852 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:57,852 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:57,852 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:21:57,852 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:21:57,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:57,853 INFO L85 PathProgramCache]: Analyzing trace with hash -228170972, now seen corresponding path program 1 times [2025-04-29 11:21:57,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:57,853 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934990302] [2025-04-29 11:21:57,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:57,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:57,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:21:57,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:21:57,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:57,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:21:58,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:58,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934990302] [2025-04-29 11:21:58,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934990302] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:21:58,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:21:58,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:21:58,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614309348] [2025-04-29 11:21:58,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:21:58,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:21:58,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:58,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:21:58,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:21:58,078 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:21:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:58,235 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2025-04-29 11:21:58,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:21:58,235 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-29 11:21:58,235 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:58,236 INFO L225 Difference]: With dead ends: 61 [2025-04-29 11:21:58,236 INFO L226 Difference]: Without dead ends: 61 [2025-04-29 11:21:58,236 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:21:58,236 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 35 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:58,237 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 212 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:21:58,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-04-29 11:21:58,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-04-29 11:21:58,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 47 states have (on average 1.446808510638298) internal successors, (68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:21:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2025-04-29 11:21:58,239 INFO L79 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 23 [2025-04-29 11:21:58,239 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:58,239 INFO L485 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2025-04-29 11:21:58,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:21:58,239 INFO L278 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2025-04-29 11:21:58,239 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:21:58,239 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:58,240 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:58,240 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:21:58,240 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:21:58,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:58,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1517152103, now seen corresponding path program 1 times [2025-04-29 11:21:58,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:58,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336689581] [2025-04-29 11:21:58,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:58,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:58,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:21:58,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:21:58,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:58,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:58,351 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:21:58,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:58,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336689581] [2025-04-29 11:21:58,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336689581] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:21:58,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:21:58,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:21:58,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974760821] [2025-04-29 11:21:58,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:21:58,352 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:21:58,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:58,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:21:58,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:21:58,352 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:21:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:58,514 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2025-04-29 11:21:58,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:21:58,514 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-29 11:21:58,514 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:58,514 INFO L225 Difference]: With dead ends: 64 [2025-04-29 11:21:58,514 INFO L226 Difference]: Without dead ends: 64 [2025-04-29 11:21:58,515 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:21:58,515 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 37 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:58,515 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 169 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:21:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-04-29 11:21:58,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-04-29 11:21:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.48) internal successors, (74), 63 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:21:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2025-04-29 11:21:58,520 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 24 [2025-04-29 11:21:58,520 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:58,520 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2025-04-29 11:21:58,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:21:58,523 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2025-04-29 11:21:58,523 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:21:58,523 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:58,523 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:58,524 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:21:58,524 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:21:58,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:58,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1517152104, now seen corresponding path program 1 times [2025-04-29 11:21:58,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:58,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545452475] [2025-04-29 11:21:58,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:58,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:58,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:21:58,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:21:58,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:58,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:58,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:21:58,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:58,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545452475] [2025-04-29 11:21:58,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545452475] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:21:58,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122400428] [2025-04-29 11:21:58,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:58,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:21:58,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:21:58,641 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:21:58,642 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:21:58,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:21:58,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:21:58,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:58,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:58,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:21:58,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:21:58,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:21:58,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:21:58,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122400428] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:21:58,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:21:58,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-04-29 11:21:58,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109129469] [2025-04-29 11:21:58,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:21:58,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:21:58,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:58,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:21:58,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:21:58,761 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:21:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:58,775 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2025-04-29 11:21:58,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:21:58,775 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-29 11:21:58,775 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:58,776 INFO L225 Difference]: With dead ends: 81 [2025-04-29 11:21:58,776 INFO L226 Difference]: Without dead ends: 81 [2025-04-29 11:21:58,776 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:21:58,776 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 41 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:58,776 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 105 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:21:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-04-29 11:21:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2025-04-29 11:21:58,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 64 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:21:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2025-04-29 11:21:58,779 INFO L79 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 24 [2025-04-29 11:21:58,779 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:58,779 INFO L485 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-04-29 11:21:58,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:21:58,779 INFO L278 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2025-04-29 11:21:58,780 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:21:58,780 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:58,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:58,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:21:58,980 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,SelfDestructingSolverStorable10 [2025-04-29 11:21:58,981 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:21:58,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:58,981 INFO L85 PathProgramCache]: Analyzing trace with hash -907098282, now seen corresponding path program 1 times [2025-04-29 11:21:58,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:58,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810151157] [2025-04-29 11:21:58,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:58,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:58,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:21:58,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:21:58,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:58,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:59,074 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:21:59,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:59,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810151157] [2025-04-29 11:21:59,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810151157] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:21:59,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652424744] [2025-04-29 11:21:59,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:59,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:21:59,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:21:59,077 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:21:59,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:21:59,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:21:59,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:21:59,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:59,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:59,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:21:59,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:21:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:21:59,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:21:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:21:59,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652424744] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:21:59,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:21:59,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-04-29 11:21:59,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064084622] [2025-04-29 11:21:59,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:21:59,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:21:59,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:59,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:21:59,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:21:59,255 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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:21:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:59,298 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2025-04-29 11:21:59,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:21:59,298 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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 28 [2025-04-29 11:21:59,298 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:59,299 INFO L225 Difference]: With dead ends: 109 [2025-04-29 11:21:59,299 INFO L226 Difference]: Without dead ends: 109 [2025-04-29 11:21:59,299 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:21:59,299 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 137 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:59,299 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 202 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:21:59,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-29 11:21:59,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2025-04-29 11:21:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.476923076923077) internal successors, (96), 78 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:21:59,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2025-04-29 11:21:59,302 INFO L79 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 28 [2025-04-29 11:21:59,302 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:59,303 INFO L485 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2025-04-29 11:21:59,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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:21:59,303 INFO L278 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2025-04-29 11:21:59,303 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:21:59,303 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:59,303 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:59,309 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:21:59,503 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:21:59,504 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:21:59,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:59,504 INFO L85 PathProgramCache]: Analyzing trace with hash -346281672, now seen corresponding path program 1 times [2025-04-29 11:21:59,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:59,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730499343] [2025-04-29 11:21:59,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:59,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:59,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:21:59,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:21:59,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:59,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:21:59,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:59,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730499343] [2025-04-29 11:21:59,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730499343] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:21:59,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923050081] [2025-04-29 11:21:59,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:59,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:21:59,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:21:59,578 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:21:59,580 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:21:59,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:21:59,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:21:59,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:59,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:59,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:21:59,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:21:59,698 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:21:59,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:21:59,720 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:21:59,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923050081] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:21:59,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:21:59,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-04-29 11:21:59,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570724305] [2025-04-29 11:21:59,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:21:59,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:21:59,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:59,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:21:59,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:21:59,722 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:21:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:59,763 INFO L93 Difference]: Finished difference Result 106 states and 124 transitions. [2025-04-29 11:21:59,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:21:59,763 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-29 11:21:59,764 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:59,764 INFO L225 Difference]: With dead ends: 106 [2025-04-29 11:21:59,764 INFO L226 Difference]: Without dead ends: 106 [2025-04-29 11:21:59,764 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:21:59,765 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 56 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:59,765 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 194 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:21:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-29 11:21:59,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 83. [2025-04-29 11:21:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.463768115942029) internal successors, (101), 82 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:21:59,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2025-04-29 11:21:59,771 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 30 [2025-04-29 11:21:59,771 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:59,771 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2025-04-29 11:21:59,771 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:21:59,771 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2025-04-29 11:21:59,771 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:21:59,771 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:59,771 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:59,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:21:59,972 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:21:59,972 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:21:59,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:59,972 INFO L85 PathProgramCache]: Analyzing trace with hash -346281480, now seen corresponding path program 1 times [2025-04-29 11:21:59,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:59,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941954239] [2025-04-29 11:21:59,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:59,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:59,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:22:00,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:22:00,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:00,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:22:00,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:00,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941954239] [2025-04-29 11:22:00,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941954239] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:00,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109031964] [2025-04-29 11:22:00,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:00,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:00,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:00,525 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:22:00,526 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:22:00,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:22:00,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:22:00,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:00,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:00,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-29 11:22:00,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:00,645 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:00,645 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-29 11:22:00,734 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:22:00,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:00,885 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2025-04-29 11:22:00,923 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 31 treesize of output 13 [2025-04-29 11:22:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:22:00,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:13,302 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-29 11:22:13,303 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 1 [2025-04-29 11:22:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:22:13,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109031964] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:13,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:13,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 12] total 34 [2025-04-29 11:22:13,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699662609] [2025-04-29 11:22:13,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:13,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-29 11:22:13,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:13,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-29 11:22:13,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1087, Unknown=3, NotChecked=0, Total=1190 [2025-04-29 11:22:13,304 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:14,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:14,116 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2025-04-29 11:22:14,116 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:22:14,116 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-29 11:22:14,117 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:14,118 INFO L225 Difference]: With dead ends: 133 [2025-04-29 11:22:14,118 INFO L226 Difference]: Without dead ends: 133 [2025-04-29 11:22:14,119 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=212, Invalid=2041, Unknown=3, NotChecked=0, Total=2256 [2025-04-29 11:22:14,119 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 71 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:14,119 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 540 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 11:22:14,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-04-29 11:22:14,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 92. [2025-04-29 11:22:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 91 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:14,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2025-04-29 11:22:14,124 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 30 [2025-04-29 11:22:14,124 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:14,125 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2025-04-29 11:22:14,125 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:14,125 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2025-04-29 11:22:14,125 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:22:14,125 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:14,125 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:14,133 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:22:14,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-29 11:22:14,331 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:14,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:14,331 INFO L85 PathProgramCache]: Analyzing trace with hash -346281479, now seen corresponding path program 1 times [2025-04-29 11:22:14,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:14,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073903272] [2025-04-29 11:22:14,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:14,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:14,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:22:14,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:22:14,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:14,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:22:15,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:15,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073903272] [2025-04-29 11:22:15,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073903272] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:15,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540381578] [2025-04-29 11:22:15,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:15,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:15,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:15,009 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:22:15,010 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:22:15,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:22:15,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:22:15,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:15,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:15,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-04-29 11:22:15,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:15,225 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:22:15,225 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:22:15,230 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:22:15,335 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 19 treesize of output 1 [2025-04-29 11:22:15,338 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:22:15,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:15,547 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2025-04-29 11:22:15,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:15,553 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2025-04-29 11:22:15,616 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 39 treesize of output 21 [2025-04-29 11:22:15,619 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-04-29 11:22:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:22:15,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:15,882 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_692 (Array Int Int))) (or (not (= v_ArrVal_692 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_692 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (< 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1)))) (forall ((v_ArrVal_692 (Array Int Int))) (or (not (= v_ArrVal_692 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_692 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_691 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_691)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))))) is different from false [2025-04-29 11:22:16,319 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 49 treesize of output 45 [2025-04-29 11:22:16,338 INFO L325 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-04-29 11:22:16,338 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2025-04-29 11:22:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2025-04-29 11:22:16,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540381578] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:16,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:16,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 15] total 43 [2025-04-29 11:22:16,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374968694] [2025-04-29 11:22:16,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:16,409 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-29 11:22:16,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:16,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-29 11:22:16,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1684, Unknown=1, NotChecked=82, Total=1892 [2025-04-29 11:22:16,410 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 44 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 44 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:17,538 INFO L93 Difference]: Finished difference Result 142 states and 182 transitions. [2025-04-29 11:22:17,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:22:17,538 INFO L79 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 44 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-29 11:22:17,538 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:17,539 INFO L225 Difference]: With dead ends: 142 [2025-04-29 11:22:17,539 INFO L226 Difference]: Without dead ends: 142 [2025-04-29 11:22:17,540 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=279, Invalid=3030, Unknown=1, NotChecked=112, Total=3422 [2025-04-29 11:22:17,540 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 80 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:17,541 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 711 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1078 Invalid, 0 Unknown, 78 Unchecked, 0.6s Time] [2025-04-29 11:22:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-04-29 11:22:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 99. [2025-04-29 11:22:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 98 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:22:17,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 125 transitions. [2025-04-29 11:22:17,543 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 125 transitions. Word has length 30 [2025-04-29 11:22:17,543 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:17,544 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 125 transitions. [2025-04-29 11:22:17,544 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 44 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:17,544 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 125 transitions. [2025-04-29 11:22:17,544 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-29 11:22:17,544 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:17,544 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:17,551 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:22:17,744 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-29 11:22:17,745 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:17,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:17,745 INFO L85 PathProgramCache]: Analyzing trace with hash -855506876, now seen corresponding path program 2 times [2025-04-29 11:22:17,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:17,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122055678] [2025-04-29 11:22:17,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:22:17,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:17,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-29 11:22:17,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:22:17,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:22:17,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:22:17,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:17,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122055678] [2025-04-29 11:22:17,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122055678] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:17,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:17,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:22:17,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751635493] [2025-04-29 11:22:17,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:17,938 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:22:17,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:17,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:22:17,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:22:17,939 INFO L87 Difference]: Start difference. First operand 99 states and 125 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 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:22:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:18,081 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2025-04-29 11:22:18,081 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:22:18,081 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 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 32 [2025-04-29 11:22:18,082 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:18,082 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:22:18,082 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 11:22:18,082 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:22:18,083 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 30 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:18,083 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 212 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 11:22:18,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-04-29 11:22:18,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.423529411764706) internal successors, (121), 98 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2025-04-29 11:22:18,085 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 32 [2025-04-29 11:22:18,085 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:18,085 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2025-04-29 11:22:18,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 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:22:18,085 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2025-04-29 11:22:18,086 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 11:22:18,087 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:18,087 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:18,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:22:18,088 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:18,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:18,088 INFO L85 PathProgramCache]: Analyzing trace with hash -75125281, now seen corresponding path program 1 times [2025-04-29 11:22:18,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:18,088 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657122868] [2025-04-29 11:22:18,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:18,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:18,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:22:18,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:22:18,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:18,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 11:22:18,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:18,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657122868] [2025-04-29 11:22:18,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657122868] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:18,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:18,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:22:18,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553367873] [2025-04-29 11:22:18,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:18,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:18,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:18,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:18,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:18,135 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:18,151 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2025-04-29 11:22:18,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:22:18,152 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-29 11:22:18,152 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:18,152 INFO L225 Difference]: With dead ends: 94 [2025-04-29 11:22:18,152 INFO L226 Difference]: Without dead ends: 94 [2025-04-29 11:22:18,152 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:18,153 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:18,153 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:18,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-04-29 11:22:18,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-04-29 11:22:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.375) internal successors, (110), 93 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:22:18,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2025-04-29 11:22:18,155 INFO L79 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 35 [2025-04-29 11:22:18,155 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:18,155 INFO L485 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2025-04-29 11:22:18,155 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:18,155 INFO L278 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2025-04-29 11:22:18,155 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 11:22:18,155 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:18,155 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-29 11:22:18,155 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:22:18,155 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:18,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:18,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2077620419, now seen corresponding path program 2 times [2025-04-29 11:22:18,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:18,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049718914] [2025-04-29 11:22:18,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:22:18,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:18,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-29 11:22:18,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:22:18,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:22:18,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 11:22:18,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:18,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049718914] [2025-04-29 11:22:18,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049718914] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:18,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283505832] [2025-04-29 11:22:18,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:22:18,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:18,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:18,233 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:22:18,235 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:22:18,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-29 11:22:18,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:22:18,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:22:18,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:18,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:22:18,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 11:22:18,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:18,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283505832] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:18,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:22:18,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-04-29 11:22:18,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762613173] [2025-04-29 11:22:18,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:18,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:22:18,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:18,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:22:18,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:22:18,399 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:22:18,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:18,417 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2025-04-29 11:22:18,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:22:18,418 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 37 [2025-04-29 11:22:18,418 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:18,418 INFO L225 Difference]: With dead ends: 71 [2025-04-29 11:22:18,418 INFO L226 Difference]: Without dead ends: 71 [2025-04-29 11:22:18,418 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:22:18,419 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 38 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:18,419 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 94 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:18,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-04-29 11:22:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2025-04-29 11:22:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:18,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2025-04-29 11:22:18,421 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 37 [2025-04-29 11:22:18,421 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:18,421 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2025-04-29 11:22:18,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:22:18,421 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2025-04-29 11:22:18,422 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:22:18,422 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:18,422 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:18,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:18,626 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:18,626 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:18,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:18,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1952297423, now seen corresponding path program 1 times [2025-04-29 11:22:18,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:18,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344462572] [2025-04-29 11:22:18,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:18,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:18,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:22:18,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:22:18,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:18,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 11:22:18,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:18,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344462572] [2025-04-29 11:22:18,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344462572] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:18,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520924230] [2025-04-29 11:22:18,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:18,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:18,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:18,709 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:22:18,710 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:22:18,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:22:18,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:22:18,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:18,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:18,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:22:18,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:18,835 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 11:22:18,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:18,852 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 11:22:18,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520924230] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:18,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:18,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-04-29 11:22:18,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144698502] [2025-04-29 11:22:18,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:18,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:22:18,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:18,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:22:18,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:18,854 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:22:18,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:18,879 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2025-04-29 11:22:18,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:18,879 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-29 11:22:18,879 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:18,879 INFO L225 Difference]: With dead ends: 68 [2025-04-29 11:22:18,879 INFO L226 Difference]: Without dead ends: 68 [2025-04-29 11:22:18,880 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:22:18,880 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 45 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:18,880 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 133 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-04-29 11:22:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-04-29 11:22:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:18,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2025-04-29 11:22:18,881 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 41 [2025-04-29 11:22:18,882 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:18,882 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2025-04-29 11:22:18,882 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:22:18,882 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2025-04-29 11:22:18,882 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-29 11:22:18,882 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:18,882 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:18,889 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:22:19,087 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:19,087 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:19,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:19,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1136522892, now seen corresponding path program 1 times [2025-04-29 11:22:19,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:19,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884931954] [2025-04-29 11:22:19,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:19,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:19,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:22:19,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:22:19,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:19,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:20,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:20,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884931954] [2025-04-29 11:22:20,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884931954] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:20,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740020981] [2025-04-29 11:22:20,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:20,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:20,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:20,127 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:20,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:22:20,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:22:20,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:22:20,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:20,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:20,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-04-29 11:22:20,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:20,247 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 6 treesize of output 5 [2025-04-29 11:22:20,339 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:22:20,339 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:22:20,411 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:22:20,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:20,551 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-04-29 11:22:20,676 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:22:20,676 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-04-29 11:22:20,772 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 31 treesize of output 13 [2025-04-29 11:22:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:22:20,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:20,853 INFO L325 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-04-29 11:22:20,854 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-04-29 11:22:20,856 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1115 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1115) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2025-04-29 11:22:20,861 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1115 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem7#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_#t~mem7#1.base| v_ArrVal_1115) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2025-04-29 11:22:20,866 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1115 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1115) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) .cse0))) is different from false [2025-04-29 11:22:20,874 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1115 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1115) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse0)))) is different from false [2025-04-29 11:22:20,883 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1113 Int)) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1113))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1115) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))) is different from false [2025-04-29 11:22:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-04-29 11:22:21,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740020981] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:21,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:21,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 21] total 56 [2025-04-29 11:22:21,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200564738] [2025-04-29 11:22:21,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:21,163 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-29 11:22:21,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:21,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-29 11:22:21,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2524, Unknown=5, NotChecked=520, Total=3192 [2025-04-29 11:22:21,164 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 57 states, 56 states have (on average 2.017857142857143) internal successors, (113), 57 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:22:22,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:22,534 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2025-04-29 11:22:22,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-29 11:22:22,534 INFO L79 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.017857142857143) internal successors, (113), 57 states have internal predecessors, (113), 0 states have call successors, (0), 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 44 [2025-04-29 11:22:22,534 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:22,534 INFO L225 Difference]: With dead ends: 78 [2025-04-29 11:22:22,534 INFO L226 Difference]: Without dead ends: 78 [2025-04-29 11:22:22,536 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=424, Invalid=5597, Unknown=5, NotChecked=780, Total=6806 [2025-04-29 11:22:22,536 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 198 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 340 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:22,536 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 835 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1595 Invalid, 0 Unknown, 340 Unchecked, 0.6s Time] [2025-04-29 11:22:22,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-29 11:22:22,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2025-04-29 11:22:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:22:22,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2025-04-29 11:22:22,538 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 44 [2025-04-29 11:22:22,538 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:22,538 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2025-04-29 11:22:22,538 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.017857142857143) internal successors, (113), 57 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:22:22,539 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2025-04-29 11:22:22,539 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-29 11:22:22,539 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:22,539 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:22,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:22,739 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:22,740 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:22,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:22,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1136522891, now seen corresponding path program 1 times [2025-04-29 11:22:22,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:22,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005133946] [2025-04-29 11:22:22,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:22,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:22,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:22:22,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:22:22,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:22,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:22:23,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:23,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005133946] [2025-04-29 11:22:23,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005133946] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:23,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190900319] [2025-04-29 11:22:23,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:23,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:23,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:23,648 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:23,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:22:23,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:22:23,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:22:23,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:23,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:23,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-04-29 11:22:23,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:23,858 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:22:23,859 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:22:23,928 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:22:23,931 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 19 treesize of output 1 [2025-04-29 11:22:24,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:24,059 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-29 11:22:24,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:24,062 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-04-29 11:22:24,185 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:22:24,185 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2025-04-29 11:22:24,188 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2025-04-29 11:22:24,309 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 39 treesize of output 21 [2025-04-29 11:22:24,313 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-04-29 11:22:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:22:24,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:24,481 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:22:24,481 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2025-04-29 11:22:24,503 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1227 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1227) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (forall ((v_prenex_2 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1228 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1228) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 1))))) is different from false [2025-04-29 11:22:24,522 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_prenex_2 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_update_at_#t~mem7#1.base| v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1227 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem7#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_#t~mem7#1.base| v_ArrVal_1227) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1228 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_update_at_#t~mem7#1.base| v_ArrVal_1228) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (+ |c_ULTIMATE.start_sll_update_at_#t~mem7#1.offset| 1))))) is different from false [2025-04-29 11:22:24,536 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1228 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1228) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2) 1))) (forall ((v_ArrVal_1227 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1227) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse0)) (forall ((v_prenex_2 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2025-04-29 11:22:24,554 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1228 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1228) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_1227 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1227) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_prenex_2 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2025-04-29 11:22:24,596 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse3 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1225 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1225)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1227) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_1224 (Array Int Int))) (or (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1224))) (< (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1225)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1228) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) (+ (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 1)))) (not (= (store .cse5 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1224 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1224)))) (forall ((v_ArrVal_1224 (Array Int Int))) (or (not (= (store .cse5 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1224 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1224)) (forall ((v_prenex_2 (Array Int Int)) (v_ArrVal_1225 Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1224) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1225)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))))) is different from false [2025-04-29 11:22:24,653 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select .cse3 .cse1)) (.cse2 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (forall ((v_ArrVal_1224 (Array Int Int))) (or (forall ((v_ArrVal_1228 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1224) .cse0 v_ArrVal_1228) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (+ (select v_ArrVal_1224 .cse1) 1))) (not (= v_ArrVal_1224 (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| (select v_ArrVal_1224 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1225 Int)) (= .cse0 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_1225)) .cse0 v_ArrVal_1227) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (forall ((v_ArrVal_1224 (Array Int Int))) (or (forall ((v_prenex_2 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1224) .cse0 v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (not (= v_ArrVal_1224 (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| (select v_ArrVal_1224 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))))))))))) is different from false [2025-04-29 11:22:24,690 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse1 (select .cse3 .cse2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (forall ((v_ArrVal_1224 (Array Int Int))) (or (not (= v_ArrVal_1224 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| (select v_ArrVal_1224 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|)))) (forall ((v_prenex_2 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1224) .cse1 v_prenex_2) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (forall ((v_ArrVal_1224 (Array Int Int))) (or (not (= v_ArrVal_1224 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| (select v_ArrVal_1224 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|)))) (forall ((v_ArrVal_1228 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1224) .cse1 v_ArrVal_1228) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) (+ (select v_ArrVal_1224 .cse2) 1))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1225 Int)) (= .cse1 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_1225)) .cse1 v_ArrVal_1227) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2)))))))) is different from false [2025-04-29 11:22:24,722 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2)) (.cse3 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1225 Int)) (= .cse0 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_1225)) .cse0 v_ArrVal_1227) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (forall ((v_ArrVal_1224 (Array Int Int))) (or (forall ((v_prenex_2 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1224) .cse0 v_prenex_2) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (not (= v_ArrVal_1224 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| (select v_ArrVal_1224 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|)))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (forall ((v_ArrVal_1224 (Array Int Int))) (or (forall ((v_ArrVal_1228 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1224) .cse0 v_ArrVal_1228) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) (+ (select v_ArrVal_1224 .cse2) 1))) (not (= v_ArrVal_1224 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| (select v_ArrVal_1224 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|)))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|)))))) is different from false [2025-04-29 11:22:24,758 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse0 (select .cse3 .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (forall ((v_ArrVal_1224 (Array Int Int))) (or (forall ((v_prenex_2 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1224) .cse0 v_prenex_2) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (not (= v_ArrVal_1224 (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| (select v_ArrVal_1224 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|)))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (forall ((v_ArrVal_1224 (Array Int Int))) (or (not (= v_ArrVal_1224 (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| (select v_ArrVal_1224 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|)))) (forall ((v_ArrVal_1228 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1224) .cse0 v_ArrVal_1228) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) (+ (select v_ArrVal_1224 .cse1) 1))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1225 Int)) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_1225)) .cse0 v_ArrVal_1227) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) .cse0)) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|)))))) is different from false [2025-04-29 11:22:24,777 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 114 treesize of output 110 [2025-04-29 11:22:24,809 INFO L325 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2025-04-29 11:22:24,810 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 106 treesize of output 156 [2025-04-29 11:22:24,815 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 86 treesize of output 82 [2025-04-29 11:22:24,822 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 82 treesize of output 78 [2025-04-29 11:22:24,845 INFO L325 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2025-04-29 11:22:24,845 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 91 [2025-04-29 11:22:24,853 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 96 treesize of output 84 [2025-04-29 11:22:24,863 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 72 treesize of output 68 [2025-04-29 11:22:24,923 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 8 treesize of output 6 [2025-04-29 11:22:24,952 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 118 treesize of output 110 [2025-04-29 11:22:24,984 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 254 treesize of output 238 [2025-04-29 11:22:25,124 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:22:25,124 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:22:25,185 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 10 not checked. [2025-04-29 11:22:25,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190900319] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:25,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:25,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 22] total 54 [2025-04-29 11:22:25,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163018602] [2025-04-29 11:22:25,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:25,186 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-04-29 11:22:25,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:25,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-04-29 11:22:25,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1932, Unknown=9, NotChecked=864, Total=2970 [2025-04-29 11:22:25,187 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 55 states, 54 states have (on average 2.111111111111111) internal successors, (114), 55 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:26,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:26,279 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2025-04-29 11:22:26,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:22:26,279 INFO L79 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.111111111111111) internal successors, (114), 55 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-29 11:22:26,279 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:26,280 INFO L225 Difference]: With dead ends: 78 [2025-04-29 11:22:26,280 INFO L226 Difference]: Without dead ends: 78 [2025-04-29 11:22:26,281 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=309, Invalid=3258, Unknown=9, NotChecked=1116, Total=4692 [2025-04-29 11:22:26,281 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 55 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 522 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:26,281 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 998 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1268 Invalid, 0 Unknown, 522 Unchecked, 0.5s Time] [2025-04-29 11:22:26,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-29 11:22:26,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2025-04-29 11:22:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2025-04-29 11:22:26,282 INFO L79 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 44 [2025-04-29 11:22:26,283 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:26,283 INFO L485 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2025-04-29 11:22:26,283 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.111111111111111) internal successors, (114), 55 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:26,283 INFO L278 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2025-04-29 11:22:26,283 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 11:22:26,283 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:26,283 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:26,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:22:26,484 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-29 11:22:26,484 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:26,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:26,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2146604557, now seen corresponding path program 1 times [2025-04-29 11:22:26,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:26,484 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987163256] [2025-04-29 11:22:26,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:26,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:26,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:22:26,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:22:26,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:26,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:22:26,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:26,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987163256] [2025-04-29 11:22:26,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987163256] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:26,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:26,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:22:26,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122366583] [2025-04-29 11:22:26,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:26,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:22:26,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:26,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:22:26,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:22:26,577 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:22:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:26,711 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2025-04-29 11:22:26,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:22:26,711 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-29 11:22:26,711 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:26,711 INFO L225 Difference]: With dead ends: 72 [2025-04-29 11:22:26,711 INFO L226 Difference]: Without dead ends: 72 [2025-04-29 11:22:26,711 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:22:26,714 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:26,714 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 124 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:26,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-29 11:22:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-04-29 11:22:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:22:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2025-04-29 11:22:26,715 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 47 [2025-04-29 11:22:26,715 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:26,715 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2025-04-29 11:22:26,715 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:22:26,715 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2025-04-29 11:22:26,715 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 11:22:26,715 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:26,715 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:26,715 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:22:26,716 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:26,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:26,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2146604556, now seen corresponding path program 1 times [2025-04-29 11:22:26,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:26,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724888630] [2025-04-29 11:22:26,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:26,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:26,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:22:26,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:22:26,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:26,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-29 11:22:26,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:26,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724888630] [2025-04-29 11:22:26,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724888630] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:26,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303906874] [2025-04-29 11:22:26,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:26,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:26,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:26,768 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:26,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 11:22:26,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:22:26,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:22:26,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:26,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:26,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:22:26,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-29 11:22:26,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-29 11:22:26,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303906874] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:26,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:26,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-04-29 11:22:26,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903666027] [2025-04-29 11:22:26,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:26,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:22:26,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:26,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:22:26,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:26,933 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 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:22:26,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:26,963 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2025-04-29 11:22:26,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:26,963 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 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 47 [2025-04-29 11:22:26,964 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:26,964 INFO L225 Difference]: With dead ends: 72 [2025-04-29 11:22:26,964 INFO L226 Difference]: Without dead ends: 72 [2025-04-29 11:22:26,964 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:22:26,965 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 26 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:26,965 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 172 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:26,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-29 11:22:26,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-04-29 11:22:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 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:22:26,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2025-04-29 11:22:26,967 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 47 [2025-04-29 11:22:26,967 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:26,967 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2025-04-29 11:22:26,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 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:22:26,967 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2025-04-29 11:22:26,968 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 11:22:26,968 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:26,968 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:26,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:27,172 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-29 11:22:27,172 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:27,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:27,173 INFO L85 PathProgramCache]: Analyzing trace with hash -931968242, now seen corresponding path program 2 times [2025-04-29 11:22:27,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:27,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840013936] [2025-04-29 11:22:27,173 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:22:27,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:27,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-29 11:22:27,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:22:27,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:22:27,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:22:27,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:27,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840013936] [2025-04-29 11:22:27,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840013936] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:27,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612636429] [2025-04-29 11:22:27,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:22:27,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:27,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:27,235 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:27,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-29 11:22:27,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-29 11:22:27,368 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:22:27,368 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:22:27,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:27,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:22:27,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:22:27,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:22:27,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612636429] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:27,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:27,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-04-29 11:22:27,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053826915] [2025-04-29 11:22:27,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:27,460 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:22:27,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:27,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:22:27,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:27,461 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:27,479 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2025-04-29 11:22:27,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:27,480 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-29 11:22:27,480 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:27,481 INFO L225 Difference]: With dead ends: 63 [2025-04-29 11:22:27,481 INFO L226 Difference]: Without dead ends: 63 [2025-04-29 11:22:27,481 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:22:27,481 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:27,481 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 119 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:27,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-29 11:22:27,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-04-29 11:22:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 62 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:22:27,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2025-04-29 11:22:27,483 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 47 [2025-04-29 11:22:27,483 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:27,483 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2025-04-29 11:22:27,483 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:27,483 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2025-04-29 11:22:27,483 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-29 11:22:27,483 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:27,483 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:27,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-29 11:22:27,683 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-29 11:22:27,683 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:27,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:27,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1477347866, now seen corresponding path program 1 times [2025-04-29 11:22:27,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:27,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545086876] [2025-04-29 11:22:27,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:27,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:27,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:22:27,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:22:27,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:27,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:22:27,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:27,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545086876] [2025-04-29 11:22:27,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545086876] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:27,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:27,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:22:27,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366757033] [2025-04-29 11:22:27,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:27,861 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:22:27,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:27,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:22:27,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:22:27,862 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 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:22:27,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:27,986 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2025-04-29 11:22:27,987 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:22:27,987 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 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 50 [2025-04-29 11:22:27,987 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:27,987 INFO L225 Difference]: With dead ends: 65 [2025-04-29 11:22:27,987 INFO L226 Difference]: Without dead ends: 65 [2025-04-29 11:22:27,987 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:22:27,987 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:27,988 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 149 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:27,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-04-29 11:22:27,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-04-29 11:22:27,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 64 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:27,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2025-04-29 11:22:27,989 INFO L79 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 50 [2025-04-29 11:22:27,989 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:27,989 INFO L485 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2025-04-29 11:22:27,989 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 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:22:27,989 INFO L278 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2025-04-29 11:22:27,989 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-29 11:22:27,989 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:27,989 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:27,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-29 11:22:27,989 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:27,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:27,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1446844435, now seen corresponding path program 1 times [2025-04-29 11:22:27,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:27,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515462345] [2025-04-29 11:22:27,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:27,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:28,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-29 11:22:28,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:22:28,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:28,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:22:28,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:28,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515462345] [2025-04-29 11:22:28,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515462345] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:28,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:28,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:22:28,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219417335] [2025-04-29 11:22:28,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:28,068 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:22:28,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:28,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:22:28,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:22:28,069 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:28,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:28,157 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2025-04-29 11:22:28,157 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:22:28,157 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-04-29 11:22:28,158 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:28,158 INFO L225 Difference]: With dead ends: 67 [2025-04-29 11:22:28,158 INFO L226 Difference]: Without dead ends: 67 [2025-04-29 11:22:28,158 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:22:28,158 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:28,158 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 188 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:28,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-29 11:22:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2025-04-29 11:22:28,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.1) internal successors, (66), 64 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:22:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2025-04-29 11:22:28,161 INFO L79 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 51 [2025-04-29 11:22:28,161 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:28,161 INFO L485 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2025-04-29 11:22:28,161 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:28,161 INFO L278 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2025-04-29 11:22:28,161 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-29 11:22:28,161 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:28,161 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:28,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-29 11:22:28,161 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:28,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:28,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1140419775, now seen corresponding path program 1 times [2025-04-29 11:22:28,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:28,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930208097] [2025-04-29 11:22:28,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:28,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:28,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:22:28,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:22:28,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:28,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:28,261 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:22:28,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:28,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930208097] [2025-04-29 11:22:28,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930208097] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:28,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:28,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:22:28,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167912151] [2025-04-29 11:22:28,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:28,262 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:22:28,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:28,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:22:28,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:22:28,263 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:28,366 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2025-04-29 11:22:28,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:22:28,366 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-04-29 11:22:28,366 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:28,367 INFO L225 Difference]: With dead ends: 66 [2025-04-29 11:22:28,367 INFO L226 Difference]: Without dead ends: 66 [2025-04-29 11:22:28,367 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:22:28,367 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:28,367 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 172 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:28,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-29 11:22:28,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-04-29 11:22:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.098360655737705) internal successors, (67), 65 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2025-04-29 11:22:28,369 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 53 [2025-04-29 11:22:28,369 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:28,369 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2025-04-29 11:22:28,369 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:28,369 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2025-04-29 11:22:28,369 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-29 11:22:28,369 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:28,369 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:28,369 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-29 11:22:28,370 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:28,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:28,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1054326494, now seen corresponding path program 1 times [2025-04-29 11:22:28,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:28,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656270740] [2025-04-29 11:22:28,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:28,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:28,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:22:28,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:22:28,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:28,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:22:29,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:29,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656270740] [2025-04-29 11:22:29,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656270740] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:29,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145036484] [2025-04-29 11:22:29,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:29,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:29,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:29,549 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:29,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-29 11:22:29,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:22:29,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:22:29,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:29,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:29,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-04-29 11:22:29,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:29,701 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 6 treesize of output 5 [2025-04-29 11:22:29,796 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:22:29,796 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:22:29,895 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:22:30,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:30,066 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-04-29 11:22:30,171 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:22:30,172 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-04-29 11:22:30,292 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:22:30,292 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 27 treesize of output 21 [2025-04-29 11:22:30,440 INFO L325 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-04-29 11:22:30,441 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:22:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-29 11:22:30,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:30,624 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:22:30,624 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2025-04-29 11:22:31,319 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-29 11:22:31,330 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 90 treesize of output 86 [2025-04-29 11:22:31,341 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 14 treesize of output 12 [2025-04-29 11:22:31,342 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:22:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:22:31,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145036484] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:31,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:31,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 22, 23] total 62 [2025-04-29 11:22:31,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114715819] [2025-04-29 11:22:31,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:31,492 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-04-29 11:22:31,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:31,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-04-29 11:22:31,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=3721, Unknown=0, NotChecked=0, Total=3906 [2025-04-29 11:22:31,494 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand has 63 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 63 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:33,005 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2025-04-29 11:22:33,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-29 11:22:33,005 INFO L79 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 63 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-04-29 11:22:33,005 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:33,006 INFO L225 Difference]: With dead ends: 75 [2025-04-29 11:22:33,006 INFO L226 Difference]: Without dead ends: 75 [2025-04-29 11:22:33,007 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=476, Invalid=7534, Unknown=0, NotChecked=0, Total=8010 [2025-04-29 11:22:33,008 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 59 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:33,008 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 588 Invalid, 2202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2186 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-29 11:22:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-29 11:22:33,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2025-04-29 11:22:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.125) internal successors, (72), 68 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:33,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2025-04-29 11:22:33,009 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 56 [2025-04-29 11:22:33,009 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:33,010 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2025-04-29 11:22:33,010 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 63 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:33,010 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2025-04-29 11:22:33,010 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-29 11:22:33,010 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:33,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:33,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-29 11:22:33,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-29 11:22:33,211 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:33,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:33,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1054326495, now seen corresponding path program 1 times [2025-04-29 11:22:33,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:33,212 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484134890] [2025-04-29 11:22:33,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:33,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:33,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:22:33,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:22:33,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:33,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:34,104 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:22:34,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:34,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484134890] [2025-04-29 11:22:34,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484134890] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:34,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528089455] [2025-04-29 11:22:34,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:34,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:34,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:34,106 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:34,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-29 11:22:34,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:22:34,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:22:34,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:34,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:34,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-04-29 11:22:34,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:34,269 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 6 treesize of output 5 [2025-04-29 11:22:34,274 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:22:34,410 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:22:34,411 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:22:34,418 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:22:34,512 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 15 treesize of output 1 [2025-04-29 11:22:34,515 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:22:34,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:34,681 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 11:22:34,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:34,687 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-04-29 11:22:34,849 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:22:34,849 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-04-29 11:22:34,855 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-04-29 11:22:35,009 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:22:35,009 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 17 treesize of output 15 [2025-04-29 11:22:35,016 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:22:35,016 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 27 treesize of output 21 [2025-04-29 11:22:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-29 11:22:35,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:35,704 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1872 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1872))) (or (not (= v_ArrVal_1872 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1872 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (< (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0) (forall ((v_ArrVal_1874 (Array Int Int)) (v_ArrVal_1873 Int)) (<= 0 (+ (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1873)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1874) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))))) (forall ((v_ArrVal_1872 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1872))) (or (not (= v_ArrVal_1872 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1872 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (< (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0) (forall ((v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1874 (Array Int Int)) (v_ArrVal_1873 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1873)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (<= (+ 8 (select (select (store .cse4 .cse5 v_ArrVal_1874) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1875) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))))))) is different from false [2025-04-29 11:22:35,748 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select .cse3 .cse2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (forall ((v_ArrVal_1872 (Array Int Int))) (or (forall ((v_ArrVal_1874 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1872) .cse0 v_ArrVal_1874) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (not (= (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1872 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1872)) (< (select v_ArrVal_1872 .cse2) 0))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (forall ((v_ArrVal_1872 (Array Int Int))) (or (not (= (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1872 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1872)) (forall ((v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1874 (Array Int Int)) (v_ArrVal_1873 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1872) .cse0 v_ArrVal_1874) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| v_ArrVal_1873)) .cse0 v_ArrVal_1875) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (< (select v_ArrVal_1872 .cse2) 0))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)))))) is different from false [2025-04-29 11:22:35,772 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select .cse1 .cse3)) (.cse2 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (forall ((v_ArrVal_1872 (Array Int Int))) (or (forall ((v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1874 (Array Int Int)) (v_ArrVal_1873 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1872) .cse0 v_ArrVal_1874) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| v_ArrVal_1873)) .cse0 v_ArrVal_1875) |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))) (not (= (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1872 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1872)) (< (select v_ArrVal_1872 .cse3) 0))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (forall ((v_ArrVal_1872 (Array Int Int))) (or (forall ((v_ArrVal_1874 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1872) .cse0 v_ArrVal_1874) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 4))) (not (= (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1872 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1872)) (< (select v_ArrVal_1872 .cse3) 0)))))))) is different from false [2025-04-29 11:22:35,799 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse2 (select .cse3 .cse1)) (.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (forall ((v_ArrVal_1872 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1872 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1872)) (< (select v_ArrVal_1872 .cse1) 0) (forall ((v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1874 (Array Int Int)) (v_ArrVal_1873 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1872) .cse2 v_ArrVal_1874) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| v_ArrVal_1873)) .cse2 v_ArrVal_1875) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (forall ((v_ArrVal_1872 (Array Int Int))) (or (forall ((v_ArrVal_1874 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1872) .cse2 v_ArrVal_1874) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 4))) (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1872 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1872)) (< (select v_ArrVal_1872 .cse1) 0)))))))) is different from false [2025-04-29 11:22:35,828 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse0 (select .cse1 .cse3))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (forall ((v_ArrVal_1872 (Array Int Int))) (or (forall ((v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1874 (Array Int Int)) (v_ArrVal_1873 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1872) .cse0 v_ArrVal_1874) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| v_ArrVal_1873)) .cse0 v_ArrVal_1875) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))) (not (= (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1872 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1872)) (< (select v_ArrVal_1872 .cse3) 0))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (forall ((v_ArrVal_1872 (Array Int Int))) (or (not (= (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1872 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1872)) (forall ((v_ArrVal_1874 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1872) .cse0 v_ArrVal_1874) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 4))) (< (select v_ArrVal_1872 .cse3) 0))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)))))) is different from false [2025-04-29 11:22:35,857 INFO L325 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2025-04-29 11:22:35,857 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 120 [2025-04-29 11:22:35,863 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 119 treesize of output 115 [2025-04-29 11:22:35,873 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:22:35,874 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 169 treesize of output 163 [2025-04-29 11:22:35,878 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 103 treesize of output 101 [2025-04-29 11:22:35,882 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 101 treesize of output 99 [2025-04-29 11:22:35,918 INFO L325 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2025-04-29 11:22:35,918 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 149 [2025-04-29 11:22:35,924 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 79 treesize of output 77 [2025-04-29 11:22:35,982 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 8 treesize of output 6 [2025-04-29 11:22:36,008 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 8 treesize of output 6 [2025-04-29 11:22:36,077 INFO L325 Elim1Store]: treesize reduction 102, result has 19.0 percent of original size [2025-04-29 11:22:36,077 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 115 treesize of output 101 [2025-04-29 11:22:36,086 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:22:36,086 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 85 [2025-04-29 11:22:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 7 not checked. [2025-04-29 11:22:36,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528089455] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:36,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:36,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 24] total 65 [2025-04-29 11:22:36,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893518301] [2025-04-29 11:22:36,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:36,758 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-29 11:22:36,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:36,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-29 11:22:36,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=3466, Unknown=5, NotChecked=610, Total=4290 [2025-04-29 11:22:36,759 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 66 states, 65 states have (on average 2.2) internal successors, (143), 66 states have internal predecessors, (143), 0 states have call successors, (0), 0 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:22:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:38,430 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2025-04-29 11:22:38,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-29 11:22:38,430 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 2.2) internal successors, (143), 66 states have internal predecessors, (143), 0 states have call successors, (0), 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 56 [2025-04-29 11:22:38,430 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:38,430 INFO L225 Difference]: With dead ends: 77 [2025-04-29 11:22:38,430 INFO L226 Difference]: Without dead ends: 77 [2025-04-29 11:22:38,432 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=421, Invalid=6074, Unknown=5, NotChecked=810, Total=7310 [2025-04-29 11:22:38,432 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 59 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 313 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:38,432 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 594 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1678 Invalid, 0 Unknown, 313 Unchecked, 0.7s Time] [2025-04-29 11:22:38,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-29 11:22:38,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2025-04-29 11:22:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.106060606060606) internal successors, (73), 70 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2025-04-29 11:22:38,438 INFO L79 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 56 [2025-04-29 11:22:38,438 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:38,438 INFO L485 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2025-04-29 11:22:38,438 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 2.2) internal successors, (143), 66 states have internal predecessors, (143), 0 states have call successors, (0), 0 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:22:38,438 INFO L278 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2025-04-29 11:22:38,438 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-29 11:22:38,438 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:38,438 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:38,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-29 11:22:38,639 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:38,639 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:38,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:38,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1675605048, now seen corresponding path program 1 times [2025-04-29 11:22:38,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:38,639 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830929104] [2025-04-29 11:22:38,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:38,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:38,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-29 11:22:38,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:22:38,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:38,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:22:39,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:39,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830929104] [2025-04-29 11:22:39,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830929104] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:39,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257597299] [2025-04-29 11:22:39,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:39,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:39,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:39,252 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:39,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-29 11:22:39,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-29 11:22:39,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:22:39,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:39,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:39,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-04-29 11:22:39,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:39,407 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 6 treesize of output 5 [2025-04-29 11:22:39,487 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:22:39,488 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 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:22:39,581 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:22:39,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:39,723 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-04-29 11:22:39,835 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:22:39,835 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-04-29 11:22:39,950 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:22:39,951 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 26 treesize of output 20 [2025-04-29 11:22:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-29 11:22:40,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:40,122 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1987 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1987) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2025-04-29 11:22:40,125 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1987 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_#t~mem7#1.base| v_ArrVal_1987) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2025-04-29 11:22:40,174 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1987 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1987) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2025-04-29 11:22:40,181 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1986 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1986)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1987)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2025-04-29 11:22:40,191 WARN L849 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_73| Int) (v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1986 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_73|) (not (= (select (select (let ((.cse0 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_73| v_ArrVal_1986)) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1987)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0)))) is different from false [2025-04-29 11:22:40,278 WARN L849 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_73| Int) (v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1986 Int)) (or (not (= (select (select (let ((.cse0 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_73| v_ArrVal_1986)) (select .cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_1987)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_73|))) is different from false [2025-04-29 11:22:40,364 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:22:40,367 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:22:40,367 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2025-04-29 11:22:40,372 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:22:40,372 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 35 treesize of output 33 [2025-04-29 11:22:40,377 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 20 treesize of output 18 [2025-04-29 11:22:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 9 not checked. [2025-04-29 11:22:40,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257597299] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:40,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:40,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 24] total 57 [2025-04-29 11:22:40,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022007004] [2025-04-29 11:22:40,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:40,569 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-29 11:22:40,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:40,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-29 11:22:40,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2378, Unknown=41, NotChecked=618, Total=3192 [2025-04-29 11:22:40,570 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 57 states, 57 states have (on average 2.3157894736842106) internal successors, (132), 57 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:41,683 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2025-04-29 11:22:41,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 11:22:41,684 INFO L79 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.3157894736842106) internal successors, (132), 57 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-04-29 11:22:41,684 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:41,684 INFO L225 Difference]: With dead ends: 79 [2025-04-29 11:22:41,684 INFO L226 Difference]: Without dead ends: 79 [2025-04-29 11:22:41,686 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=354, Invalid=4740, Unknown=42, NotChecked=870, Total=6006 [2025-04-29 11:22:41,686 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 64 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 345 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:41,687 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 796 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1507 Invalid, 0 Unknown, 345 Unchecked, 0.5s Time] [2025-04-29 11:22:41,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-29 11:22:41,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2025-04-29 11:22:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2025-04-29 11:22:41,689 INFO L79 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 57 [2025-04-29 11:22:41,689 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:41,689 INFO L485 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2025-04-29 11:22:41,689 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.3157894736842106) internal successors, (132), 57 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:41,689 INFO L278 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2025-04-29 11:22:41,689 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-29 11:22:41,689 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:41,689 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:41,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-29 11:22:41,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:41,892 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:41,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:41,893 INFO L85 PathProgramCache]: Analyzing trace with hash 344802778, now seen corresponding path program 1 times [2025-04-29 11:22:41,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:41,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137982445] [2025-04-29 11:22:41,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:41,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:41,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:22:41,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:22:41,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:41,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:22:42,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:42,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137982445] [2025-04-29 11:22:42,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137982445] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:42,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889676884] [2025-04-29 11:22:42,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:42,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:42,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:42,571 INFO L229 MonitoredProcess]: Starting monitored process 17 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:22:42,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-29 11:22:42,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:22:42,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:22:42,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:42,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:42,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-04-29 11:22:42,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:42,799 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:22:42,799 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:22:42,827 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:22:42,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:42,882 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-04-29 11:22:42,981 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:22:42,981 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-04-29 11:22:43,070 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:22:43,071 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 27 treesize of output 21 [2025-04-29 11:22:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-29 11:22:43,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:43,237 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2098 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2098) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2025-04-29 11:22:43,329 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2098 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2098) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2025-04-29 11:22:43,335 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2096 Int) (v_ArrVal_2098 (Array Int Int))) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2096)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2098)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2025-04-29 11:22:43,345 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2096 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_80| Int) (v_ArrVal_2098 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|) (< (select (select (let ((.cse0 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| v_ArrVal_2096)) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2098)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2025-04-29 11:22:43,420 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2096 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_80| Int) (v_ArrVal_2098 (Array Int Int))) (or (< (select (select (let ((.cse0 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| v_ArrVal_2096)) (select .cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2098)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|))) is different from false [2025-04-29 11:22:43,498 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:22:43,502 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:22:43,502 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2025-04-29 11:22:43,506 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:22:43,506 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 32 treesize of output 30 [2025-04-29 11:22:43,512 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 7 treesize of output 5 [2025-04-29 11:22:43,606 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:22:43,606 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:22:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 9 not checked. [2025-04-29 11:22:43,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889676884] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:43,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:43,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 48 [2025-04-29 11:22:43,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991855268] [2025-04-29 11:22:43,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:43,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-29 11:22:43,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:43,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-29 11:22:43,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1705, Unknown=63, NotChecked=440, Total=2352 [2025-04-29 11:22:43,644 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 49 states, 48 states have (on average 2.4375) internal successors, (117), 49 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:44,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:44,608 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2025-04-29 11:22:44,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-29 11:22:44,609 INFO L79 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.4375) internal successors, (117), 49 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-04-29 11:22:44,609 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:44,609 INFO L225 Difference]: With dead ends: 78 [2025-04-29 11:22:44,609 INFO L226 Difference]: Without dead ends: 78 [2025-04-29 11:22:44,610 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 90 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=283, Invalid=3333, Unknown=64, NotChecked=610, Total=4290 [2025-04-29 11:22:44,610 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:44,610 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 595 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1318 Invalid, 0 Unknown, 312 Unchecked, 0.5s Time] [2025-04-29 11:22:44,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-29 11:22:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2025-04-29 11:22:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2025-04-29 11:22:44,612 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 59 [2025-04-29 11:22:44,612 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:44,612 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2025-04-29 11:22:44,612 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.4375) internal successors, (117), 49 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:44,612 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2025-04-29 11:22:44,612 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-04-29 11:22:44,612 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:44,612 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:44,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:44,812 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:44,813 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:44,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:44,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1542091805, now seen corresponding path program 2 times [2025-04-29 11:22:44,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:44,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783830086] [2025-04-29 11:22:44,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:22:44,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:44,824 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-04-29 11:22:44,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-04-29 11:22:44,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:22:44,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:22:46,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:46,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783830086] [2025-04-29 11:22:46,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783830086] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:46,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906154071] [2025-04-29 11:22:46,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:22:46,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:46,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:46,142 INFO L229 MonitoredProcess]: Starting monitored process 18 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:22:46,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-29 11:22:46,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-04-29 11:22:46,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-04-29 11:22:46,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:22:46,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:46,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 120 conjuncts are in the unsatisfiable core [2025-04-29 11:22:46,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:46,324 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 6 treesize of output 5 [2025-04-29 11:22:46,349 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 11 treesize of output 7 [2025-04-29 11:22:46,353 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 11 treesize of output 7 [2025-04-29 11:22:46,394 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:22:46,395 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:22:46,433 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:22:46,438 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:22:46,445 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:22:46,448 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:22:46,526 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 11:22:46,531 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 11:22:46,763 INFO L325 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2025-04-29 11:22:46,764 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2025-04-29 11:22:46,776 INFO L325 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-04-29 11:22:46,776 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2025-04-29 11:22:47,156 INFO L325 Elim1Store]: treesize reduction 116, result has 43.4 percent of original size [2025-04-29 11:22:47,157 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 128 treesize of output 162 [2025-04-29 11:22:47,235 INFO L325 Elim1Store]: treesize reduction 108, result has 47.3 percent of original size [2025-04-29 11:22:47,235 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 129 Killed by 15