./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.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 c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:53:42,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:53:43,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:53:43,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:53:43,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:53:43,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:53:43,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:53:43,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:53:43,119 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:53:43,119 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:53:43,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:53:43,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:53:43,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:53:43,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:53:43,122 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:53:43,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:53:43,123 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:53:43,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:53:43,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:53:43,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:53:43,124 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:53:43,128 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:53:43,128 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:53:43,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:53:43,129 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:53:43,129 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:53:43,129 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:53:43,129 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:53:43,130 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:53:43,130 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:53:43,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:53:43,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:53:43,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:53:43,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:53:43,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:53:43,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:53:43,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:53:43,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:53:43,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:53:43,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:53:43,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:53:43,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:53:43,137 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 -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2024-10-13 10:53:43,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:53:43,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:53:43,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:53:43,427 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:53:43,428 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:53:43,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2024-10-13 10:53:44,796 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:53:45,030 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:53:45,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2024-10-13 10:53:45,044 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c142814b6/00d09274544e44a09b0f54de117d5e17/FLAGe1589e8d7 [2024-10-13 10:53:45,363 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c142814b6/00d09274544e44a09b0f54de117d5e17 [2024-10-13 10:53:45,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:53:45,367 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:53:45,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:53:45,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:53:45,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:53:45,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:53:45" (1/1) ... [2024-10-13 10:53:45,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a8ece67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:45, skipping insertion in model container [2024-10-13 10:53:45,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:53:45" (1/1) ... [2024-10-13 10:53:45,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:53:45,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:53:45,750 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:53:45,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:53:45,834 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:53:45,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:45 WrapperNode [2024-10-13 10:53:45,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:53:45,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:53:45,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:53:45,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:53:45,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:45" (1/1) ... [2024-10-13 10:53:45,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:45" (1/1) ... [2024-10-13 10:53:45,880 INFO L138 Inliner]: procedures = 124, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 96 [2024-10-13 10:53:45,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:53:45,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:53:45,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:53:45,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:53:45,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:45" (1/1) ... [2024-10-13 10:53:45,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:45" (1/1) ... [2024-10-13 10:53:45,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:45" (1/1) ... [2024-10-13 10:53:45,917 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2024-10-13 10:53:45,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:45" (1/1) ... [2024-10-13 10:53:45,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:45" (1/1) ... [2024-10-13 10:53:45,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:45" (1/1) ... [2024-10-13 10:53:45,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:45" (1/1) ... [2024-10-13 10:53:45,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:45" (1/1) ... [2024-10-13 10:53:45,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:45" (1/1) ... [2024-10-13 10:53:45,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:53:45,934 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:53:45,934 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:53:45,934 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:53:45,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:45" (1/1) ... [2024-10-13 10:53:45,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:53:45,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:53:45,974 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-10-13 10:53:45,977 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-10-13 10:53:46,035 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2024-10-13 10:53:46,035 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2024-10-13 10:53:46,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 10:53:46,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 10:53:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:53:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:53:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:53:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:53:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:53:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:53:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:53:46,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:53:46,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 10:53:46,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 10:53:46,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:53:46,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:53:46,183 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:53:46,185 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:53:46,544 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-10-13 10:53:46,544 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:53:46,583 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:53:46,584 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 10:53:46,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:53:46 BoogieIcfgContainer [2024-10-13 10:53:46,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:53:46,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:53:46,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:53:46,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:53:46,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:53:45" (1/3) ... [2024-10-13 10:53:46,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f8239b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:53:46, skipping insertion in model container [2024-10-13 10:53:46,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:45" (2/3) ... [2024-10-13 10:53:46,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f8239b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:53:46, skipping insertion in model container [2024-10-13 10:53:46,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:53:46" (3/3) ... [2024-10-13 10:53:46,594 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2024-10-13 10:53:46,610 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:53:46,610 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-10-13 10:53:46,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:53:46,661 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;@7c5737d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:53:46,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-10-13 10:53:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 52 states have (on average 2.1153846153846154) internal successors, (110), 96 states have internal predecessors, (110), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:53:46,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:53:46,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:46,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:53:46,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:46,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:46,676 INFO L85 PathProgramCache]: Analyzing trace with hash 6904, now seen corresponding path program 1 times [2024-10-13 10:53:46,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:46,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892479218] [2024-10-13 10:53:46,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:46,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:46,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:46,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892479218] [2024-10-13 10:53:46,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892479218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:46,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:46,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:53:46,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123322374] [2024-10-13 10:53:46,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:46,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:53:46,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:46,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:53:46,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:53:46,938 INFO L87 Difference]: Start difference. First operand has 105 states, 52 states have (on average 2.1153846153846154) internal successors, (110), 96 states have internal predecessors, (110), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-10-13 10:53:47,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:47,100 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2024-10-13 10:53:47,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:53:47,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-10-13 10:53:47,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:47,111 INFO L225 Difference]: With dead ends: 102 [2024-10-13 10:53:47,111 INFO L226 Difference]: Without dead ends: 101 [2024-10-13 10:53:47,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-13 10:53:47,116 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 77 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:47,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 87 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:47,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-13 10:53:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-13 10:53:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 51 states have (on average 2.0) internal successors, (102), 92 states have internal predecessors, (102), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:53:47,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2024-10-13 10:53:47,168 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 2 [2024-10-13 10:53:47,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:47,169 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2024-10-13 10:53:47,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-10-13 10:53:47,169 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2024-10-13 10:53:47,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:53:47,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:47,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:53:47,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:53:47,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:47,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:47,173 INFO L85 PathProgramCache]: Analyzing trace with hash 6905, now seen corresponding path program 1 times [2024-10-13 10:53:47,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:47,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525189899] [2024-10-13 10:53:47,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:47,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:47,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:47,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:47,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525189899] [2024-10-13 10:53:47,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525189899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:47,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:47,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:53:47,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236057228] [2024-10-13 10:53:47,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:47,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:53:47,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:47,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:53:47,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:53:47,297 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-10-13 10:53:47,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:47,394 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-10-13 10:53:47,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:53:47,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-10-13 10:53:47,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:47,396 INFO L225 Difference]: With dead ends: 99 [2024-10-13 10:53:47,397 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 10:53:47,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-13 10:53:47,399 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 77 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:47,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 88 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:47,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 10:53:47,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-13 10:53:47,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 90 states have internal predecessors, (100), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:53:47,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2024-10-13 10:53:47,412 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 2 [2024-10-13 10:53:47,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:47,412 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2024-10-13 10:53:47,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-10-13 10:53:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2024-10-13 10:53:47,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 10:53:47,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:47,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:47,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:53:47,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:47,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash 233145900, now seen corresponding path program 1 times [2024-10-13 10:53:47,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:47,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961533348] [2024-10-13 10:53:47,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:47,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:47,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:47,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961533348] [2024-10-13 10:53:47,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961533348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:47,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:47,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:53:47,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161167911] [2024-10-13 10:53:47,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:47,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:53:47,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:47,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:53:47,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:53:47,512 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:53:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:47,580 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2024-10-13 10:53:47,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:53:47,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 10:53:47,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:47,582 INFO L225 Difference]: With dead ends: 98 [2024-10-13 10:53:47,582 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 10:53:47,582 INFO L431 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-10-13 10:53:47,583 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:47,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 158 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:47,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 10:53:47,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-13 10:53:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 51 states have (on average 1.9215686274509804) internal successors, (98), 88 states have internal predecessors, (98), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:53:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2024-10-13 10:53:47,591 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 7 [2024-10-13 10:53:47,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:47,591 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2024-10-13 10:53:47,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:53:47,592 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2024-10-13 10:53:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 10:53:47,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:47,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:47,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:53:47,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:47,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:47,593 INFO L85 PathProgramCache]: Analyzing trace with hash 233145901, now seen corresponding path program 1 times [2024-10-13 10:53:47,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:47,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716678164] [2024-10-13 10:53:47,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:47,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:47,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:47,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716678164] [2024-10-13 10:53:47,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716678164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:47,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:47,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:53:47,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639127083] [2024-10-13 10:53:47,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:47,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:53:47,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:47,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:53:47,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:53:47,700 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:53:47,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:47,773 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2024-10-13 10:53:47,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:53:47,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 10:53:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:47,776 INFO L225 Difference]: With dead ends: 96 [2024-10-13 10:53:47,776 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 10:53:47,778 INFO L431 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-10-13 10:53:47,779 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:47,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 160 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 10:53:47,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-13 10:53:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 86 states have internal predecessors, (96), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:53:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2024-10-13 10:53:47,791 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 7 [2024-10-13 10:53:47,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:47,791 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2024-10-13 10:53:47,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:53:47,794 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2024-10-13 10:53:47,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:53:47,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:47,794 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:47,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:53:47,795 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:47,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:47,795 INFO L85 PathProgramCache]: Analyzing trace with hash 717072888, now seen corresponding path program 1 times [2024-10-13 10:53:47,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:47,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639346225] [2024-10-13 10:53:47,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:47,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:47,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:47,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:47,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639346225] [2024-10-13 10:53:47,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639346225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:47,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:47,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:53:47,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505905399] [2024-10-13 10:53:47,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:47,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:53:47,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:47,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:53:47,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:53:47,934 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:53:48,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:48,032 INFO L93 Difference]: Finished difference Result 169 states and 194 transitions. [2024-10-13 10:53:48,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:53:48,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-13 10:53:48,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:48,034 INFO L225 Difference]: With dead ends: 169 [2024-10-13 10:53:48,057 INFO L226 Difference]: Without dead ends: 169 [2024-10-13 10:53:48,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:53:48,058 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 72 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:48,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 374 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-13 10:53:48,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 137. [2024-10-13 10:53:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 88 states have (on average 1.9431818181818181) internal successors, (171), 124 states have internal predecessors, (171), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:53:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 191 transitions. [2024-10-13 10:53:48,079 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 191 transitions. Word has length 9 [2024-10-13 10:53:48,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:48,080 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 191 transitions. [2024-10-13 10:53:48,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:53:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 191 transitions. [2024-10-13 10:53:48,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:53:48,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:48,081 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:48,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:53:48,084 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:48,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:48,085 INFO L85 PathProgramCache]: Analyzing trace with hash 714911023, now seen corresponding path program 1 times [2024-10-13 10:53:48,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:48,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510387773] [2024-10-13 10:53:48,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:48,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:48,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:48,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510387773] [2024-10-13 10:53:48,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510387773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:48,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:48,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:53:48,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586616696] [2024-10-13 10:53:48,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:48,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:53:48,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:48,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:53:48,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:53:48,264 INFO L87 Difference]: Start difference. First operand 137 states and 191 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-10-13 10:53:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:48,372 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2024-10-13 10:53:48,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:53:48,373 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-10-13 10:53:48,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:48,375 INFO L225 Difference]: With dead ends: 136 [2024-10-13 10:53:48,378 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 10:53:48,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:53:48,379 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 137 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:48,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 116 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:48,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 10:53:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-13 10:53:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 88 states have (on average 1.9204545454545454) internal successors, (169), 123 states have internal predecessors, (169), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:53:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2024-10-13 10:53:48,396 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 9 [2024-10-13 10:53:48,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:48,396 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2024-10-13 10:53:48,396 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-10-13 10:53:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2024-10-13 10:53:48,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:53:48,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:48,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:48,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:53:48,397 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:48,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:48,398 INFO L85 PathProgramCache]: Analyzing trace with hash 714911024, now seen corresponding path program 1 times [2024-10-13 10:53:48,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:48,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390524140] [2024-10-13 10:53:48,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:48,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:48,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:48,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:48,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390524140] [2024-10-13 10:53:48,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390524140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:48,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:48,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:53:48,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243530071] [2024-10-13 10:53:48,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:48,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:53:48,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:48,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:53:48,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:53:48,573 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-10-13 10:53:48,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:48,670 INFO L93 Difference]: Finished difference Result 135 states and 187 transitions. [2024-10-13 10:53:48,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:53:48,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-10-13 10:53:48,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:48,672 INFO L225 Difference]: With dead ends: 135 [2024-10-13 10:53:48,672 INFO L226 Difference]: Without dead ends: 135 [2024-10-13 10:53:48,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:53:48,673 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 137 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:48,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 101 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:48,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-13 10:53:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-13 10:53:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.8977272727272727) internal successors, (167), 122 states have internal predecessors, (167), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:53:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 187 transitions. [2024-10-13 10:53:48,680 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 187 transitions. Word has length 9 [2024-10-13 10:53:48,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:48,681 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 187 transitions. [2024-10-13 10:53:48,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-10-13 10:53:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 187 transitions. [2024-10-13 10:53:48,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:53:48,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:48,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:48,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:53:48,683 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:48,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:48,683 INFO L85 PathProgramCache]: Analyzing trace with hash -177375370, now seen corresponding path program 1 times [2024-10-13 10:53:48,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:48,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909072562] [2024-10-13 10:53:48,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:48,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:48,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:53:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:48,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:48,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:48,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909072562] [2024-10-13 10:53:48,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909072562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:48,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:48,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:53:48,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165059340] [2024-10-13 10:53:48,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:48,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:53:48,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:48,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:53:48,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:53:48,788 INFO L87 Difference]: Start difference. First operand 135 states and 187 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:53:49,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:49,010 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2024-10-13 10:53:49,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:53:49,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-13 10:53:49,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:49,014 INFO L225 Difference]: With dead ends: 156 [2024-10-13 10:53:49,014 INFO L226 Difference]: Without dead ends: 156 [2024-10-13 10:53:49,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:53:49,015 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 269 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:49,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 163 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:53:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-13 10:53:49,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 130. [2024-10-13 10:53:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 88 states have (on average 1.7727272727272727) internal successors, (156), 117 states have internal predecessors, (156), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:53:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2024-10-13 10:53:49,027 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 14 [2024-10-13 10:53:49,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:49,027 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2024-10-13 10:53:49,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:53:49,028 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2024-10-13 10:53:49,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:53:49,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:49,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:49,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:53:49,029 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:49,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:49,030 INFO L85 PathProgramCache]: Analyzing trace with hash -177375369, now seen corresponding path program 1 times [2024-10-13 10:53:49,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:49,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052090077] [2024-10-13 10:53:49,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:49,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:49,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:53:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:49,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:49,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052090077] [2024-10-13 10:53:49,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052090077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:49,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:49,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:53:49,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765885184] [2024-10-13 10:53:49,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:49,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:53:49,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:49,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:53:49,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:53:49,220 INFO L87 Difference]: Start difference. First operand 130 states and 176 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:53:49,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:49,466 INFO L93 Difference]: Finished difference Result 151 states and 175 transitions. [2024-10-13 10:53:49,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:53:49,467 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-13 10:53:49,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:49,469 INFO L225 Difference]: With dead ends: 151 [2024-10-13 10:53:49,469 INFO L226 Difference]: Without dead ends: 151 [2024-10-13 10:53:49,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:53:49,470 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 191 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:49,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 218 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:53:49,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-13 10:53:49,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 130. [2024-10-13 10:53:49,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 88 states have (on average 1.7045454545454546) internal successors, (150), 117 states have internal predecessors, (150), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:53:49,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 170 transitions. [2024-10-13 10:53:49,478 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 170 transitions. Word has length 14 [2024-10-13 10:53:49,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:49,479 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 170 transitions. [2024-10-13 10:53:49,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:53:49,479 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 170 transitions. [2024-10-13 10:53:49,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:53:49,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:49,480 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:49,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:53:49,481 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:49,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:49,481 INFO L85 PathProgramCache]: Analyzing trace with hash -2103323471, now seen corresponding path program 1 times [2024-10-13 10:53:49,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:49,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376828899] [2024-10-13 10:53:49,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:49,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:49,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:49,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376828899] [2024-10-13 10:53:49,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376828899] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:53:49,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745232040] [2024-10-13 10:53:49,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:49,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:53:49,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:53:49,585 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-10-13 10:53:49,586 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-10-13 10:53:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:49,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:53:49,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:53:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:49,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:53:49,800 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 10:53:49,801 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 12 treesize of output 11 [2024-10-13 10:53:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:49,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745232040] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:53:49,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:53:49,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-10-13 10:53:49,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119607667] [2024-10-13 10:53:49,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:53:49,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:53:49,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:49,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:53:49,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:53:49,817 INFO L87 Difference]: Start difference. First operand 130 states and 170 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:53:50,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:50,024 INFO L93 Difference]: Finished difference Result 144 states and 189 transitions. [2024-10-13 10:53:50,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:53:50,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 10:53:50,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:50,025 INFO L225 Difference]: With dead ends: 144 [2024-10-13 10:53:50,025 INFO L226 Difference]: Without dead ends: 144 [2024-10-13 10:53:50,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:53:50,026 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 139 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:50,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 181 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:53:50,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-13 10:53:50,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2024-10-13 10:53:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 123 states have internal predecessors, (160), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 10:53:50,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 182 transitions. [2024-10-13 10:53:50,036 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 182 transitions. Word has length 17 [2024-10-13 10:53:50,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:50,036 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 182 transitions. [2024-10-13 10:53:50,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:53:50,037 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 182 transitions. [2024-10-13 10:53:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:53:50,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:50,037 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:50,054 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-10-13 10:53:50,238 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,SelfDestructingSolverStorable9 [2024-10-13 10:53:50,238 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:50,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:50,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2103323470, now seen corresponding path program 1 times [2024-10-13 10:53:50,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:50,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416361593] [2024-10-13 10:53:50,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:50,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:50,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:50,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416361593] [2024-10-13 10:53:50,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416361593] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:53:50,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180571215] [2024-10-13 10:53:50,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:50,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:53:50,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:53:50,429 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-10-13 10:53:50,431 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-10-13 10:53:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:50,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 10:53:50,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:53:50,544 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-10-13 10:53:50,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:53:50,601 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-10-13 10:53:50,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:50,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:53:50,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:50,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180571215] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:53:50,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:53:50,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 13 [2024-10-13 10:53:50,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960620797] [2024-10-13 10:53:50,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:53:50,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 10:53:50,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:50,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 10:53:50,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:53:50,921 INFO L87 Difference]: Start difference. First operand 138 states and 182 transitions. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:53:51,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:51,269 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2024-10-13 10:53:51,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:53:51,269 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 10:53:51,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:51,271 INFO L225 Difference]: With dead ends: 142 [2024-10-13 10:53:51,271 INFO L226 Difference]: Without dead ends: 142 [2024-10-13 10:53:51,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:53:51,272 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 315 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:51,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 231 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:53:51,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-13 10:53:51,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 137. [2024-10-13 10:53:51,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 95 states have (on average 1.6526315789473685) internal successors, (157), 122 states have internal predecessors, (157), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 10:53:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 179 transitions. [2024-10-13 10:53:51,277 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 179 transitions. Word has length 17 [2024-10-13 10:53:51,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:51,278 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 179 transitions. [2024-10-13 10:53:51,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:53:51,278 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2024-10-13 10:53:51,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 10:53:51,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:51,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:51,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 10:53:51,483 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,SelfDestructingSolverStorable10 [2024-10-13 10:53:51,484 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:51,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:51,484 INFO L85 PathProgramCache]: Analyzing trace with hash 175039610, now seen corresponding path program 1 times [2024-10-13 10:53:51,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:51,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840680027] [2024-10-13 10:53:51,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:51,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:51,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:53:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:51,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:51,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840680027] [2024-10-13 10:53:51,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840680027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:51,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:51,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:53:51,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144243293] [2024-10-13 10:53:51,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:51,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:53:51,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:51,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:53:51,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:53:51,743 INFO L87 Difference]: Start difference. First operand 137 states and 179 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:53:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:51,916 INFO L93 Difference]: Finished difference Result 186 states and 238 transitions. [2024-10-13 10:53:51,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:53:51,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-13 10:53:51,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:51,918 INFO L225 Difference]: With dead ends: 186 [2024-10-13 10:53:51,918 INFO L226 Difference]: Without dead ends: 186 [2024-10-13 10:53:51,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:53:51,919 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 157 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:51,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 300 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-13 10:53:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 146. [2024-10-13 10:53:51,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 103 states have (on average 1.6213592233009708) internal successors, (167), 130 states have internal predecessors, (167), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 10:53:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 191 transitions. [2024-10-13 10:53:51,925 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 191 transitions. Word has length 18 [2024-10-13 10:53:51,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:51,925 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 191 transitions. [2024-10-13 10:53:51,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:53:51,925 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 191 transitions. [2024-10-13 10:53:51,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 10:53:51,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:51,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:51,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:53:51,926 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:51,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:51,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1035774396, now seen corresponding path program 1 times [2024-10-13 10:53:51,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:51,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790291432] [2024-10-13 10:53:51,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:51,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:52,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:53:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:52,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:52,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790291432] [2024-10-13 10:53:52,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790291432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:52,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:52,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:53:52,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324842994] [2024-10-13 10:53:52,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:52,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:53:52,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:52,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:53:52,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:53:52,159 INFO L87 Difference]: Start difference. First operand 146 states and 191 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:53:52,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:52,338 INFO L93 Difference]: Finished difference Result 181 states and 232 transitions. [2024-10-13 10:53:52,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:53:52,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-13 10:53:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:52,340 INFO L225 Difference]: With dead ends: 181 [2024-10-13 10:53:52,340 INFO L226 Difference]: Without dead ends: 181 [2024-10-13 10:53:52,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:53:52,341 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 40 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:52,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 427 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:52,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-13 10:53:52,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 148. [2024-10-13 10:53:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 132 states have internal predecessors, (169), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 10:53:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 193 transitions. [2024-10-13 10:53:52,346 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 193 transitions. Word has length 20 [2024-10-13 10:53:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:52,346 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 193 transitions. [2024-10-13 10:53:52,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:53:52,347 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 193 transitions. [2024-10-13 10:53:52,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 10:53:52,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:52,347 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:52,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:53:52,348 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:52,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:52,348 INFO L85 PathProgramCache]: Analyzing trace with hash -750512035, now seen corresponding path program 1 times [2024-10-13 10:53:52,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:52,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722802192] [2024-10-13 10:53:52,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:52,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:52,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:53:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:52,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:52,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722802192] [2024-10-13 10:53:52,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722802192] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:53:52,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601557772] [2024-10-13 10:53:52,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:52,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:53:52,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:53:52,451 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-10-13 10:53:52,453 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-10-13 10:53:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:52,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 10:53:52,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:53:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:52,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:53:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:52,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601557772] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:53:52,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:53:52,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-10-13 10:53:52,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881103837] [2024-10-13 10:53:52,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:53:52,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 10:53:52,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:52,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 10:53:52,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:53:52,742 INFO L87 Difference]: Start difference. First operand 148 states and 193 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:53:53,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:53,236 INFO L93 Difference]: Finished difference Result 175 states and 208 transitions. [2024-10-13 10:53:53,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:53:53,237 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2024-10-13 10:53:53,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:53,238 INFO L225 Difference]: With dead ends: 175 [2024-10-13 10:53:53,238 INFO L226 Difference]: Without dead ends: 173 [2024-10-13 10:53:53,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-10-13 10:53:53,239 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 420 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:53,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 602 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:53:53,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-13 10:53:53,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 148. [2024-10-13 10:53:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 105 states have (on average 1.6) internal successors, (168), 132 states have internal predecessors, (168), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 10:53:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 192 transitions. [2024-10-13 10:53:53,245 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 192 transitions. Word has length 22 [2024-10-13 10:53:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:53,246 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 192 transitions. [2024-10-13 10:53:53,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:53:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 192 transitions. [2024-10-13 10:53:53,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 10:53:53,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:53,247 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:53,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 10:53:53,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:53:53,448 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:53,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:53,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1597442883, now seen corresponding path program 1 times [2024-10-13 10:53:53,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:53,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700086730] [2024-10-13 10:53:53,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:53,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:53,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:53,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700086730] [2024-10-13 10:53:53,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700086730] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:53:53,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471991157] [2024-10-13 10:53:53,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:53,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:53:53,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:53:53,777 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-10-13 10:53:53,778 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-10-13 10:53:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:53,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 10:53:53,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:53:53,906 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-10-13 10:53:53,956 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-10-13 10:53:54,017 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 21 treesize of output 9 [2024-10-13 10:53:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:54,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:53:54,098 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 34 treesize of output 28 [2024-10-13 10:53:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:54,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471991157] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:53:54,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:53:54,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2024-10-13 10:53:54,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232799881] [2024-10-13 10:53:54,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:53:54,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 10:53:54,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:54,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 10:53:54,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2024-10-13 10:53:54,205 INFO L87 Difference]: Start difference. First operand 148 states and 192 transitions. Second operand has 21 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:53:55,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:55,237 INFO L93 Difference]: Finished difference Result 325 states and 423 transitions. [2024-10-13 10:53:55,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 10:53:55,237 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-13 10:53:55,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:55,240 INFO L225 Difference]: With dead ends: 325 [2024-10-13 10:53:55,240 INFO L226 Difference]: Without dead ends: 325 [2024-10-13 10:53:55,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 10:53:55,241 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 253 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:55,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1316 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 10:53:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-13 10:53:55,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 198. [2024-10-13 10:53:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 144 states have (on average 1.5833333333333333) internal successors, (228), 173 states have internal predecessors, (228), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 10:53:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 268 transitions. [2024-10-13 10:53:55,253 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 268 transitions. Word has length 23 [2024-10-13 10:53:55,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:55,253 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 268 transitions. [2024-10-13 10:53:55,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:53:55,254 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 268 transitions. [2024-10-13 10:53:55,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 10:53:55,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:55,255 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:55,269 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-10-13 10:53:55,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-13 10:53:55,459 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:55,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:55,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1597442884, now seen corresponding path program 1 times [2024-10-13 10:53:55,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:55,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027163875] [2024-10-13 10:53:55,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:55,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:55,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:55,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027163875] [2024-10-13 10:53:55,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027163875] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:53:55,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087688422] [2024-10-13 10:53:55,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:55,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:53:55,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:53:55,812 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-10-13 10:53:55,814 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-10-13 10:53:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:55,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-13 10:53:55,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:53:55,951 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-10-13 10:53:55,956 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-10-13 10:53:56,059 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 19 treesize of output 7 [2024-10-13 10:53:56,061 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 19 treesize of output 7 [2024-10-13 10:53:56,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:56,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:53:56,136 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 27 treesize of output 21 [2024-10-13 10:53:56,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:53:56,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:53:56,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:56,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087688422] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:53:56,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:53:56,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-10-13 10:53:56,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513476152] [2024-10-13 10:53:56,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:53:56,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 10:53:56,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:56,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 10:53:56,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:53:56,181 INFO L87 Difference]: Start difference. First operand 198 states and 268 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:53:56,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:56,589 INFO L93 Difference]: Finished difference Result 273 states and 357 transitions. [2024-10-13 10:53:56,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:53:56,589 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-13 10:53:56,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:56,591 INFO L225 Difference]: With dead ends: 273 [2024-10-13 10:53:56,591 INFO L226 Difference]: Without dead ends: 273 [2024-10-13 10:53:56,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-10-13 10:53:56,592 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 316 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:56,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1126 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:53:56,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-13 10:53:56,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 235. [2024-10-13 10:53:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 174 states have (on average 1.5689655172413792) internal successors, (273), 204 states have internal predecessors, (273), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 10:53:56,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 323 transitions. [2024-10-13 10:53:56,599 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 323 transitions. Word has length 23 [2024-10-13 10:53:56,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:56,599 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 323 transitions. [2024-10-13 10:53:56,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:53:56,600 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 323 transitions. [2024-10-13 10:53:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:53:56,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:56,601 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 10:53:56,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 10:53:56,801 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,SelfDestructingSolverStorable15 [2024-10-13 10:53:56,802 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:56,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:56,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1647234180, now seen corresponding path program 1 times [2024-10-13 10:53:56,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:56,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837140420] [2024-10-13 10:53:56,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:56,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:56,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:53:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:56,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:56,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:56,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837140420] [2024-10-13 10:53:56,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837140420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:56,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:56,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:53:56,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538215719] [2024-10-13 10:53:56,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:56,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:53:56,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:56,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:53:56,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:53:56,865 INFO L87 Difference]: Start difference. First operand 235 states and 323 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:53:56,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:56,896 INFO L93 Difference]: Finished difference Result 249 states and 341 transitions. [2024-10-13 10:53:56,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:53:56,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-13 10:53:56,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:56,898 INFO L225 Difference]: With dead ends: 249 [2024-10-13 10:53:56,898 INFO L226 Difference]: Without dead ends: 249 [2024-10-13 10:53:56,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:53:56,899 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:56,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 363 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:53:56,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-13 10:53:56,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 244. [2024-10-13 10:53:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 177 states have (on average 1.5593220338983051) internal successors, (276), 212 states have internal predecessors, (276), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 10:53:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 336 transitions. [2024-10-13 10:53:56,906 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 336 transitions. Word has length 24 [2024-10-13 10:53:56,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:56,906 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 336 transitions. [2024-10-13 10:53:56,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:53:56,907 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 336 transitions. [2024-10-13 10:53:56,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:53:56,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:56,907 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:56,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 10:53:56,908 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:56,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:56,908 INFO L85 PathProgramCache]: Analyzing trace with hash -812306743, now seen corresponding path program 1 times [2024-10-13 10:53:56,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:56,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689327906] [2024-10-13 10:53:56,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:56,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:56,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:53:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:56,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689327906] [2024-10-13 10:53:56,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689327906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:56,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:56,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:53:56,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954045661] [2024-10-13 10:53:56,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:56,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:53:56,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:56,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:53:56,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:53:56,972 INFO L87 Difference]: Start difference. First operand 244 states and 336 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:53:57,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:57,096 INFO L93 Difference]: Finished difference Result 245 states and 336 transitions. [2024-10-13 10:53:57,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:53:57,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-13 10:53:57,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:57,098 INFO L225 Difference]: With dead ends: 245 [2024-10-13 10:53:57,098 INFO L226 Difference]: Without dead ends: 245 [2024-10-13 10:53:57,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:53:57,099 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 72 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:57,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 148 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:57,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-13 10:53:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2024-10-13 10:53:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 177 states have (on average 1.5480225988700564) internal successors, (274), 211 states have internal predecessors, (274), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 10:53:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 334 transitions. [2024-10-13 10:53:57,106 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 334 transitions. Word has length 24 [2024-10-13 10:53:57,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:57,106 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 334 transitions. [2024-10-13 10:53:57,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:53:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 334 transitions. [2024-10-13 10:53:57,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:53:57,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:57,108 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:57,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 10:53:57,108 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:57,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:57,108 INFO L85 PathProgramCache]: Analyzing trace with hash -812306742, now seen corresponding path program 1 times [2024-10-13 10:53:57,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:57,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035209749] [2024-10-13 10:53:57,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:57,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:57,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:53:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:57,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:57,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035209749] [2024-10-13 10:53:57,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035209749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:57,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:57,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:53:57,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985943388] [2024-10-13 10:53:57,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:57,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:53:57,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:57,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:53:57,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:53:57,258 INFO L87 Difference]: Start difference. First operand 243 states and 334 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:53:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:57,463 INFO L93 Difference]: Finished difference Result 258 states and 330 transitions. [2024-10-13 10:53:57,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:53:57,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-13 10:53:57,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:57,465 INFO L225 Difference]: With dead ends: 258 [2024-10-13 10:53:57,465 INFO L226 Difference]: Without dead ends: 258 [2024-10-13 10:53:57,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:53:57,466 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 67 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:57,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 327 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:53:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-13 10:53:57,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 237. [2024-10-13 10:53:57,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 177 states have (on average 1.497175141242938) internal successors, (265), 205 states have internal predecessors, (265), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 10:53:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 325 transitions. [2024-10-13 10:53:57,479 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 325 transitions. Word has length 24 [2024-10-13 10:53:57,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:57,480 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 325 transitions. [2024-10-13 10:53:57,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:53:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 325 transitions. [2024-10-13 10:53:57,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:53:57,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:57,481 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:57,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 10:53:57,481 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:57,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:57,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1868175622, now seen corresponding path program 1 times [2024-10-13 10:53:57,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:57,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638884868] [2024-10-13 10:53:57,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:57,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:57,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:53:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:57,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 10:53:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:57,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:57,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638884868] [2024-10-13 10:53:57,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638884868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:57,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:57,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:53:57,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799307358] [2024-10-13 10:53:57,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:57,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:53:57,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:57,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:53:57,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:53:57,561 INFO L87 Difference]: Start difference. First operand 237 states and 325 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:53:57,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:57,736 INFO L93 Difference]: Finished difference Result 250 states and 319 transitions. [2024-10-13 10:53:57,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:53:57,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-10-13 10:53:57,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:57,738 INFO L225 Difference]: With dead ends: 250 [2024-10-13 10:53:57,738 INFO L226 Difference]: Without dead ends: 250 [2024-10-13 10:53:57,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:53:57,739 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 167 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:57,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 172 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:53:57,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-13 10:53:57,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 234. [2024-10-13 10:53:57,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 177 states have (on average 1.4350282485875707) internal successors, (254), 202 states have internal predecessors, (254), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 10:53:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 314 transitions. [2024-10-13 10:53:57,748 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 314 transitions. Word has length 26 [2024-10-13 10:53:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:57,749 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 314 transitions. [2024-10-13 10:53:57,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:53:57,749 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 314 transitions. [2024-10-13 10:53:57,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:53:57,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:57,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:57,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 10:53:57,752 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:57,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1868175621, now seen corresponding path program 1 times [2024-10-13 10:53:57,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:57,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858304120] [2024-10-13 10:53:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:57,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:57,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:53:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:57,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 10:53:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:57,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:57,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858304120] [2024-10-13 10:53:57,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858304120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:57,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:57,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:53:57,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244206439] [2024-10-13 10:53:57,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:57,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:53:57,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:57,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:53:57,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:53:57,878 INFO L87 Difference]: Start difference. First operand 234 states and 314 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:53:58,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:58,042 INFO L93 Difference]: Finished difference Result 247 states and 313 transitions. [2024-10-13 10:53:58,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:53:58,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-10-13 10:53:58,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:58,044 INFO L225 Difference]: With dead ends: 247 [2024-10-13 10:53:58,044 INFO L226 Difference]: Without dead ends: 247 [2024-10-13 10:53:58,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:53:58,045 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 196 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:58,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 158 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:58,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-13 10:53:58,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 234. [2024-10-13 10:53:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 177 states have (on average 1.4011299435028248) internal successors, (248), 202 states have internal predecessors, (248), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 10:53:58,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 308 transitions. [2024-10-13 10:53:58,054 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 308 transitions. Word has length 26 [2024-10-13 10:53:58,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:58,055 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 308 transitions. [2024-10-13 10:53:58,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:53:58,055 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 308 transitions. [2024-10-13 10:53:58,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:53:58,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:58,055 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 10:53:58,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 10:53:58,056 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:53:58,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:58,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1979681309, now seen corresponding path program 1 times [2024-10-13 10:53:58,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:58,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393396173] [2024-10-13 10:53:58,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:58,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:58,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:53:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:58,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:58,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393396173] [2024-10-13 10:53:58,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393396173] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:53:58,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740013099] [2024-10-13 10:53:58,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:58,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:53:58,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:53:58,762 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-10-13 10:53:58,763 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-10-13 10:53:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:58,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 10:53:58,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:53:58,932 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-10-13 10:53:58,974 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-10-13 10:53:59,063 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 21 treesize of output 9 [2024-10-13 10:53:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:59,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:53:59,097 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 34 treesize of output 28 [2024-10-13 10:53:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:59,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740013099] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:53:59,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:53:59,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 6] total 21 [2024-10-13 10:53:59,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432865344] [2024-10-13 10:53:59,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:53:59,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 10:53:59,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:59,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 10:53:59,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-10-13 10:53:59,195 INFO L87 Difference]: Start difference. First operand 234 states and 308 transitions. Second operand has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:54:03,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:54:07,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:54:11,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:54:15,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:54:19,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:54:24,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:54:28,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:54:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:54:28,338 INFO L93 Difference]: Finished difference Result 385 states and 478 transitions. [2024-10-13 10:54:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 10:54:28,341 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-10-13 10:54:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:54:28,343 INFO L225 Difference]: With dead ends: 385 [2024-10-13 10:54:28,343 INFO L226 Difference]: Without dead ends: 385 [2024-10-13 10:54:28,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2024-10-13 10:54:28,346 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 673 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 98 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.9s IncrementalHoareTripleChecker+Time [2024-10-13 10:54:28,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 927 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 966 Invalid, 7 Unknown, 0 Unchecked, 28.9s Time] [2024-10-13 10:54:28,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-13 10:54:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 306. [2024-10-13 10:54:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 232 states have (on average 1.3663793103448276) internal successors, (317), 261 states have internal predecessors, (317), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 29 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 10:54:28,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 401 transitions. [2024-10-13 10:54:28,361 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 401 transitions. Word has length 26 [2024-10-13 10:54:28,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:54:28,361 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 401 transitions. [2024-10-13 10:54:28,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:54:28,362 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 401 transitions. [2024-10-13 10:54:28,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:54:28,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:54:28,363 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 10:54:28,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-13 10:54:28,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:54:28,564 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:54:28,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:54:28,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1979681308, now seen corresponding path program 1 times [2024-10-13 10:54:28,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:54:28,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51760222] [2024-10-13 10:54:28,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:54:28,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:54:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:29,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:54:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:29,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:54:29,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:54:29,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51760222] [2024-10-13 10:54:29,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51760222] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:54:29,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134969352] [2024-10-13 10:54:29,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:54:29,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:54:29,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:54:29,371 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-10-13 10:54:29,372 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-10-13 10:54:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:29,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 10:54:29,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:54:29,523 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-10-13 10:54:29,571 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-10-13 10:54:29,574 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-10-13 10:54:29,752 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 21 treesize of output 9 [2024-10-13 10:54:29,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:54:29,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:54:29,907 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 70 treesize of output 64 [2024-10-13 10:54:29,915 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 94 treesize of output 82 [2024-10-13 10:54:29,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:54:29,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:54:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:54:29,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134969352] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:54:29,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:54:29,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 6] total 24 [2024-10-13 10:54:29,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596886523] [2024-10-13 10:54:29,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:54:29,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 10:54:29,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:54:29,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 10:54:29,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2024-10-13 10:54:29,997 INFO L87 Difference]: Start difference. First operand 306 states and 401 transitions. Second operand has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 25 states have internal predecessors, (65), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:54:31,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:54:31,489 INFO L93 Difference]: Finished difference Result 414 states and 510 transitions. [2024-10-13 10:54:31,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:54:31,490 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 25 states have internal predecessors, (65), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2024-10-13 10:54:31,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:54:31,491 INFO L225 Difference]: With dead ends: 414 [2024-10-13 10:54:31,492 INFO L226 Difference]: Without dead ends: 414 [2024-10-13 10:54:31,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=293, Invalid=1189, Unknown=0, NotChecked=0, Total=1482 [2024-10-13 10:54:31,493 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 446 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 10:54:31,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 987 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 10:54:31,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-13 10:54:31,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 332. [2024-10-13 10:54:31,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 250 states have (on average 1.352) internal successors, (338), 281 states have internal predecessors, (338), 47 states have call successors, (47), 18 states have call predecessors, (47), 18 states have return successors, (47), 32 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-13 10:54:31,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 432 transitions. [2024-10-13 10:54:31,502 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 432 transitions. Word has length 26 [2024-10-13 10:54:31,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:54:31,503 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 432 transitions. [2024-10-13 10:54:31,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 25 states have internal predecessors, (65), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:54:31,503 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 432 transitions. [2024-10-13 10:54:31,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 10:54:31,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:54:31,504 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 10:54:31,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 10:54:31,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:54:31,708 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:54:31,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:54:31,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2081231958, now seen corresponding path program 1 times [2024-10-13 10:54:31,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:54:31,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817777541] [2024-10-13 10:54:31,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:54:31,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:54:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:31,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:54:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:31,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 10:54:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:54:31,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:54:31,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817777541] [2024-10-13 10:54:31,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817777541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:54:31,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:54:31,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:54:31,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992665028] [2024-10-13 10:54:31,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:54:31,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:54:31,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:54:31,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:54:31,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:54:31,767 INFO L87 Difference]: Start difference. First operand 332 states and 432 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:54:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:54:31,807 INFO L93 Difference]: Finished difference Result 333 states and 417 transitions. [2024-10-13 10:54:31,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:54:31,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-10-13 10:54:31,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:54:31,809 INFO L225 Difference]: With dead ends: 333 [2024-10-13 10:54:31,810 INFO L226 Difference]: Without dead ends: 333 [2024-10-13 10:54:31,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:54:31,810 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 37 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:54:31,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 240 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:54:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-13 10:54:31,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 320. [2024-10-13 10:54:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 246 states have (on average 1.3414634146341464) internal successors, (330), 273 states have internal predecessors, (330), 39 states have call successors, (39), 18 states have call predecessors, (39), 18 states have return successors, (39), 28 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 10:54:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 408 transitions. [2024-10-13 10:54:31,823 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 408 transitions. Word has length 30 [2024-10-13 10:54:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:54:31,823 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 408 transitions. [2024-10-13 10:54:31,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:54:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 408 transitions. [2024-10-13 10:54:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 10:54:31,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:54:31,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:54:31,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 10:54:31,824 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:54:31,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:54:31,825 INFO L85 PathProgramCache]: Analyzing trace with hash -633640057, now seen corresponding path program 1 times [2024-10-13 10:54:31,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:54:31,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948562259] [2024-10-13 10:54:31,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:54:31,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:54:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:32,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:54:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:32,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 10:54:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:54:32,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:54:32,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948562259] [2024-10-13 10:54:32,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948562259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:54:32,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:54:32,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:54:32,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596566196] [2024-10-13 10:54:32,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:54:32,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:54:32,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:54:32,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:54:32,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:54:32,024 INFO L87 Difference]: Start difference. First operand 320 states and 408 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:54:32,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:54:32,171 INFO L93 Difference]: Finished difference Result 340 states and 431 transitions. [2024-10-13 10:54:32,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:54:32,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-10-13 10:54:32,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:54:32,173 INFO L225 Difference]: With dead ends: 340 [2024-10-13 10:54:32,173 INFO L226 Difference]: Without dead ends: 340 [2024-10-13 10:54:32,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:54:32,174 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 110 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:54:32,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 284 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:54:32,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-10-13 10:54:32,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 326. [2024-10-13 10:54:32,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 251 states have (on average 1.3306772908366533) internal successors, (334), 278 states have internal predecessors, (334), 40 states have call successors, (40), 18 states have call predecessors, (40), 18 states have return successors, (40), 29 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 10:54:32,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 414 transitions. [2024-10-13 10:54:32,182 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 414 transitions. Word has length 29 [2024-10-13 10:54:32,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:54:32,182 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 414 transitions. [2024-10-13 10:54:32,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:54:32,183 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 414 transitions. [2024-10-13 10:54:32,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 10:54:32,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:54:32,184 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:54:32,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 10:54:32,184 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-13 10:54:32,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:54:32,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1871398323, now seen corresponding path program 1 times [2024-10-13 10:54:32,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:54:32,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640035282] [2024-10-13 10:54:32,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:54:32,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:54:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:32,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:54:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:54:32,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:54:32,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640035282] [2024-10-13 10:54:32,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640035282] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:54:32,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080057598] [2024-10-13 10:54:32,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:54:32,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:54:32,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:54:32,434 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-10-13 10:54:32,436 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-10-13 10:54:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:32,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 10:54:32,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:54:32,613 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-10-13 10:54:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:54:32,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:54:32,839 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 32 treesize of output 26 [2024-10-13 10:54:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:54:32,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080057598] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:54:32,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:54:32,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2024-10-13 10:54:32,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793897735] [2024-10-13 10:54:32,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:54:32,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 10:54:32,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:54:32,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 10:54:32,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-10-13 10:54:32,871 INFO L87 Difference]: Start difference. First operand 326 states and 414 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:54:36,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:54:40,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:54:44,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:54:48,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:54:52,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:54:57,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:55:01,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:55:05,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:55:09,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:55:13,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:55:17,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]