./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:43:18,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:43:18,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:43:18,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:43:18,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:43:18,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:43:18,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:43:18,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:43:18,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:43:18,152 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:43:18,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:43:18,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:43:18,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:43:18,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:43:18,153 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:43:18,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:43:18,153 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:43:18,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:43:18,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:43:18,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:43:18,154 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:43:18,154 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:43:18,156 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:43:18,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:43:18,156 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:43:18,156 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:43:18,157 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:43:18,157 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:43:18,157 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:43:18,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:43:18,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:43:18,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:43:18,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:43:18,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:43:18,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:43:18,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:43:18,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:43:18,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:43:18,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:43:18,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:43:18,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:43:18,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:43:18,160 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2024-11-12 13:43:18,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:43:18,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:43:18,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:43:18,348 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:43:18,348 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:43:18,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2024-11-12 13:43:19,711 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:43:19,918 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:43:19,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2024-11-12 13:43:19,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d1a9ac0/ac4ece0e76714287abe414c5cd96449d/FLAG4e449813f [2024-11-12 13:43:20,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d1a9ac0/ac4ece0e76714287abe414c5cd96449d [2024-11-12 13:43:20,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:43:20,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:43:20,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:43:20,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:43:20,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:43:20,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:43:20" (1/1) ... [2024-11-12 13:43:20,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57948f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:20, skipping insertion in model container [2024-11-12 13:43:20,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:43:20" (1/1) ... [2024-11-12 13:43:20,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:43:20,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:43:20,628 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:43:20,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:43:20,773 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:43:20,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:20 WrapperNode [2024-11-12 13:43:20,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:43:20,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:43:20,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:43:20,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:43:20,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:20" (1/1) ... [2024-11-12 13:43:20,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:20" (1/1) ... [2024-11-12 13:43:20,814 INFO L138 Inliner]: procedures = 126, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 127 [2024-11-12 13:43:20,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:43:20,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:43:20,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:43:20,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:43:20,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:20" (1/1) ... [2024-11-12 13:43:20,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:20" (1/1) ... [2024-11-12 13:43:20,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:20" (1/1) ... [2024-11-12 13:43:20,842 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-12 13:43:20,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:20" (1/1) ... [2024-11-12 13:43:20,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:20" (1/1) ... [2024-11-12 13:43:20,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:20" (1/1) ... [2024-11-12 13:43:20,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:20" (1/1) ... [2024-11-12 13:43:20,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:20" (1/1) ... [2024-11-12 13:43:20,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:20" (1/1) ... [2024-11-12 13:43:20,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:43:20,857 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:43:20,857 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:43:20,857 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:43:20,859 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:20" (1/1) ... [2024-11-12 13:43:20,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:43:20,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:20,897 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) [2024-11-12 13:43:20,903 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 [2024-11-12 13:43:20,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 13:43:20,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 13:43:20,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 13:43:20,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 13:43:20,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:43:20,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:43:20,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:43:20,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 13:43:20,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:43:20,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 13:43:20,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:43:20,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 13:43:20,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 13:43:20,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:43:20,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:43:21,074 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:43:21,076 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:43:21,271 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-11-12 13:43:21,271 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:43:21,286 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:43:21,286 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-12 13:43:21,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:43:21 BoogieIcfgContainer [2024-11-12 13:43:21,287 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:43:21,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:43:21,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:43:21,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:43:21,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:43:20" (1/3) ... [2024-11-12 13:43:21,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527b8527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:43:21, skipping insertion in model container [2024-11-12 13:43:21,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:20" (2/3) ... [2024-11-12 13:43:21,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527b8527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:43:21, skipping insertion in model container [2024-11-12 13:43:21,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:43:21" (3/3) ... [2024-11-12 13:43:21,300 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2024-11-12 13:43:21,316 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:43:21,316 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-11-12 13:43:21,358 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:43:21,364 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7026dfed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:43:21,365 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-12 13:43:21,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 45 states have (on average 1.8) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:21,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:43:21,373 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:21,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:43:21,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:21,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:21,380 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2024-11-12 13:43:21,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:21,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292986107] [2024-11-12 13:43:21,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:21,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:43:21,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:21,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292986107] [2024-11-12 13:43:21,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292986107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:43:21,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:43:21,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:43:21,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047540174] [2024-11-12 13:43:21,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:43:21,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:43:21,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:21,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:43:21,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:43:21,604 INFO L87 Difference]: Start difference. First operand has 67 states, 45 states have (on average 1.8) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 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) [2024-11-12 13:43:21,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:21,656 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-11-12 13:43:21,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:43:21,658 INFO L78 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 [2024-11-12 13:43:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:21,663 INFO L225 Difference]: With dead ends: 64 [2024-11-12 13:43:21,663 INFO L226 Difference]: Without dead ends: 61 [2024-11-12 13:43:21,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:43:21,667 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:21,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 106 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:43:21,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-12 13:43:21,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-12 13:43:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 60 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) [2024-11-12 13:43:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-11-12 13:43:21,694 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 5 [2024-11-12 13:43:21,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:21,696 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-11-12 13:43:21,696 INFO L472 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) [2024-11-12 13:43:21,696 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-11-12 13:43:21,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:43:21,696 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:21,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:43:21,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:43:21,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:21,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:21,698 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2024-11-12 13:43:21,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:21,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235955465] [2024-11-12 13:43:21,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:21,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:43:21,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:21,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235955465] [2024-11-12 13:43:21,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235955465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:43:21,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:43:21,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:43:21,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291295127] [2024-11-12 13:43:21,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:43:21,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:43:21,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:21,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:43:21,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:43:21,771 INFO L87 Difference]: Start difference. First operand 61 states and 66 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) [2024-11-12 13:43:21,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:21,803 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-12 13:43:21,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:43:21,804 INFO L78 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 [2024-11-12 13:43:21,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:21,805 INFO L225 Difference]: With dead ends: 59 [2024-11-12 13:43:21,805 INFO L226 Difference]: Without dead ends: 59 [2024-11-12 13:43:21,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:43:21,806 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 105 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 [2024-11-12 13:43:21,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:43:21,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-12 13:43:21,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-12 13:43:21,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 58 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) [2024-11-12 13:43:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-11-12 13:43:21,812 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2024-11-12 13:43:21,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:21,813 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-11-12 13:43:21,813 INFO L472 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) [2024-11-12 13:43:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-11-12 13:43:21,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 13:43:21,814 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:21,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:21,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:43:21,814 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:21,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:21,815 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2024-11-12 13:43:21,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:21,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088868166] [2024-11-12 13:43:21,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:21,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:21,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:43:21,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:21,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088868166] [2024-11-12 13:43:21,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088868166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:43:21,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:43:21,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:43:21,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320563713] [2024-11-12 13:43:21,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:43:21,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:43:21,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:21,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:43:21,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:43:21,854 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:21,864 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2024-11-12 13:43:21,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:43:21,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-12 13:43:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:21,865 INFO L225 Difference]: With dead ends: 70 [2024-11-12 13:43:21,865 INFO L226 Difference]: Without dead ends: 70 [2024-11-12 13:43:21,865 INFO L434 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 [2024-11-12 13:43:21,866 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 121 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 [2024-11-12 13:43:21,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:43:21,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-12 13:43:21,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2024-11-12 13:43:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 59 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) [2024-11-12 13:43:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2024-11-12 13:43:21,871 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 8 [2024-11-12 13:43:21,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:21,871 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2024-11-12 13:43:21,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2024-11-12 13:43:21,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 13:43:21,872 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:21,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:21,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:43:21,872 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:21,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:21,873 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2024-11-12 13:43:21,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:21,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480909860] [2024-11-12 13:43:21,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:21,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:43:21,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:21,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480909860] [2024-11-12 13:43:21,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480909860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:43:21,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:43:21,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:43:21,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667049641] [2024-11-12 13:43:21,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:43:21,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:43:21,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:21,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:43:21,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:43:21,988 INFO L87 Difference]: Start difference. First operand 60 states and 65 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) [2024-11-12 13:43:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:22,060 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-12 13:43:22,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:43:22,060 INFO L78 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 [2024-11-12 13:43:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:22,061 INFO L225 Difference]: With dead ends: 59 [2024-11-12 13:43:22,061 INFO L226 Difference]: Without dead ends: 59 [2024-11-12 13:43:22,061 INFO L434 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 [2024-11-12 13:43:22,062 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 171 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 [2024-11-12 13:43:22,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 171 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:43:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-12 13:43:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-12 13:43:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 58 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) [2024-11-12 13:43:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-11-12 13:43:22,066 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 9 [2024-11-12 13:43:22,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:22,067 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-11-12 13:43:22,067 INFO L472 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) [2024-11-12 13:43:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-11-12 13:43:22,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 13:43:22,067 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:22,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:22,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:43:22,068 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:22,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:22,068 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2024-11-12 13:43:22,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:22,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419207527] [2024-11-12 13:43:22,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:22,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:22,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:43:22,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:22,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419207527] [2024-11-12 13:43:22,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419207527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:43:22,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:43:22,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:43:22,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091248240] [2024-11-12 13:43:22,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:43:22,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:43:22,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:22,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:43:22,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:43:22,271 INFO L87 Difference]: Start difference. First operand 59 states and 64 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) [2024-11-12 13:43:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:22,330 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-11-12 13:43:22,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:43:22,332 INFO L78 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 [2024-11-12 13:43:22,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:22,333 INFO L225 Difference]: With dead ends: 58 [2024-11-12 13:43:22,333 INFO L226 Difference]: Without dead ends: 58 [2024-11-12 13:43:22,333 INFO L434 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 [2024-11-12 13:43:22,334 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:22,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 182 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:43:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-12 13:43:22,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-12 13:43:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:22,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-11-12 13:43:22,342 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 9 [2024-11-12 13:43:22,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:22,342 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-11-12 13:43:22,342 INFO L472 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) [2024-11-12 13:43:22,342 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-11-12 13:43:22,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:43:22,343 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:22,343 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:22,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:43:22,343 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:22,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:22,344 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2024-11-12 13:43:22,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:22,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330097537] [2024-11-12 13:43:22,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:22,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:22,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:43:22,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:22,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330097537] [2024-11-12 13:43:22,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330097537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:22,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207564605] [2024-11-12 13:43:22,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:22,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:22,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:22,428 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) [2024-11-12 13:43:22,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 13:43:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:22,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 13:43:22,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:43:22,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:43:22,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:43:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:43:22,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207564605] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:43:22,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:43:22,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-12 13:43:22,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839725297] [2024-11-12 13:43:22,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:43:22,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:43:22,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:22,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:43:22,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:43:22,622 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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) [2024-11-12 13:43:22,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:22,639 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2024-11-12 13:43:22,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:43:22,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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 17 [2024-11-12 13:43:22,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:22,640 INFO L225 Difference]: With dead ends: 67 [2024-11-12 13:43:22,641 INFO L226 Difference]: Without dead ends: 67 [2024-11-12 13:43:22,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:43:22,642 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:22,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:43:22,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-12 13:43:22,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-12 13:43:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 66 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) [2024-11-12 13:43:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2024-11-12 13:43:22,649 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 17 [2024-11-12 13:43:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:22,649 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2024-11-12 13:43:22,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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) [2024-11-12 13:43:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2024-11-12 13:43:22,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:43:22,649 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:22,650 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:22,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 13:43:22,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-12 13:43:22,851 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:22,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:22,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2024-11-12 13:43:22,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:22,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947647115] [2024-11-12 13:43:22,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:22,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-12 13:43:22,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:22,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947647115] [2024-11-12 13:43:22,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947647115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:43:22,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:43:22,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:43:22,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319170182] [2024-11-12 13:43:22,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:43:22,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:43:22,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:22,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:43:22,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:43:22,956 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:22,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:22,994 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2024-11-12 13:43:22,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:43:22,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-12 13:43:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:22,995 INFO L225 Difference]: With dead ends: 96 [2024-11-12 13:43:22,995 INFO L226 Difference]: Without dead ends: 96 [2024-11-12 13:43:22,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:43:22,996 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 116 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:22,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 156 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:43:22,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-12 13:43:22,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 70. [2024-11-12 13:43:22,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 69 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) [2024-11-12 13:43:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2024-11-12 13:43:22,999 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 26 [2024-11-12 13:43:23,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:23,000 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2024-11-12 13:43:23,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:23,000 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2024-11-12 13:43:23,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:43:23,001 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:23,001 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:23,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:43:23,001 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:23,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:23,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913225, now seen corresponding path program 1 times [2024-11-12 13:43:23,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:23,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750779053] [2024-11-12 13:43:23,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:23,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:43:23,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:23,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750779053] [2024-11-12 13:43:23,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750779053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:43:23,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:43:23,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:43:23,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633375117] [2024-11-12 13:43:23,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:43:23,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:43:23,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:23,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:43:23,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:43:23,120 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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) [2024-11-12 13:43:23,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:23,263 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2024-11-12 13:43:23,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:43:23,264 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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 26 [2024-11-12 13:43:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:23,264 INFO L225 Difference]: With dead ends: 73 [2024-11-12 13:43:23,264 INFO L226 Difference]: Without dead ends: 73 [2024-11-12 13:43:23,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:43:23,265 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 43 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:23,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 251 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:43:23,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-12 13:43:23,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-12 13:43:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.396551724137931) internal successors, (81), 72 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2024-11-12 13:43:23,268 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 26 [2024-11-12 13:43:23,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:23,268 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2024-11-12 13:43:23,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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) [2024-11-12 13:43:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2024-11-12 13:43:23,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:43:23,269 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:23,269 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:23,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:43:23,269 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:23,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:23,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913226, now seen corresponding path program 1 times [2024-11-12 13:43:23,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:23,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539671714] [2024-11-12 13:43:23,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:23,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:43:23,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:23,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539671714] [2024-11-12 13:43:23,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539671714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:43:23,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:43:23,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:43:23,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461971130] [2024-11-12 13:43:23,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:43:23,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:43:23,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:23,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:43:23,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:43:23,449 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:23,592 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2024-11-12 13:43:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:43:23,592 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-12 13:43:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:23,593 INFO L225 Difference]: With dead ends: 73 [2024-11-12 13:43:23,593 INFO L226 Difference]: Without dead ends: 73 [2024-11-12 13:43:23,593 INFO L434 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 [2024-11-12 13:43:23,593 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 41 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:23,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 281 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:43:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-12 13:43:23,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-12 13:43:23,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 72 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:23,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2024-11-12 13:43:23,596 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 26 [2024-11-12 13:43:23,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:23,596 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2024-11-12 13:43:23,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:23,597 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2024-11-12 13:43:23,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 13:43:23,597 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:23,597 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:23,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 13:43:23,598 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:23,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:23,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2024-11-12 13:43:23,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:23,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274171714] [2024-11-12 13:43:23,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:23,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:24,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:43:24,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:24,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274171714] [2024-11-12 13:43:24,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274171714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:24,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223599724] [2024-11-12 13:43:24,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:24,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:24,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:24,279 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) [2024-11-12 13:43:24,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 13:43:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:24,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-12 13:43:24,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:43:24,463 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:43:24,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-12 13:43:24,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 13:43:24,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-12 13:43:24,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:43:24,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:43:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:43:24,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223599724] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:43:24,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:43:24,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 32 [2024-11-12 13:43:24,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546397057] [2024-11-12 13:43:24,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:43:24,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-12 13:43:24,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:24,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-12 13:43:24,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 13:43:24,937 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 33 states, 32 states have (on average 2.0625) internal successors, (66), 33 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) [2024-11-12 13:43:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:25,401 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2024-11-12 13:43:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 13:43:25,401 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.0625) internal successors, (66), 33 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) Word has length 29 [2024-11-12 13:43:25,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:25,407 INFO L225 Difference]: With dead ends: 88 [2024-11-12 13:43:25,407 INFO L226 Difference]: Without dead ends: 88 [2024-11-12 13:43:25,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=1522, Unknown=0, NotChecked=0, Total=1722 [2024-11-12 13:43:25,408 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 40 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:25,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 695 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:43:25,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-12 13:43:25,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2024-11-12 13:43:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.380952380952381) internal successors, (87), 77 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2024-11-12 13:43:25,415 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 29 [2024-11-12 13:43:25,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:25,415 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2024-11-12 13:43:25,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.0625) internal successors, (66), 33 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) [2024-11-12 13:43:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2024-11-12 13:43:25,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 13:43:25,415 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:25,416 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:25,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 13:43:25,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-12 13:43:25,616 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:25,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:25,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687585, now seen corresponding path program 1 times [2024-11-12 13:43:25,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:25,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104034044] [2024-11-12 13:43:25,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:25,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:43:26,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:26,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104034044] [2024-11-12 13:43:26,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104034044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:26,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617047147] [2024-11-12 13:43:26,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:26,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:26,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:26,224 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) [2024-11-12 13:43:26,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 13:43:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:26,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-12 13:43:26,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:43:26,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 13:43:26,559 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:43:26,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-12 13:43:26,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:43:26,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 13:43:26,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-12 13:43:26,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-12 13:43:26,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-12 13:43:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:43:27,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:43:27,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:43:27,540 INFO L378 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 37 treesize of output 55 [2024-11-12 13:43:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:43:27,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617047147] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:43:27,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:43:27,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 44 [2024-11-12 13:43:27,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831930327] [2024-11-12 13:43:27,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:43:27,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-12 13:43:27,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:27,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-12 13:43:27,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1850, Unknown=0, NotChecked=0, Total=1980 [2024-11-12 13:43:27,684 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 45 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:28,888 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2024-11-12 13:43:28,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 13:43:28,888 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 45 states have internal predecessors, (83), 0 states have call successors, (0), 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 29 [2024-11-12 13:43:28,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:28,889 INFO L225 Difference]: With dead ends: 122 [2024-11-12 13:43:28,889 INFO L226 Difference]: Without dead ends: 122 [2024-11-12 13:43:28,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=322, Invalid=3460, Unknown=0, NotChecked=0, Total=3782 [2024-11-12 13:43:28,891 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 130 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:28,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 945 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 13:43:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-12 13:43:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 86. [2024-11-12 13:43:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.380281690140845) internal successors, (98), 85 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2024-11-12 13:43:28,894 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 29 [2024-11-12 13:43:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:28,894 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2024-11-12 13:43:28,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 45 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2024-11-12 13:43:28,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 13:43:28,894 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:28,895 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] [2024-11-12 13:43:28,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 13:43:29,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:29,099 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:29,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:29,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1082686446, now seen corresponding path program 2 times [2024-11-12 13:43:29,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:29,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466158871] [2024-11-12 13:43:29,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:29,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:29,188 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:43:29,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:29,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466158871] [2024-11-12 13:43:29,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466158871] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:29,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193709339] [2024-11-12 13:43:29,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:43:29,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:29,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:29,192 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) [2024-11-12 13:43:29,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 13:43:29,287 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:43:29,287 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:43:29,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 13:43:29,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:43:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-12 13:43:29,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:43:29,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193709339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:43:29,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:43:29,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2024-11-12 13:43:29,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789606477] [2024-11-12 13:43:29,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:43:29,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:43:29,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:29,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:43:29,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:43:29,326 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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) [2024-11-12 13:43:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:29,359 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2024-11-12 13:43:29,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:43:29,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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 32 [2024-11-12 13:43:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:29,360 INFO L225 Difference]: With dead ends: 72 [2024-11-12 13:43:29,360 INFO L226 Difference]: Without dead ends: 72 [2024-11-12 13:43:29,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:43:29,360 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:29,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 123 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:43:29,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-12 13:43:29,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-12 13:43:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 60 states have (on average 1.2833333333333334) 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) [2024-11-12 13:43:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-11-12 13:43:29,363 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 32 [2024-11-12 13:43:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:29,363 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-11-12 13:43:29,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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) [2024-11-12 13:43:29,363 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-11-12 13:43:29,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 13:43:29,364 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:29,364 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:29,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 13:43:29,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:29,568 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:29,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:29,568 INFO L85 PathProgramCache]: Analyzing trace with hash -516260032, now seen corresponding path program 1 times [2024-11-12 13:43:29,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:29,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687399244] [2024-11-12 13:43:29,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:29,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:29,681 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 13:43:29,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:29,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687399244] [2024-11-12 13:43:29,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687399244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:43:29,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:43:29,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:43:29,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520438158] [2024-11-12 13:43:29,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:43:29,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:43:29,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:29,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:43:29,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:43:29,682 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:29,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:29,809 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2024-11-12 13:43:29,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:43:29,810 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-12 13:43:29,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:29,811 INFO L225 Difference]: With dead ends: 75 [2024-11-12 13:43:29,811 INFO L226 Difference]: Without dead ends: 75 [2024-11-12 13:43:29,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:43:29,811 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 33 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:29,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 225 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:43:29,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-12 13:43:29,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-12 13:43:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 74 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:29,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2024-11-12 13:43:29,813 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 36 [2024-11-12 13:43:29,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:29,813 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2024-11-12 13:43:29,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2024-11-12 13:43:29,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 13:43:29,814 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:29,814 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:29,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 13:43:29,814 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:29,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:29,815 INFO L85 PathProgramCache]: Analyzing trace with hash -516260031, now seen corresponding path program 1 times [2024-11-12 13:43:29,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:29,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889649204] [2024-11-12 13:43:29,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:29,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-12 13:43:29,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:29,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889649204] [2024-11-12 13:43:29,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889649204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:29,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503890112] [2024-11-12 13:43:29,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:29,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:29,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:29,861 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) [2024-11-12 13:43:29,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 13:43:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:29,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 13:43:29,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:43:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:43:29,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:43:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:43:30,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503890112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:43:30,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:43:30,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-12 13:43:30,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487750275] [2024-11-12 13:43:30,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:43:30,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:43:30,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:30,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:43:30,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:43:30,020 INFO L87 Difference]: Start difference. First operand 75 states and 83 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) [2024-11-12 13:43:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:30,062 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2024-11-12 13:43:30,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:43:30,063 INFO L78 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 36 [2024-11-12 13:43:30,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:30,063 INFO L225 Difference]: With dead ends: 99 [2024-11-12 13:43:30,063 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 13:43:30,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:43:30,064 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 114 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:30,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 168 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:43:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 13:43:30,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2024-11-12 13:43:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2024-11-12 13:43:30,066 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 36 [2024-11-12 13:43:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:30,066 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2024-11-12 13:43:30,067 INFO L472 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) [2024-11-12 13:43:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2024-11-12 13:43:30,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 13:43:30,067 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:30,067 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] [2024-11-12 13:43:30,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 13:43:30,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-12 13:43:30,268 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:30,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:30,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1215669110, now seen corresponding path program 1 times [2024-11-12 13:43:30,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:30,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77038204] [2024-11-12 13:43:30,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:30,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:43:30,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:30,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77038204] [2024-11-12 13:43:30,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77038204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:30,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303465296] [2024-11-12 13:43:30,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:30,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:30,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:30,422 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) [2024-11-12 13:43:30,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 13:43:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:30,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 13:43:30,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:43:30,684 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:43:30,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:43:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:43:30,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303465296] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:43:30,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:43:30,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-12 13:43:30,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223640082] [2024-11-12 13:43:30,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:43:30,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:43:30,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:30,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:43:30,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:43:30,780 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:30,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:30,862 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2024-11-12 13:43:30,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:43:30,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-12 13:43:30,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:30,863 INFO L225 Difference]: With dead ends: 94 [2024-11-12 13:43:30,863 INFO L226 Difference]: Without dead ends: 94 [2024-11-12 13:43:30,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:43:30,864 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 83 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:30,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 239 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:43:30,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-12 13:43:30,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2024-11-12 13:43:30,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.36) internal successors, (102), 85 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:30,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2024-11-12 13:43:30,867 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 37 [2024-11-12 13:43:30,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:30,867 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2024-11-12 13:43:30,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:30,867 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2024-11-12 13:43:30,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-12 13:43:30,868 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:30,868 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] [2024-11-12 13:43:30,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 13:43:31,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-12 13:43:31,072 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:31,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:31,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522149, now seen corresponding path program 2 times [2024-11-12 13:43:31,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:31,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143445609] [2024-11-12 13:43:31,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:31,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:31,178 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-12 13:43:31,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:31,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143445609] [2024-11-12 13:43:31,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143445609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:31,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435460757] [2024-11-12 13:43:31,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:43:31,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:31,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:31,181 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) [2024-11-12 13:43:31,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 13:43:31,364 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 13:43:31,365 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:43:31,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 13:43:31,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:43:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-12 13:43:31,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:43:31,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435460757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:43:31,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:43:31,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-12 13:43:31,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923836699] [2024-11-12 13:43:31,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:43:31,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:43:31,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:31,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:43:31,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:43:31,424 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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) [2024-11-12 13:43:31,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:31,486 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2024-11-12 13:43:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:43:31,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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 41 [2024-11-12 13:43:31,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:31,490 INFO L225 Difference]: With dead ends: 93 [2024-11-12 13:43:31,490 INFO L226 Difference]: Without dead ends: 93 [2024-11-12 13:43:31,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:43:31,491 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 86 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:31,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 141 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:43:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-12 13:43:31,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2024-11-12 13:43:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.337837837837838) internal successors, (99), 84 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2024-11-12 13:43:31,494 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 41 [2024-11-12 13:43:31,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:31,494 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2024-11-12 13:43:31,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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) [2024-11-12 13:43:31,494 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2024-11-12 13:43:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-12 13:43:31,495 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:31,495 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] [2024-11-12 13:43:31,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-12 13:43:31,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:31,696 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:31,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:31,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522204, now seen corresponding path program 1 times [2024-11-12 13:43:31,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:31,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386745296] [2024-11-12 13:43:31,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:31,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-12 13:43:31,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:31,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386745296] [2024-11-12 13:43:31,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386745296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:43:31,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:43:31,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:43:31,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030807464] [2024-11-12 13:43:31,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:43:31,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:43:31,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:31,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:43:31,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:43:31,869 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 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) [2024-11-12 13:43:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:31,994 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2024-11-12 13:43:31,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:43:31,994 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 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 [2024-11-12 13:43:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:31,994 INFO L225 Difference]: With dead ends: 85 [2024-11-12 13:43:31,994 INFO L226 Difference]: Without dead ends: 85 [2024-11-12 13:43:31,995 INFO L434 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 [2024-11-12 13:43:31,995 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 27 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 267 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 [2024-11-12 13:43:31,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 267 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:43:31,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-12 13:43:31,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-12 13:43:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 84 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) [2024-11-12 13:43:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2024-11-12 13:43:31,996 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 41 [2024-11-12 13:43:31,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:31,997 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2024-11-12 13:43:31,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 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) [2024-11-12 13:43:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2024-11-12 13:43:31,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 13:43:31,999 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:31,999 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] [2024-11-12 13:43:31,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 13:43:31,999 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:32,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:32,000 INFO L85 PathProgramCache]: Analyzing trace with hash -333530929, now seen corresponding path program 1 times [2024-11-12 13:43:32,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:32,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749230071] [2024-11-12 13:43:32,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:32,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:43:32,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:32,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749230071] [2024-11-12 13:43:32,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749230071] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:32,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851639122] [2024-11-12 13:43:32,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:32,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:32,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:32,734 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) [2024-11-12 13:43:32,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 13:43:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:32,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-12 13:43:32,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:43:32,898 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:43:32,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-12 13:43:32,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 13:43:33,134 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:43:33,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-12 13:43:33,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:43:33,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2024-11-12 13:43:33,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-12 13:43:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:43:33,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:43:37,467 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-12 13:43:37,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-12 13:43:37,530 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_930 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2024-11-12 13:43:37,535 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_930 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_930) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2024-11-12 13:43:37,656 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2024-11-12 13:43:37,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851639122] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:43:37,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:43:37,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 42 [2024-11-12 13:43:37,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904279461] [2024-11-12 13:43:37,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:43:37,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-12 13:43:37,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:37,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-12 13:43:37,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1516, Unknown=13, NotChecked=158, Total=1806 [2024-11-12 13:43:37,658 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 43 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 43 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:38,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:38,626 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2024-11-12 13:43:38,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 13:43:38,627 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 43 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-12 13:43:38,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:38,627 INFO L225 Difference]: With dead ends: 99 [2024-11-12 13:43:38,627 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 13:43:38,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=245, Invalid=2720, Unknown=13, NotChecked=214, Total=3192 [2024-11-12 13:43:38,629 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 110 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:38,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1106 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1324 Invalid, 0 Unknown, 142 Unchecked, 0.6s Time] [2024-11-12 13:43:38,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 13:43:38,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2024-11-12 13:43:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 92 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) [2024-11-12 13:43:38,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2024-11-12 13:43:38,631 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 44 [2024-11-12 13:43:38,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:38,631 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2024-11-12 13:43:38,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 43 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:38,631 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2024-11-12 13:43:38,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 13:43:38,632 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:38,632 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] [2024-11-12 13:43:38,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-12 13:43:38,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-12 13:43:38,837 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:38,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:38,837 INFO L85 PathProgramCache]: Analyzing trace with hash -333530928, now seen corresponding path program 1 times [2024-11-12 13:43:38,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:38,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074030015] [2024-11-12 13:43:38,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:38,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:43:39,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:39,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074030015] [2024-11-12 13:43:39,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074030015] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:39,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469759634] [2024-11-12 13:43:39,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:39,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:39,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:39,900 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) [2024-11-12 13:43:39,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-12 13:43:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:40,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-12 13:43:40,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:43:40,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 13:43:40,210 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:43:40,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-12 13:43:40,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:43:40,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 13:43:40,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-12 13:43:40,678 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:43:40,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-12 13:43:40,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-12 13:43:40,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:43:40,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2024-11-12 13:43:40,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:43:40,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-12 13:43:40,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-12 13:43:40,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-12 13:43:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 13:43:40,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:43:41,114 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1045 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 1)) (not (= (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1045 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1045)))) (forall ((v_ArrVal_1045 (Array Int Int))) (or (forall ((v_ArrVal_1043 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1043)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (not (= (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1045 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1045)))))) is different from false [2024-11-12 13:43:41,252 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1041 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1042) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))))) is different from false [2024-11-12 13:43:41,359 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1042) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (forall ((v_ArrVal_1041 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2024-11-12 13:43:41,373 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1041 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1042) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))))) is different from false [2024-11-12 13:43:41,384 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (and (forall ((v_ArrVal_1041 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (forall ((v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1042) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))))))) is different from false [2024-11-12 13:43:41,395 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1041 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (forall ((v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1042) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))))))) is different from false [2024-11-12 13:43:41,414 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1042) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)))) (forall ((v_ArrVal_1041 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)))))) is different from false [2024-11-12 13:43:41,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:43:41,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-12 13:43:41,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:43:41,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-12 13:43:41,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2024-11-12 13:43:41,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2024-11-12 13:43:41,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-12 13:43:41,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:43:41,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:43:41,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-12 13:43:41,448 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:43:41,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-12 13:43:41,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:43:41,729 INFO L378 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 34 treesize of output 52 [2024-11-12 13:43:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2024-11-12 13:43:41,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469759634] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:43:41,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:43:41,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 21] total 60 [2024-11-12 13:43:41,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953151005] [2024-11-12 13:43:41,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:43:41,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-12 13:43:41,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:41,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-12 13:43:41,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2663, Unknown=33, NotChecked=770, Total=3660 [2024-11-12 13:43:41,890 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand has 61 states, 60 states have (on average 2.033333333333333) internal successors, (122), 61 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:43,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:43,223 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-11-12 13:43:43,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 13:43:43,224 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.033333333333333) internal successors, (122), 61 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-12 13:43:43,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:43,224 INFO L225 Difference]: With dead ends: 99 [2024-11-12 13:43:43,225 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 13:43:43,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=321, Invalid=3833, Unknown=34, NotChecked=924, Total=5112 [2024-11-12 13:43:43,226 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 104 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 498 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:43,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1291 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1345 Invalid, 0 Unknown, 498 Unchecked, 0.7s Time] [2024-11-12 13:43:43,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 13:43:43,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2024-11-12 13:43:43,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 91 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2024-11-12 13:43:43,232 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 44 [2024-11-12 13:43:43,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:43,236 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2024-11-12 13:43:43,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.033333333333333) internal successors, (122), 61 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2024-11-12 13:43:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-12 13:43:43,237 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:43,237 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] [2024-11-12 13:43:43,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-12 13:43:43,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:43,438 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:43,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:43,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1958848316, now seen corresponding path program 2 times [2024-11-12 13:43:43,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:43,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283643184] [2024-11-12 13:43:43,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:43,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-12 13:43:43,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:43,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283643184] [2024-11-12 13:43:43,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283643184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:43:43,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:43:43,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:43:43,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625582721] [2024-11-12 13:43:43,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:43:43,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:43:43,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:43,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:43:43,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:43:43,512 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:43,543 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-11-12 13:43:43,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:43:43,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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 [2024-11-12 13:43:43,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:43,544 INFO L225 Difference]: With dead ends: 78 [2024-11-12 13:43:43,544 INFO L226 Difference]: Without dead ends: 78 [2024-11-12 13:43:43,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:43:43,545 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 52 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:43,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 153 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:43:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-12 13:43:43,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-12 13:43:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-11-12 13:43:43,549 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 47 [2024-11-12 13:43:43,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:43,549 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-12 13:43:43,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:43,550 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-11-12 13:43:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 13:43:43,550 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:43,550 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, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:43,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 13:43:43,550 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:43,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:43,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1682989806, now seen corresponding path program 1 times [2024-11-12 13:43:43,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:43,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476964612] [2024-11-12 13:43:43,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:43,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:44,920 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:43:44,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:44,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476964612] [2024-11-12 13:43:44,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476964612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:44,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411464633] [2024-11-12 13:43:44,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:44,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:44,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:44,926 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) [2024-11-12 13:43:44,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-12 13:43:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:45,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-12 13:43:45,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:43:45,139 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:43:45,139 INFO L378 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 [2024-11-12 13:43:45,180 INFO L378 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 13 treesize of output 9 [2024-11-12 13:43:45,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-12 13:43:45,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 3 [2024-11-12 13:43:45,664 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:43:45,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2024-11-12 13:43:45,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2024-11-12 13:43:45,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2024-11-12 13:43:45,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:43:45,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2024-11-12 13:43:45,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-12 13:43:45,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:43:45,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-12 13:43:45,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-12 13:43:45,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 13:43:46,112 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:43:46,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:43:46,321 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1209 Int) (v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1211 (Array Int Int))) (or (not (= v_ArrVal_1212 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1212 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1211) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1209)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1212) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1)))) is different from false [2024-11-12 13:43:46,346 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_42| Int) (v_ArrVal_1211 (Array Int Int))) (or (= (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1211) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|))) is different from false [2024-11-12 13:43:46,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:43:46,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2024-11-12 13:43:46,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:43:46,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 86 [2024-11-12 13:43:46,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2024-11-12 13:43:46,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:43:46,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2024-11-12 13:43:46,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-12 13:43:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-12 13:43:47,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411464633] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:43:47,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:43:47,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25, 25] total 71 [2024-11-12 13:43:47,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586814041] [2024-11-12 13:43:47,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:43:47,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-12 13:43:47,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:47,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-12 13:43:47,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4431, Unknown=20, NotChecked=270, Total=4970 [2024-11-12 13:43:47,069 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 71 states, 71 states have (on average 1.9154929577464788) internal successors, (136), 71 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:49,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:49,534 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2024-11-12 13:43:49,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-12 13:43:49,534 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.9154929577464788) internal successors, (136), 71 states have internal predecessors, (136), 0 states have call successors, (0), 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 [2024-11-12 13:43:49,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:49,535 INFO L225 Difference]: With dead ends: 84 [2024-11-12 13:43:49,535 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 13:43:49,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2340 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=688, Invalid=9200, Unknown=20, NotChecked=394, Total=10302 [2024-11-12 13:43:49,537 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 136 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:49,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1369 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2017 Invalid, 0 Unknown, 164 Unchecked, 0.9s Time] [2024-11-12 13:43:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 13:43:49,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2024-11-12 13:43:49,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:49,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-12 13:43:49,539 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 50 [2024-11-12 13:43:49,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:49,539 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-12 13:43:49,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 1.9154929577464788) internal successors, (136), 71 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:49,539 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-12 13:43:49,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-12 13:43:49,540 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:49,540 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, 1] [2024-11-12 13:43:49,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-12 13:43:49,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-12 13:43:49,744 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:49,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:49,744 INFO L85 PathProgramCache]: Analyzing trace with hash -375253395, now seen corresponding path program 1 times [2024-11-12 13:43:49,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:49,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738836029] [2024-11-12 13:43:49,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:49,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:43:50,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:50,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738836029] [2024-11-12 13:43:50,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738836029] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:50,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186115364] [2024-11-12 13:43:50,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:50,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:50,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:50,123 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) [2024-11-12 13:43:50,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-12 13:43:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:50,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-12 13:43:50,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:43:50,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-12 13:43:50,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-12 13:43:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-12 13:43:50,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:43:50,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-11-12 13:43:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-12 13:43:50,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186115364] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:43:50,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:43:50,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 23 [2024-11-12 13:43:50,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224301136] [2024-11-12 13:43:50,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:43:50,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-12 13:43:50,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:50,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-12 13:43:50,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2024-11-12 13:43:50,625 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 23 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 23 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:51,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:51,042 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2024-11-12 13:43:51,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 13:43:51,043 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 23 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-12 13:43:51,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:51,043 INFO L225 Difference]: With dead ends: 84 [2024-11-12 13:43:51,043 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 13:43:51,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2024-11-12 13:43:51,044 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 83 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:51,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 725 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:43:51,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 13:43:51,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-11-12 13:43:51,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 81 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2024-11-12 13:43:51,045 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 57 [2024-11-12 13:43:51,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:51,046 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2024-11-12 13:43:51,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 23 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2024-11-12 13:43:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 13:43:51,046 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:51,054 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:51,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-12 13:43:51,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-12 13:43:51,255 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:51,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:51,255 INFO L85 PathProgramCache]: Analyzing trace with hash 187254194, now seen corresponding path program 1 times [2024-11-12 13:43:51,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:51,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666853953] [2024-11-12 13:43:51,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:51,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-12 13:43:51,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:51,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666853953] [2024-11-12 13:43:51,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666853953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:43:51,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:43:51,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:43:51,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640154379] [2024-11-12 13:43:51,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:43:51,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:43:51,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:51,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:43:51,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:43:51,362 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:51,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:51,493 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2024-11-12 13:43:51,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:43:51,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-12 13:43:51,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:51,494 INFO L225 Difference]: With dead ends: 83 [2024-11-12 13:43:51,494 INFO L226 Difference]: Without dead ends: 83 [2024-11-12 13:43:51,495 INFO L434 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 [2024-11-12 13:43:51,495 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 15 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:51,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 180 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:43:51,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-12 13:43:51,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-12 13:43:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 77 states have (on average 1.155844155844156) internal successors, (89), 82 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-11-12 13:43:51,497 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 59 [2024-11-12 13:43:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:51,497 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-11-12 13:43:51,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2024-11-12 13:43:51,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 13:43:51,497 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:51,497 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:51,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 13:43:51,498 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:51,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:51,498 INFO L85 PathProgramCache]: Analyzing trace with hash 187254195, now seen corresponding path program 1 times [2024-11-12 13:43:51,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:51,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648074663] [2024-11-12 13:43:51,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:51,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-12 13:43:51,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:51,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648074663] [2024-11-12 13:43:51,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648074663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:43:51,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:43:51,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:43:51,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950392205] [2024-11-12 13:43:51,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:43:51,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:43:51,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:51,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:43:51,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:43:51,688 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:51,820 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-11-12 13:43:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:43:51,821 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 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 [2024-11-12 13:43:51,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:51,821 INFO L225 Difference]: With dead ends: 85 [2024-11-12 13:43:51,821 INFO L226 Difference]: Without dead ends: 85 [2024-11-12 13:43:51,822 INFO L434 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 [2024-11-12 13:43:51,822 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:51,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 212 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:43:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-12 13:43:51,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-12 13:43:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.139240506329114) internal successors, (90), 84 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-12 13:43:51,823 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 59 [2024-11-12 13:43:51,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:51,824 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-12 13:43:51,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:51,824 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-12 13:43:51,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 13:43:51,824 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:51,824 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:51,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 13:43:51,825 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:51,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:51,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1509911318, now seen corresponding path program 1 times [2024-11-12 13:43:51,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:51,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833457145] [2024-11-12 13:43:51,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:51,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:51,912 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-12 13:43:51,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:51,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833457145] [2024-11-12 13:43:51,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833457145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:43:51,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:43:51,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:43:51,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760688190] [2024-11-12 13:43:51,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:43:51,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:43:51,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:51,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:43:51,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:43:51,914 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:52,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:52,011 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-11-12 13:43:52,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:43:52,011 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-12 13:43:52,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:52,012 INFO L225 Difference]: With dead ends: 87 [2024-11-12 13:43:52,012 INFO L226 Difference]: Without dead ends: 87 [2024-11-12 13:43:52,012 INFO L434 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 [2024-11-12 13:43:52,012 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 15 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 258 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 [2024-11-12 13:43:52,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 258 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:43:52,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-12 13:43:52,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-12 13:43:52,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.1265822784810127) internal successors, (89), 84 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2024-11-12 13:43:52,014 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 60 [2024-11-12 13:43:52,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:52,014 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2024-11-12 13:43:52,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:52,014 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2024-11-12 13:43:52,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 13:43:52,015 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:52,015 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, 1] [2024-11-12 13:43:52,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 13:43:52,015 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:52,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:52,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1834289652, now seen corresponding path program 2 times [2024-11-12 13:43:52,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:52,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548537716] [2024-11-12 13:43:52,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:52,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-12 13:43:52,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:52,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548537716] [2024-11-12 13:43:52,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548537716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:52,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904132361] [2024-11-12 13:43:52,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:43:52,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:52,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:52,184 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) [2024-11-12 13:43:52,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-12 13:43:52,347 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:43:52,348 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:43:52,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 13:43:52,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:43:52,452 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-12 13:43:52,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:43:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-12 13:43:52,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904132361] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:43:52,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:43:52,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-12 13:43:52,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69792144] [2024-11-12 13:43:52,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:43:52,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:43:52,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:52,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:43:52,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:43:52,609 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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) [2024-11-12 13:43:52,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:52,667 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2024-11-12 13:43:52,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:43:52,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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) Word has length 60 [2024-11-12 13:43:52,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:52,667 INFO L225 Difference]: With dead ends: 74 [2024-11-12 13:43:52,667 INFO L226 Difference]: Without dead ends: 74 [2024-11-12 13:43:52,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:43:52,668 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 43 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:52,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 194 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:43:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-12 13:43:52,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-12 13:43:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 73 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) [2024-11-12 13:43:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2024-11-12 13:43:52,671 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 60 [2024-11-12 13:43:52,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:52,671 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2024-11-12 13:43:52,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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) [2024-11-12 13:43:52,671 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-11-12 13:43:52,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 13:43:52,671 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:52,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:52,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-12 13:43:52,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-12 13:43:52,876 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:52,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:52,876 INFO L85 PathProgramCache]: Analyzing trace with hash -672727665, now seen corresponding path program 1 times [2024-11-12 13:43:52,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:52,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991773141] [2024-11-12 13:43:52,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:52,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-12 13:43:52,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:52,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991773141] [2024-11-12 13:43:52,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991773141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:43:52,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:43:52,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:43:52,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020134957] [2024-11-12 13:43:52,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:43:52,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:43:52,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:53,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:43:53,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:43:53,000 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:53,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:53,113 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-11-12 13:43:53,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:43:53,113 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 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 62 [2024-11-12 13:43:53,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:53,113 INFO L225 Difference]: With dead ends: 75 [2024-11-12 13:43:53,113 INFO L226 Difference]: Without dead ends: 75 [2024-11-12 13:43:53,114 INFO L434 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 [2024-11-12 13:43:53,114 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 214 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 [2024-11-12 13:43:53,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 214 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:43:53,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-12 13:43:53,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-12 13:43:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 74 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) [2024-11-12 13:43:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-11-12 13:43:53,116 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 62 [2024-11-12 13:43:53,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:53,116 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-11-12 13:43:53,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-11-12 13:43:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 13:43:53,119 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:53,119 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, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:53,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-12 13:43:53,120 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:53,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:53,120 INFO L85 PathProgramCache]: Analyzing trace with hash -912303337, now seen corresponding path program 1 times [2024-11-12 13:43:53,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:53,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810096021] [2024-11-12 13:43:53,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:53,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-12 13:43:53,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:53,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810096021] [2024-11-12 13:43:53,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810096021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:53,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927819800] [2024-11-12 13:43:53,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:53,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:53,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:53,906 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) [2024-11-12 13:43:53,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-12 13:43:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:54,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-12 13:43:54,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:43:54,114 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:43:54,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-12 13:43:54,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:43:54,400 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 13:43:54,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-12 13:43:54,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:43:54,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-12 13:43:54,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:43:54,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-12 13:43:54,867 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-12 13:43:54,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 13 [2024-11-12 13:43:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-12 13:43:54,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:43:55,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:43:55,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2024-11-12 13:43:56,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:43:56,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-11-12 13:43:56,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-11-12 13:43:56,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-12 13:43:56,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:43:56,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-12 13:43:56,465 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-12 13:43:56,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-12 13:43:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-12 13:43:56,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927819800] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:43:56,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:43:56,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 21] total 51 [2024-11-12 13:43:56,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892151360] [2024-11-12 13:43:56,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:43:56,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-12 13:43:56,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:56,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-12 13:43:56,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2471, Unknown=0, NotChecked=0, Total=2652 [2024-11-12 13:43:56,542 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 52 states, 51 states have (on average 2.5686274509803924) internal successors, (131), 52 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:57,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:57,830 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-11-12 13:43:57,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 13:43:57,830 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.5686274509803924) internal successors, (131), 52 states have internal predecessors, (131), 0 states have call successors, (0), 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 65 [2024-11-12 13:43:57,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:57,831 INFO L225 Difference]: With dead ends: 84 [2024-11-12 13:43:57,831 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 13:43:57,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1123 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=323, Invalid=4099, Unknown=0, NotChecked=0, Total=4422 [2024-11-12 13:43:57,833 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:57,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 692 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 13:43:57,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 13:43:57,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2024-11-12 13:43:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-11-12 13:43:57,835 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 65 [2024-11-12 13:43:57,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:57,835 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-12 13:43:57,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.5686274509803924) internal successors, (131), 52 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:43:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-11-12 13:43:57,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 13:43:57,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:57,836 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, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:57,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-12 13:43:58,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-12 13:43:58,037 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:43:58,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:58,038 INFO L85 PathProgramCache]: Analyzing trace with hash -912303336, now seen corresponding path program 1 times [2024-11-12 13:43:58,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:58,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891225355] [2024-11-12 13:43:58,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:58,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:59,403 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 13:43:59,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:59,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891225355] [2024-11-12 13:43:59,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891225355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:59,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483450685] [2024-11-12 13:43:59,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:59,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:59,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:59,405 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) [2024-11-12 13:43:59,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-12 13:43:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:59,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-12 13:43:59,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:43:59,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 13:43:59,783 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:43:59,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-12 13:43:59,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:43:59,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:43:59,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:44:00,072 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 13:44:00,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-12 13:44:00,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-12 13:44:00,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:44:00,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 13:44:00,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:44:00,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-12 13:44:00,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:00,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-12 13:44:00,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:00,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-12 13:44:00,693 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:44:00,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:44:01,010 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1854 (Array Int Int))) (or (forall ((v_ArrVal_1855 Int)) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1854) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1855)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (not (= v_ArrVal_1854 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1854 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_1854 (Array Int Int))) (or (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1854) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (not (= v_ArrVal_1854 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1854 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))))) is different from false [2024-11-12 13:44:01,275 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1851 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1851) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4))))) (forall ((v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1855 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1851) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4) 7) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1852) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1855) 4)))))) is different from false [2024-11-12 13:44:01,446 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1855 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1851) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1852) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1855) 4))))) (forall ((v_ArrVal_1851 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1851) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4))))))) is different from false [2024-11-12 13:44:01,479 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((v_ArrVal_1851 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1851) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4))))) (forall ((v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1855 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1851) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1852) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1855) 4))))))) is different from false [2024-11-12 13:44:01,640 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (and (forall ((v_ArrVal_1851 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1851) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|))) (forall ((v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1855 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1851) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1852) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1855) 4))))))) is different from false [2024-11-12 13:44:01,682 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (and (forall ((v_ArrVal_1851 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1851) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4) 5)))) (forall ((v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1855 Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1851) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1852) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1855) 4))))))) is different from false [2024-11-12 13:44:01,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:01,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 48 [2024-11-12 13:44:01,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:01,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-11-12 13:44:01,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-11-12 13:44:01,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 106 [2024-11-12 13:44:01,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2024-11-12 13:44:01,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2024-11-12 13:44:01,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:01,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 52 [2024-11-12 13:44:01,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:01,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 59 [2024-11-12 13:44:01,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:01,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-11-12 13:44:01,815 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:44:01,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-12 13:44:01,820 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:44:01,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-12 13:44:02,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:02,120 INFO L378 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 34 treesize of output 52 [2024-11-12 13:44:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 9 not checked. [2024-11-12 13:44:02,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483450685] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:44:02,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:44:02,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 60 [2024-11-12 13:44:02,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963149287] [2024-11-12 13:44:02,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:44:02,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-12 13:44:02,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:44:02,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-12 13:44:02,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2734, Unknown=46, NotChecked=666, Total=3660 [2024-11-12 13:44:02,261 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 61 states, 60 states have (on average 2.533333333333333) internal successors, (152), 61 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:44:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:44:03,734 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2024-11-12 13:44:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 13:44:03,735 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.533333333333333) internal successors, (152), 61 states have internal predecessors, (152), 0 states have call successors, (0), 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 65 [2024-11-12 13:44:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:44:03,735 INFO L225 Difference]: With dead ends: 86 [2024-11-12 13:44:03,735 INFO L226 Difference]: Without dead ends: 86 [2024-11-12 13:44:03,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 94 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=349, Invalid=4185, Unknown=46, NotChecked=822, Total=5402 [2024-11-12 13:44:03,737 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 36 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 420 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 13:44:03,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 795 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1471 Invalid, 0 Unknown, 420 Unchecked, 0.8s Time] [2024-11-12 13:44:03,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-12 13:44:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2024-11-12 13:44:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.12) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:44:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-12 13:44:03,740 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 65 [2024-11-12 13:44:03,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:44:03,740 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-12 13:44:03,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.533333333333333) internal successors, (152), 61 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:44:03,740 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-12 13:44:03,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 13:44:03,741 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:44:03,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:44:03,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-12 13:44:03,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:44:03,942 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:44:03,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:44:03,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1783366225, now seen corresponding path program 1 times [2024-11-12 13:44:03,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:44:03,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501908271] [2024-11-12 13:44:03,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:44:03,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:44:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:44:04,699 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 13:44:04,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:44:04,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501908271] [2024-11-12 13:44:04,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501908271] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:44:04,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120705659] [2024-11-12 13:44:04,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:44:04,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:44:04,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:44:04,701 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) [2024-11-12 13:44:04,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-12 13:44:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:44:04,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-12 13:44:04,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:44:04,959 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:44:04,959 INFO L378 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 [2024-11-12 13:44:04,985 INFO L378 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 [2024-11-12 13:44:05,131 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 13:44:05,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-12 13:44:05,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:44:05,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-12 13:44:05,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:05,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 20 [2024-11-12 13:44:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:44:05,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:44:05,737 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1963 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_74| Int) (v_ArrVal_1965 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1963) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_74| v_ArrVal_1965) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_74|))) is different from false [2024-11-12 13:44:05,754 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1963 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_74| Int) (v_ArrVal_1965 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1963) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_74| v_ArrVal_1965) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_74|))) is different from false [2024-11-12 13:44:05,951 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1963 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_74| Int) (v_ArrVal_1965 Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_74|) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_1963) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_74| v_ArrVal_1965) 4) 0)))) is different from false [2024-11-12 13:44:05,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:05,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-12 13:44:05,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2024-11-12 13:44:05,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-12 13:44:05,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:05,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 59 [2024-11-12 13:44:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 5 not checked. [2024-11-12 13:44:06,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120705659] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:44:06,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:44:06,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 25] total 48 [2024-11-12 13:44:06,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82268406] [2024-11-12 13:44:06,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:44:06,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-12 13:44:06,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:44:06,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-12 13:44:06,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1787, Unknown=42, NotChecked=264, Total=2256 [2024-11-12 13:44:06,114 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 48 states, 48 states have (on average 2.7916666666666665) internal successors, (134), 48 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:44:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:44:06,946 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2024-11-12 13:44:06,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 13:44:06,947 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.7916666666666665) internal successors, (134), 48 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-12 13:44:06,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:44:06,950 INFO L225 Difference]: With dead ends: 88 [2024-11-12 13:44:06,950 INFO L226 Difference]: Without dead ends: 88 [2024-11-12 13:44:06,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=274, Invalid=3000, Unknown=44, NotChecked=342, Total=3660 [2024-11-12 13:44:06,954 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 55 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:44:06,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 632 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 854 Invalid, 0 Unknown, 193 Unchecked, 0.4s Time] [2024-11-12 13:44:06,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-12 13:44:06,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2024-11-12 13:44:06,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:44:06,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2024-11-12 13:44:06,960 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 66 [2024-11-12 13:44:06,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:44:06,960 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2024-11-12 13:44:06,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.7916666666666665) internal successors, (134), 48 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:44:06,960 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2024-11-12 13:44:06,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-12 13:44:06,961 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:44:06,961 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:44:06,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-12 13:44:07,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:44:07,161 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:44:07,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:44:07,162 INFO L85 PathProgramCache]: Analyzing trace with hash 124432906, now seen corresponding path program 1 times [2024-11-12 13:44:07,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:44:07,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798764021] [2024-11-12 13:44:07,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:44:07,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:44:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:44:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:44:08,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:44:08,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798764021] [2024-11-12 13:44:08,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798764021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:44:08,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947371330] [2024-11-12 13:44:08,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:44:08,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:44:08,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:44:08,338 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) [2024-11-12 13:44:08,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-12 13:44:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:44:08,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-12 13:44:08,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:44:08,622 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:44:08,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-12 13:44:08,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:44:08,808 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 13:44:08,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-12 13:44:08,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:44:08,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-12 13:44:08,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:08,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-12 13:44:09,094 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:44:09,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:44:09,686 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_81| Int) (v_ArrVal_2075 Int) (v_ArrVal_2073 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2073) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_81| v_ArrVal_2075) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_81|))) is different from false [2024-11-12 13:44:09,701 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_81| Int) (v_ArrVal_2075 Int) (v_ArrVal_2073 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2073) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_81| v_ArrVal_2075) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_81|))) is different from false [2024-11-12 13:44:09,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:09,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-11-12 13:44:09,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-11-12 13:44:09,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2024-11-12 13:44:09,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:09,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-11-12 13:44:10,044 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-12 13:44:10,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-12 13:44:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 2 not checked. [2024-11-12 13:44:10,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947371330] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:44:10,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:44:10,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 48 [2024-11-12 13:44:10,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816171443] [2024-11-12 13:44:10,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:44:10,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-12 13:44:10,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:44:10,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-12 13:44:10,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1904, Unknown=98, NotChecked=182, Total=2352 [2024-11-12 13:44:10,104 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 49 states, 48 states have (on average 2.8541666666666665) internal successors, (137), 49 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:44:11,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:44:11,307 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-12 13:44:11,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 13:44:11,307 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.8541666666666665) internal successors, (137), 49 states have internal predecessors, (137), 0 states have call successors, (0), 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 68 [2024-11-12 13:44:11,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:44:11,308 INFO L225 Difference]: With dead ends: 87 [2024-11-12 13:44:11,308 INFO L226 Difference]: Without dead ends: 87 [2024-11-12 13:44:11,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 109 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=284, Invalid=3280, Unknown=104, NotChecked=238, Total=3906 [2024-11-12 13:44:11,309 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 45 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:44:11,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 699 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1109 Invalid, 0 Unknown, 140 Unchecked, 0.6s Time] [2024-11-12 13:44:11,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-12 13:44:11,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2024-11-12 13:44:11,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.105263157894737) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:44:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-12 13:44:11,312 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 68 [2024-11-12 13:44:11,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:44:11,312 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-12 13:44:11,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.8541666666666665) internal successors, (137), 49 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:44:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-12 13:44:11,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-12 13:44:11,313 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:44:11,313 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:44:11,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-12 13:44:11,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:44:11,514 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:44:11,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:44:11,514 INFO L85 PathProgramCache]: Analyzing trace with hash 424087740, now seen corresponding path program 2 times [2024-11-12 13:44:11,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:44:11,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016111905] [2024-11-12 13:44:11,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:44:11,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:44:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:44:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-12 13:44:13,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:44:13,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016111905] [2024-11-12 13:44:13,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016111905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:44:13,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575696758] [2024-11-12 13:44:13,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:44:13,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:44:13,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:44:13,310 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) [2024-11-12 13:44:13,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-12 13:44:13,502 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:44:13,502 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:44:13,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-12 13:44:13,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:44:13,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:44:13,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:44:13,666 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:44:13,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-12 13:44:13,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:44:13,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:44:13,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:44:13,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:44:13,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-12 13:44:13,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-12 13:44:14,264 INFO L349 Elim1Store]: treesize reduction 92, result has 35.2 percent of original size [2024-11-12 13:44:14,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 96 [2024-11-12 13:44:14,323 INFO L349 Elim1Store]: treesize reduction 64, result has 47.5 percent of original size [2024-11-12 13:44:14,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 67 [2024-11-12 13:44:14,871 INFO L349 Elim1Store]: treesize reduction 44, result has 51.6 percent of original size [2024-11-12 13:44:14,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 129 treesize of output 151 [2024-11-12 13:44:14,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:44:14,927 INFO L349 Elim1Store]: treesize reduction 104, result has 32.5 percent of original size [2024-11-12 13:44:14,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 149 treesize of output 147 [2024-11-12 13:44:15,163 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:44:15,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 11 [2024-11-12 13:44:15,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 13:44:15,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 13:44:19,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:44:19,710 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2024-11-12 13:44:19,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 43 [2024-11-12 13:44:19,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:19,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-12 13:44:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-12 13:44:19,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:44:19,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-12 13:44:22,463 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse3))) (and (forall ((v_ArrVal_2194 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) (= 0 (select (select .cse2 .cse1) 4)))))) (forall ((v_ArrVal_2194 Int) (v_ArrVal_2192 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) (not (= v_ArrVal_2192 (store (select |c_#memory_$Pointer$#1.offset| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_2192) .cse5) 4) 0))))))) is different from false [2024-11-12 13:44:22,486 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (and (forall ((v_ArrVal_2194 Int) (v_ArrVal_2192 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (or (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2192)) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2192) .cse0) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (forall ((v_ArrVal_2194 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (or (= (select (select .cse4 .cse5) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse5) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))))))) is different from false [2024-11-12 13:44:22,511 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse3))) (and (forall ((v_ArrVal_2194 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (< .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= (select (select .cse2 .cse0) 4) 0))))) (forall ((v_ArrVal_2194 Int) (v_ArrVal_2192 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (or (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2192)) (= .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (< .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_2192) .cse5) 4) 0))))))) is different from false [2024-11-12 13:44:22,571 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (and (forall ((v_ArrVal_2194 Int) (v_ArrVal_2192 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (not (= v_ArrVal_2192 (store (select |c_#memory_$Pointer$#1.offset| .cse0) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2192) .cse1) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1)))) (forall ((v_ArrVal_2194 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (= (select (select .cse4 .cse5) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse5)))))))) is different from false [2024-11-12 13:44:22,601 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse10)) (.cse2 (select .cse10 4)) (.cse6 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse3 (select .cse6 4)) (.cse5 (select .cse4 .cse2))) (and (forall ((v_ArrVal_2194 Int) (v_ArrVal_2192 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse6)) (.cse0 (select (select (store .cse4 .cse2 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) (not (= v_ArrVal_2192 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (= (select (select (store .cse1 .cse2 v_ArrVal_2192) .cse0) 4) 0) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (forall ((v_ArrVal_2194 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse8 (store .cse4 .cse2 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse7) (= (select (select .cse8 .cse7) 4) 0) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))))))))) is different from false [2024-11-12 13:44:22,630 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse10)) (.cse1 (select .cse10 4)) (.cse6 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse3 (select .cse6 4)) (.cse5 (select .cse4 .cse1))) (and (forall ((v_ArrVal_2194 Int) (v_ArrVal_2192 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base| .cse6)) (.cse2 (select (select (store .cse4 .cse1 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_node_create_#res#1.base|) 4))) (or (not (= (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2192)) (= (select (select (store .cse0 .cse1 v_ArrVal_2192) .cse2) 4) 0) (= |c_ULTIMATE.start_node_create_#res#1.base| .cse2) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (forall ((v_ArrVal_2194 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse7 (store .cse4 .cse1 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_node_create_#res#1.base|) 4))) (or (= (select (select .cse7 .cse8) 4) 0) (= |c_ULTIMATE.start_node_create_#res#1.base| .cse8) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))))))))) is different from false [2024-11-12 13:44:22,660 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse10)) (.cse4 (select .cse10 4)) (.cse8 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse8 4)) (.cse5 (select .cse3 .cse4))) (and (forall ((v_ArrVal_2194 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse2 (store .cse3 .cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.base|) (= (select (select .cse2 .cse1) 4) 0))))) (forall ((v_ArrVal_2194 Int) (v_ArrVal_2192 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse8)) (.cse7 (select (select (store .cse3 .cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= (store (select .cse6 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2192)) (= (select (select (store .cse6 .cse4 v_ArrVal_2192) .cse7) 4) 0) (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|))))))))) is different from false [2024-11-12 13:44:22,691 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-11-12 13:44:22,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 118 [2024-11-12 13:44:22,717 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-11-12 13:44:22,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 213 treesize of output 180 [2024-11-12 13:44:23,084 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-11-12 13:44:23,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 211 treesize of output 158 [2024-11-12 13:44:23,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-12 13:44:23,285 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse13 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (and (or (and (forall ((v_ArrVal_2194 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14)) (.cse4 (select v_arrayElimArr_14 4))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194))))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= (select v_arrayElimArr_14 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse1) (= (select (select .cse2 .cse1) 4) 0))))) (forall ((v_ArrVal_2194 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (or (not (= (select v_arrayElimArr_14 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse5 (let ((.cse7 (select v_arrayElimArr_14 4))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))))) (forall ((v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (or (not (= (select v_arrayElimArr_14 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2194 Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (let ((.cse11 (store .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (let ((.cse8 (let ((.cse10 (select v_arrayElimArr_14 4))) (store .cse9 .cse10 (store (select .cse9 .cse10) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194))))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (select .cse11 .cse12) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse12))))))))) .cse13) (or .cse13 (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2194 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse15 (select v_arrayElimArr_13 4))) (let ((.cse16 (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse17 .cse15 (store (select .cse17 .cse15) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (.cse14 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store .cse14 .cse15 v_ArrVal_2192) .cse16) 4) 0) (= .cse16 |c_ULTIMATE.start_node_create_~temp~0#1.base|) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (not (= v_ArrVal_2192 (store (select .cse14 .cse15) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (or (forall ((v_arrayElimArr_14 (Array Int Int))) (or (not (= (select v_arrayElimArr_14 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2194 Int)) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (let ((.cse21 (store .cse19 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse19 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (let ((.cse18 (let ((.cse20 (select v_arrayElimArr_14 4))) (store .cse19 .cse20 (store (select .cse19 .cse20) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194))))) (select .cse18 (select (select .cse18 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (select .cse21 .cse22) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse22)))))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|))) (or (not .cse13) (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2194 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse23 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse24 (select (select (let ((.cse25 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse25 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse25 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select (store .cse23 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2192) .cse24) 4) 0) (not (= (store (select .cse23 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2192)) (not (= (select v_arrayElimArr_13 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_12 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse24))))) (or (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2194 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse26 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse27 (select v_arrayElimArr_13 4)) (.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store .cse26 .cse27 v_ArrVal_2192) (select (select (store .cse28 .cse27 (store (select .cse28 .cse27) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (not (= v_ArrVal_2192 (store (select .cse26 .cse27) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse28 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse28 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))))) .cse13) (or (forall ((v_ArrVal_2194 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse30 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (or (not (= (select v_arrayElimArr_14 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse29 (let ((.cse31 (select v_arrayElimArr_14 4))) (store .cse30 .cse31 (store (select .cse30 .cse31) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194))))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse30 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse30 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))))) .cse13) (or (forall ((v_ArrVal_2194 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse33 (let ((.cse34 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14)) (.cse35 (select v_arrayElimArr_14 4))) (store .cse34 .cse35 (store (select .cse34 .cse35) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194))))) (let ((.cse32 (select (select .cse33 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= (select v_arrayElimArr_14 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse32) (= (select (select .cse33 .cse32) 4) 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|))))) .cse13) (or (and (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2194 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse36 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse37 (select v_arrayElimArr_13 4)) (.cse38 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store .cse36 .cse37 v_ArrVal_2192) (select (select (store .cse38 .cse37 (store (select .cse38 .cse37) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= v_ArrVal_2192 (store (select .cse36 .cse37) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))))) (forall ((v_ArrVal_2194 Int) (v_ArrVal_2192 (Array Int Int)) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse40 (select v_arrayElimArr_13 4))) (let ((.cse41 (select (select (let ((.cse42 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse42 .cse40 (store (select .cse42 .cse40) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (.cse39 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store .cse39 .cse40 v_ArrVal_2192) .cse41) 4) 0) (= .cse41 |c_ULTIMATE.start_node_create_~temp~0#1.base|) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= v_ArrVal_2192 (store (select .cse39 .cse40) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))))) .cse13))) is different from false [2024-11-12 13:44:24,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:24,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 282 treesize of output 223 [2024-11-12 13:44:24,587 INFO L349 Elim1Store]: treesize reduction 23, result has 67.1 percent of original size [2024-11-12 13:44:24,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1098 treesize of output 1021 [2024-11-12 13:44:24,649 INFO L349 Elim1Store]: treesize reduction 44, result has 63.3 percent of original size [2024-11-12 13:44:24,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 386 treesize of output 437 [2024-11-12 13:44:24,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 490 treesize of output 458 [2024-11-12 13:44:24,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:24,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 431 treesize of output 445 [2024-11-12 13:44:24,729 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-12 13:44:24,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 351 treesize of output 360 [2024-11-12 13:44:24,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:24,760 INFO L378 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 347 treesize of output 365 [2024-11-12 13:44:24,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 456 treesize of output 422 [2024-11-12 13:44:24,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-12 13:44:25,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:25,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 62 [2024-11-12 13:44:25,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:25,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2024-11-12 13:44:25,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:25,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2024-11-12 13:44:25,118 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 12 not checked. [2024-11-12 13:44:25,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575696758] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:44:25,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:44:25,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 73 [2024-11-12 13:44:25,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840710130] [2024-11-12 13:44:25,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:44:25,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-11-12 13:44:25,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:44:25,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-11-12 13:44:25,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=3919, Unknown=16, NotChecked=1064, Total=5256 [2024-11-12 13:44:25,120 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 73 states, 73 states have (on average 2.287671232876712) internal successors, (167), 73 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:44:27,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:44:27,214 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2024-11-12 13:44:27,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-12 13:44:27,217 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.287671232876712) internal successors, (167), 73 states have internal predecessors, (167), 0 states have call successors, (0), 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 71 [2024-11-12 13:44:27,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:44:27,218 INFO L225 Difference]: With dead ends: 141 [2024-11-12 13:44:27,218 INFO L226 Difference]: Without dead ends: 141 [2024-11-12 13:44:27,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 102 SyntacticMatches, 7 SemanticMatches, 84 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=375, Invalid=5647, Unknown=16, NotChecked=1272, Total=7310 [2024-11-12 13:44:27,219 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 56 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 1964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 592 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 13:44:27,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1215 Invalid, 1964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1364 Invalid, 0 Unknown, 592 Unchecked, 0.9s Time] [2024-11-12 13:44:27,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-12 13:44:27,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2024-11-12 13:44:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 138 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:44:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 145 transitions. [2024-11-12 13:44:27,223 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 145 transitions. Word has length 71 [2024-11-12 13:44:27,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:44:27,223 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 145 transitions. [2024-11-12 13:44:27,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 2.287671232876712) internal successors, (167), 73 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:44:27,223 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2024-11-12 13:44:27,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 13:44:27,224 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:44:27,224 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:44:27,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-12 13:44:27,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:44:27,424 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-12 13:44:27,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:44:27,425 INFO L85 PathProgramCache]: Analyzing trace with hash 261816652, now seen corresponding path program 2 times [2024-11-12 13:44:27,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:44:27,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073887986] [2024-11-12 13:44:27,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:44:27,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:44:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:44:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:44:28,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:44:28,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073887986] [2024-11-12 13:44:28,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073887986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:44:28,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643146958] [2024-11-12 13:44:28,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:44:28,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:44:28,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:44:28,776 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:44:28,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-12 13:44:28,970 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:44:28,970 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:44:28,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-12 13:44:28,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:44:29,042 INFO L349 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2024-11-12 13:44:29,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 39 [2024-11-12 13:44:29,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:44:29,544 INFO L349 Elim1Store]: treesize reduction 17, result has 34.6 percent of original size [2024-11-12 13:44:29,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2024-11-12 13:44:29,558 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:44:29,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 28 [2024-11-12 13:44:29,758 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-12 13:44:29,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 59 [2024-11-12 13:44:30,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:30,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 59 [2024-11-12 13:44:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 13:44:30,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:44:31,520 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2310 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4) v_ArrVal_2310) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-12 13:44:31,523 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2310 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) v_ArrVal_2310) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-12 13:44:31,526 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2310 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) v_ArrVal_2310) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-12 13:44:31,531 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2310 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) v_ArrVal_2310) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-12 13:44:31,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:31,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2024-11-12 13:44:31,551 INFO L349 Elim1Store]: treesize reduction 12, result has 66.7 percent of original size [2024-11-12 13:44:31,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 73 [2024-11-12 13:44:31,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:44:31,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 107 [2024-11-12 13:44:31,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 82